Definitional interpreters for higher-order programming languages
John C. Reynolds · ACM Annual Conference · 1972
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy's definition of LISP, Landin's SECD machine, the Vienna definition of PL/I, Reynolds' definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call-by-value versus call-by-name) in the defined language depends upon the order of application in the defining language. As an example, we consider the definition of a simple applicative programming language by means of an interpreter written in a similar language. Definitions in each of the above classifications are derived from one another by informal but constructive methods. The treatment of imperative features such as jumps and assignment is also discussed.
Cited by 669 works. doi:10.1145/800194.805852
References
- Recursive functions of symbolic expressions and their computation by machine, Part I
- The calculi of lambda-conversion
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Towards a Mathematical Science of Computation
- Outline of a Mathematical Theory of Computation
- The next 700 programming languages
- The correctness of programs
- Translator writing systems
- Report on the Algorithmic Language ALGOL 68
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept