Dyalog APL: Difference between revisions

Jump to navigation Jump to search
12 bytes removed ,  20:07, 28 October 2019
no edit summary
Miraheze>Adám Brudzewsky
No edit summary
Miraheze>Adám Brudzewsky
No edit summary
Line 23: Line 23:
In 1995, two of the development team — [[John Scholes]] and [[Peter Donnelly]] — were awarded the [[Iverson Award]] for their work on the interpreter. [[Gitte Christensen]] and [[Morten Kromberg]] were joint recipients of the Iverson Award in 2016.
In 1995, two of the development team — [[John Scholes]] and [[Peter Donnelly]] — were awarded the [[Iverson Award]] for their work on the interpreter. [[Gitte Christensen]] and [[Morten Kromberg]] were joint recipients of the Iverson Award in 2016.


Dyalog APL is unique among commercial APLs in getting additional primitives and constructs. The most important extensions to the original APL language include:
Dyalog APL is unique among commercial APLs in getting additional primitives and constructs. The most important novel extension to the original APL language include:


* 1983: Nested arrays: Any element of an array can be another array (APL2)
* 1983: Naming derived functions (<code>sum←+⌿</code>)
* 1990: Namespaces
* 1990: Namespaces (<code>MyUtils.Fun args</code>)
* 1995: [[Control structures|Keywords]] (If/Then/Else, Repeat/Until, exception handling, and so on)
* 1995: [[Control structures|Keywords]] (If/Then/Else, Repeat/Until, exception handling, and so on)
* 1996: Functional programming: [[dfns]] provide lexical scope and [[lambda-style expressions|Dfns]]
* 1996: Functional programming: [[dfn|dfns]] provide lexical scope and lambda-style expressions
* 2006: [[Object orientated programming]], allowing integration with OO frameworks and Microsoft .NET
* 2006: [[Object orientated programming]], allowing integration with OO frameworks and Microsoft .NET
* 2014: Point-free or &quot;[[tacit|Train]]&quot; syntax similar to that in the J programming language
* 2014: [[Tacit]] syntax similar to that of [[J]] (<code>+⌿÷≢</code>)
* 2014: Futures and isolates for [[parallel programming|Parallel computing]]
* 2014: Futures and isolates for [[parallel programming|Parallel computing]]


Navigation menu