Definitional interpreters for higher-order programming languages

Definitional interpreters for higher-order programming languages (1972)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by John C. Reynolds

Venue:	Reprinted from the proceedings of the 25th ACM National Conference
Citations:	263 - 2 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Definitional interpreters for higher-order programming languages	INFERENCE
AUTHOR NAME	John C. Reynolds	SVM HeaderParse 0.2
AUTHOR AFFIL	Systems and Information Science, Syracuse University	SVM HeaderParse 0.2
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.	SVM HeaderParse 0.2
YEAR	1972	INFERENCE
VENUE	Reprinted from the proceedings of the 25th ACM National Conference	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	717--740	INFERENCE
VOLUME	11	INFERENCE
CITATIONS	32 found	ParsCit 1.0