Dyalog APL: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
Miraheze>Marshall
No edit summary
Miraheze>Marshall
Line 151: Line 151:
|-
|-
| <source lang=apl inline>⌷</source> || [[Materialise]]      || [[Squad Indexing]]
| <source lang=apl inline>⌷</source> || [[Materialise]]      || [[Squad Indexing]]
|}
=== Operators ===
{|class=wikitable
! Syntax                                !! Monadic call        !! Dyadic call
|-
| <source lang=apl inline>f/</source>  || [[Reduction]]      || [[Windowed Reduction]]
|-
| <source lang=apl inline>f⌿</source>  || [[Reduction First]] || [[Windowed Reduction First]]
|-
| <source lang=apl inline>f\</source>  || [[Scan]]            ||
|-
| <source lang=apl inline>f⍀</source>  || [[Scan First]]      ||
|-
| <source lang=apl inline>f¨</source>  ||colspan=2| [[Each]]
|-
| <source lang=apl inline>f⍨</source>  ||colspan=2| [[Commute]]
|-
| <source lang=apl inline>A⍨</source>  ||colspan=2| [[Constant]]
|-
| <source lang=apl inline>f⍣v</source>  ||colspan=2| [[Power]]
|-
| <source lang=apl inline>f.g</source>  ||                    || [[Inner Product]]
|-
| <source lang=apl inline>∘.f</source>  ||                    || [[Outer Product]]
|-
| <source lang=apl inline>A∘g</source>  ||rowspan=2| [[Bind]]  ||
|-
| <source lang=apl inline>f∘B</source>  ||
|-
| <source lang=apl inline>f∘g</source>  ||colspan=2| [[Beside]]
|-
| <source lang=apl inline>f⍤B</source>  ||colspan=2| [[Rank]]
|-
| <source lang=apl inline>f⍤g</source>  ||colspan=2| [[Atop]]
|-
| <source lang=apl inline>f⍥g</source>  ||colspan=2| [[Over]]
|-
| <source lang=apl inline>f@v</source>  ||colspan=2| [[At]]
|-
| <source lang=apl inline>f⍠B</source>  ||colspan=2| [[Variant]]
|-
| <source lang=apl inline>f⌸</source>  ||colspan=2| [[Key]]
|-
| <source lang=apl inline>f⌺B</source>  || [[Stencil]]        ||
|-
| <source lang=apl inline>A⌶</source>  ||colspan=2| [[I-Beam]]
|-
| <source lang=apl inline>f&</source>  ||colspan=2| [[Spawn]]
|-
| <source lang=apl inline>f[B]</source> ||colspan=2| [[Function axis|Axis]]
|}
|}



Revision as of 09:20, 1 November 2019

Dyalog APL was first released by British company Dyadic Systems Ltd. (later Dyalog Ltd.) in 1983 for the Zylog Z80 processor. The name Dyalog is a portmanteau of Dyadic and Zylog. As of 2018, Dyalog APL is available for AIX, Linux (including on the Raspberry Pi), macOS and Microsoft Windows platforms. While mainly based is based on APL2, it adds support for both object-oriented, functional, and tacit programming. Dyalog APL also serves as the inspiration for many hobby implementations of APL.

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 novel extension to the original APL language include:

  • 1983: Naming derived functions (sum←+⌿)
  • 1990: Namespaces (MyUtils.Fun args)
  • 1995: Keywords (If/Then/Else, Repeat/Until, exception handling, and so on)
  • 1996: Functional programming: dfns provide lexical scope and lambda-style expressions
  • 2006: Object orientated programming, allowing integration with OO frameworks and Microsoft .NET
  • 2014: Tacit syntax similar to that of J (+⌿÷≢)
  • 2014: Futures and isolates for Parallel computing

Primitives

Functions

Glyph Monadic Dyadic
+ Conjugate Plus
- Negate Minus
× Signum Times
÷ Reciprocal Divide
| Magnitude Residue
Floor Minimum
Ceiling Maximum
* Exponential Power
Natural Logarithm Logarithm
! Factorial Binomial
Pi Times Circular
~ Not Without
? Roll Query
And
Or
Nand
Nor
< Less
Less Or Equal
= Equal
Greater Or Equal
> Greater
Unique Mask Not Equal
Shape Reshape
, Ravel Catenate
Table Catenate First
Reverse Rotate
Reverse First Rotate First
Transpose
Mix/Disclose Take
Split Drop
Enclose Partitioned Enclose
Nest Partition
Enlist/Type Membership
Disclose/Mix Pick
/ Replicate
Replicate First
\ Expand
Expand First
Intersection
Unique Union
Same Left
Same Right
Index Generator Index Of
Where Interval Index
Grade Down
Grade Up
Find
Depth Match
Tally Not Match
Execute
Format
Base
Represent
Matrix Inverse Matrix Divide
Materialise Squad Indexing

Operators

Syntax Monadic call Dyadic call
f/ Reduction Windowed Reduction
f⌿ Reduction First Windowed Reduction First
f\ Scan
f⍀ Scan First
Each
f⍨ Commute
A⍨ Constant
f⍣v Power
f.g Inner Product
∘.f Outer Product
A∘g Bind
f∘B
f∘g Beside
f⍤B Rank
f⍤g Atop
f⍥g Over
f@v At
f⍠B Variant
f⌸ Key
f⌺B Stencil
A⌶ I-Beam
f& Spawn
f[B] Axis

External links

Template:APL programming language