Definitional interpreters for higher-order programming languages (1972)
Cached
Download Links
- [eecs.harvard.edu]
- [people.cs.uchicago.edu]
- [www.brics.dk]
- [cs.au.dk]
- DBLP
Other Repositories/Bibliography
| Venue: | Reprinted from the proceedings of the 25th ACM National Conference |
| Citations: | 289 - 2 self |
BibTeX
@INPROCEEDINGS{Reynolds72definitionalinterpreters,
author = {John C. Reynolds},
title = {Definitional interpreters for higher-order programming languages},
booktitle = {Reprinted from the proceedings of the 25th ACM National Conference},
year = {1972},
pages = {717--740},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that 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.
