A Programming Language

A Programming Language is a book published in 1962 by Kenneth E. Iverson to describe one iteration of his Iverson notation. The book's title later was used to form the acronym APL. At the time of writing Iverson notation was used for mathematics and description of IBM's hardware, and its purely human purposes are reflected in the loose conventions (relative to APL) and two-dimensional structure of the notation presented in A Programming Language.

Notation
A Programming Language does not feature a full multidimensional array model. Rather, operations are defined on scalars, vectors, and matrices and higher-rank arrays are not discussed. Nonetheless, it features many of the array conveniences that became characteristics of APL:
 * Scalar functions are present with the name "basic operations".
 * While scalar extension is not defined in general, a scalar can be multiplied by an array as a "scalar multiple".
 * Vector functions are usually extended to work on the rows of matrices (the opposite of the leading axis model). When doubled typographically, they work on columns instead.

In addition to scalars, vectors, and matrices, tree and file types are defined.

A Programming Language features precursors of many APL primitive functions. These include:
 * The shape vector is not used, but dimension functions are present: ν gives the length of a vector, and ν and μ give the row length and column length of a matrix.
 * Comparison functions are defined using the symbols,  , and   and the rules that a vertical bar negates a relation and that an underline combines it with   (relations are combined by or-ing them together).
 * The arithmetic scalar functions Sum, Difference , Product (×), and Quotient (÷) are defined as in mathematics.
 * The logical functions And and Or  also match mathematical usage. Logical negation is denoted with an overbar.
 * The functions Absolute Value, Ceiling, and Floor use paired symbols. The paired symbols for ceiling and floor were adopted by mathematicians (absolute value was already in use), but APL implementations dropped the closing symbol for consistency with monadic function syntax.
 * Residue uses  as in APL, but allows a subscript to indicate the smallest value allowed—mirroring index origin.
 * Iota is called "Interval" and uses the letter  with an optional index origin subscript.
 * Index-Of is also written with  and an index origin subscript. It is defined on vector left arguments and vector or scalar right arguments.
 * Membership is  as in APL.
 * Reduction (, or  instead of  ) starts from the left rather than the right. For reductions of empty arrays, the identity element is returned.
 * Rotate is written with arrows:  for left rotation and   for right rotation.
 * Reverse is written with an arrow in some direction above the argument.
 * Transpose is written with a tilde  above a matrix.
 * Compression and Expansion use  and   as in APL.
 * Catenate uses a circled comma.
 * Indexing is written with a subscript, or  to allow index origin specification.
 * Grade is called "ordering", and the Grade of  with index origin   is written
 * Base on vectors works like in APL. On matrices, rows are paired up, or columns with a doubled base symbol.
 * The Intersection and Union are written with  and , and the Set Difference with.
 * The Inner Product is written by placing one scalar function above another, and the Outer Product by using  in place of the top function with two vector arguments.