Toward a primitive recursive semantics for APL
Richard J. Orgass · 1976
A natural framework for a formal semantics of programming languages is described and applied to APL. This framework can be used both for program verification and for language implementation. Although the framework applies only to the primitive recursive fragments of programming languages, it includes most, if not all, programs of practical interest. The power, simplicity and regular structure of APL makes the language an excellent example for this kind of semantics. An outline of the application of the framework to APL and its use for APL implementation and verification are presented.