APL is an extremely powerful, expressive and concise programming language. It was originally created as a way to express mathematical notation in a rigorous way that could be interpreted by a computer. It is easy to learn but APL programs can take some time to understand. Unlike traditional structured programming languages, code in APL is typically structured as chains of monadic or dyadic operators acting on arrays. Because APL has so many nonstandard operators, APL does not have operator precedence. The original APL did not have control structures (loops, ifthenelse), but the array operations it included could simulate structured programming constructs. For example, the iota operator (which yields an array from 1 to N) can simulate for loop iteration. APL systems are typically interactive.
APL is renowned for using a set of nonASCII symbols that are an extension of traditional arithmetic and algebraic notation. These cryptic symbols, some have joked, make it possible to construct an entire air traffic control system in two lines of code. Because of its condensed nature and nonstandard characters, APL has sometimes been termed a "writeonly language", and reading an APL program can feel like decoding an alien tongue. Because of the unusual characterset, many programmers used special APL keyboards in the production of APL code. Nowadays there are various ways to write APL code using only ASCII characters.
Iverson designed a successor to APL called J which uses ASCII "natively". So far there is a sole single source of J implementations: http://www.jsoftware.com/ Other programming languages offer functionality similar to APL. A+ (http://www.aplusdev.org/) is an open source programming language with many commands identical to APL.
"APL, in which you can write a program to simulate shuffling a deck of cards and then dealing them out to several players in four characters, none of which appear on a standard keyboard"  David Given[?]
Here's how you would write a "Hello World" program in APL:
'Hello World'
Here's how you would write a program that would sort a word list stored in vector X according word length:
X[X+.¬' ';]
Here's a program that find all prime numbers from 1 to N:
(.tilde N .contains N .cirle . .product N)/N .leftarrow 1 .downarrow .iota N
Here's how to read it, from right to left:
1. .iota N creates a vector containing integers from 1 to N (if N = 6 at the beginning of the program, .iota N is {1, 2, 3, 4, 5, 6}
2. Drop first element of this vector (.downarrow function), i.e. 1. So 1 .downarrow .iota N is {2, 3, 4, 5, 6}
3. Set N to the vector (.leftarrow, assignment operator)
4. Generate outer product of R multiplied by R, i.e. a matrix which is the "multiplication table" of R by R (.circle . .product function)
5. Build a vector the same length as N with 1 in each place where the corresponding number in N is in the outer product matrix (.contains, set inclusion function), i.e. {0, 0, 1, 0, 1}
6. Logically negate the values in the vector (change zeros to ones and ones to zeros) (.tilde, negation function), i.e. {1, 1, 0, 1, 0}
7. Select the items in N for which the corresponding element is 1 (slash function), i.e. {2, 3, 5}
Here's the equivalent in Perl (another "writeonly" language):
perl le '$_ = 1; (1 x $_) !~ /^(11+)1+$/ && print while $_++'
Search Encyclopedia

Featured Article
