Problem formulation using APL
Harwood G. Kolsky · IBM Systems Journal · 1969
The APL formulation of a large-scale scientific problem can specify the solution precisely, while allowing the system much freedom in producing computed results. The testing and debugging stages of such application programming can be carried out at a terminal. The simplicity of APL helps the programmer see the main design of the problem by reducing the program size. In the problem-formulation phase, the APL programmer is aided by the mathematical consistency of the language and by the inherent explicitness of APL program statements from a mathematical point of view.