Definitional interpreters for higher-order programming languages

@inproceedings{Reynolds1972DefinitionalIF,
  title={Definitional interpreters for higher-order programming languages},
  author={John C. Reynolds},
  booktitle={ACM '72},
  year={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… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS