J: Difference between revisions
(Remove "Also on Wikipedia" template since the message is not appropriate here) |
mNo edit summary |
||
| Line 119: | Line 119: | ||
| 4.06 || 2001-05-09 || <source lang=j inline>assert.</source> and <source lang=j inline>throw.</source>, Symbols (<source lang=j inline>s:</source>) and Unicode (<source lang=j inline>u:</source>), multiple axes in [[Cut]] operator | | 4.06 || 2001-05-09 || <source lang=j inline>assert.</source> and <source lang=j inline>throw.</source>, Symbols (<source lang=j inline>s:</source>) and Unicode (<source lang=j inline>u:</source>), multiple axes in [[Cut]] operator | ||
|- | |- | ||
| 5.01 || 2002-09-10 || Non-[[Close | | 5.01 || 2002-09-10 || Non-[[Close composition|close]] [[Under]] <source lang=j inline>&.:</source>, Bitwise Operations (<source lang=j inline>b.</source>), Polynomial Derivative (<source lang=j inline>p..</source>), Head (<source lang=j inline>{.</source>) and Tail (<source lang=j inline>{:</source>) allow [[empty]] arguments | ||
|- | |- | ||
| 5.02 || 2003-05-21 || | | 5.02 || 2003-05-21 || | ||
Revision as of 14:13, 10 January 2020
J is an array language loosely following the SHARP APL tradition which uses ASCII characters for primitive functionality and builds in leading axis theory and tacit programming as foundational design principles. J discards backwards compatibility with older APLs in order to simplify and regularize its syntax, redesign primitives to work on leading axes, and disentangle reduction from scans and windowed reductions (yielding the prefix and infix operators). However, J concepts such as function trains and the Indices function have been adopted by later APLs such as NARS2000, Dyalog APL, and dzaima/APL. J breaks the APL convention of writing primitives with a single glyph: instead, they are spelled with a single ASCII character possibly followed by one or two periods (.) or colons (:). It is also notable for its use of terms from English grammar to describe the language. For example, functions are called "verbs" while arrays are called "nouns".
History
J was initially designed primarily by Ken Iverson and Roger Hui, with input from Arthur Whitney and Eric Iverson. Ken had been considering a new language based on A Dictionary of APL but without the backwards compatibility constraints of APL and the custom character set (which was a major technical issue at the time). In "A Personal View of APL"[1] he gives the following as the most important goals for a new language:
- Is available as “shareware”, and is inexpensive enough to be acquired by students as well as by schools
- Can be printed on standard printers
- Runs on a wide variety of computers
- Provides the simplicity and the generality of the latest thinking in APL
Iverson's phrase "the latest thinking in APL" refers to two major breakthroughs made that decade: the invention of the Rank operator by Arthur Whitney in 1982 and subsequent development of leading axis theory, and the invention of function trains by Iverson and Eugene McDonnell in 1988.
In the summer of 1989 Whitney visited Iverson, who discussed with Whitney his plans for a new array language. Whitney wrote a one-page prototype for the language in a single afternoon using C. Iverson shared the program with Roger Hui, who began working on J on August 27 and quickly produced a more complete prototype.[1][2][3] The name "J", chosen by Hui when saving the first source code file, is meaningless: in An Implementation of J, Hui remarks "Why 'J'? It is easy to type."[4] J was first presented by Hui and Iverson, including a live demo, at a meeting of the Toronto APLSIG in February 1990.[5]
In 1990 Hui and Iverson joined Iverson Software Inc. (now Jsoftware), which had been founded that year by Eric Iverson to sell a SHARP APL product. Eric converted his SHARP session to use with J as Hui continued on the core language's implementation. The J language, including Eric's session environment, was first released at APL90 in Copenhagen August 1990.[5]
Versions
J has used two numbering systems. Releases prior to 1994 used a single decimal and the naming scheme "Version X.Y", while those after used two decimals and are called "Release X.YY", or "JXYY" as in "J807".
| Version | Date | Features |
|---|---|---|
| 2.0 | 1990-08-09 | (APL90) |
| 2.7 | 1990-10-22 | Rank with a function right operand, Under |
| 2.8 | 1990-11-15 | |
| 2.9 | 1991-02-15 | Monadic +: (double), -: (halve), *: (square), dyadic ": (Format), constant functions 0: and 1:
|
| 3.0 | 1991-03-17 | Changes to spellings, Reverse with Variant to specify fill |
| 3.1 | 1991-05-17 | Determinant (.)
|
| 3.2 | 1991-06-02 | ,. for ravel items (like Table) and append lists, ; for Raze and Link, @. for agenda, non-close compositions
|
| 3.3 | 1991-06-25 | Dyadic ,. changed to append items, more types of trains
|
| 3.4 | 1991-07-15 | NB. for comments
|
| 4.0 | 1991-11-23 | Monadic +. and *. for complex components and phase/magnitude with j. and r. to recombine, ^:_ for power limit
|
| 4.1 | 1992-02-02 | ^!.p for rising/falling factorials
|
| 4.2 | 1992-03-19 | |
| 5.0 | 1992-06-22 | Variant to specify comparison tolerance and fill for Take |
| 5.1 | 1992-07-28 | f. to expand a tacit function containing names, constant functions 2: to 9:
|
| 5.1a | 1992-08-11 | |
| 6.0 | 1992-10-24 | Error handling with ::, additional system functions
|
| 6.1 | 1992-11-26 | Amend operator }
|
| 6.2 | 1992-12-20 | Derivative operator D.
|
| 7.0 | 1993-11-14 | Taylor series operators t. and T.
|
| Release | Date | Features |
|---|---|---|
| 2.01 | 1994-09-01 | Control structures, many additional system functions |
| 2.03 | 1994-09-21 | |
| 2.04 | 1994-11-28 | |
| 2.05 | 1995-02-26 | Additional inverses, primitive array a: ("ace")
|
| 2.06 | 1995-05-30 | More inverses, hypergeometric operator H., and prime functions p., p:, and q:
|
| 3.01 | 1996-01-16 | Repeatable Roll/Deal ?., Depth L. and Depth operator L:, total array ordering
|
| 3.02 | 1996-06-24 | Pick variant {::, extended precision types
|
| 3.03 | 1996-12-13 | Multiple assignment using a string target |
| 3.04 | 1997-05-19 | More operators with gerund operands, for. and select. control structures
|
| 3.05 | 1997-09-27 | Extended dyad q: (Factor) to take a negative left argument
|
| 4.01 | 1998-03-22 | Find (E.) and Index of Last (i:)
|
| 4.02 | 1998-11-07 | Symmetric range monad (i:), infinite left arguments to Take
|
| 4.03 | 1999-04-21 | |
| 4.04 | 2000-01-02 | Sparse array support |
| 4.05 | 2000-09-05 | Comparison tolerance for Key |
| 4.06 | 2001-05-09 | assert. and throw., Symbols (s:) and Unicode (u:), multiple axes in Cut operator
|
| 5.01 | 2002-09-10 | Non-close Under &.:, Bitwise Operations (b.), Polynomial Derivative (p..), Head ({.) and Tail ({:) allow empty arguments
|
| 5.02 | 2003-05-21 | |
| 5.03 | 2004-03-19 | Indices (I.), Sequential Machine (;:)
|
| 5.04 | 2005-03-18 | J64 (64-bit version) introduced, boxed right argument for Power operator, scalar extension for left argument of Cut (;.)
|
| 6.01 | 2006-07-21 | Noun left arguments in trains (N0 V1 V2), dots removed from explicit argument names (y. to y, etc.), Interval Index (I.)
|
| 6.02 | 2008-02-29 | Index Of (i.) extended to allow unmatched cell shapes, Memoize adverb (M.)
|
| 7.01 | 2010-08-05 | GTK IDE |
| 7.02 | ||
| 8.01 | 2014-02 | Qt IDE |
| 8.02 | 2014-08-02 | Qt IDE improved |
| 8.03 | 2014-12-09 | Native read/write of jpeg and png images |
| 8.04 | 2016-01-04 | |
| 8.05 | 2016-12-19 | Improved UTF-8 handling, memory allocator rewritten with more in-place argument usage |
| 8.06 | 2017-11-12 | Allow array right operands to Atop and Adverse (::), treating as constant functions, improved vector instruction usage
|
| 8.07 | 2018-10-08 | Removed support for dot-style explicit arguments (e.g. y.)
|
| 9.01 | 2019-12-15 | Iteration primitives F.., F.:, F., F:., F::, F:; Remove calculus operators d., D., D:, t., t:, T., .., .:; gerund"r
|
References
- ↑ 1.0 1.1 Iverson, K.E. "A Personal View of APL". IBM Systems Journal, Volume 30, Number 4. 1991-12.
- ↑ Hui, Roger. "Incunabulum". From An Implementation of J, Appendix A: Incunabulum, 1992-01-27.
- ↑ McIntyre, Donald. "A Tribute to Roger Hui, presented at APL96". 1996.
- ↑ Hui, Roger. An Implementation of J (pdf), Preface. 1992-01-27.
- ↑ 5.0 5.1 Hui, Roger. "Remembering Ken Iverson". 2004-11.
| APL dialects [edit] | |
|---|---|
| Maintained | APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ Dyalog APL Vision ∙ dzaima/APL ∙ GNU APL ∙ Kap ∙ NARS2000 ∙ Pometo ∙ TinyAPL |
| Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL2C ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Extended Dyalog APL ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ Operators and Functions ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
| Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ K (Goal, Klong, Q) ∙ KamilaLisp ∙ Lang5 ∙ Lil ∙ Nial ∙ RAD ∙ Uiua |
| Overviews | Comparison of APL dialects ∙ Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |