Definitional interpreters for higher-order programming languages

@inproceedings{Reynolds1972DefinitionalIF,
  title={Definitional interpreters for higher-order programming languages},
  author={J. Reynolds},
  booktitle={ACM '72},
  year={1972}
}
  • J. Reynolds
  • Published in ACM '72 1972
  • Computer Science
  • 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
    732 Citations
    Abstracting definitional interpreters (functional pearl)
    • 27
    • PDF
    Embedded interpreters
    • N. Benton
    • Computer Science
    • J. Funct. Program.
    • 2005
    • 44
    • PDF
    Tagless staged interpreters for typed languages
    • 84
    • PDF
    Revised5 Report on the Algorithmic Language Scheme
    • 561
    • PDF
    Typesafe by Definition for Languages with Explicit Deallocation
    What is a Purely Functional Language?
    • A. Sabry
    • Computer Science
    • J. Funct. Program.
    • 1998
    • 47
    • PDF
    Control-flow analysis of higher-order languages of taming lambda
    • 668
    • PDF
    Simple lambda-calculus model of programming languages
    • 4
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    A λ-CALCULUS APPROACH
    • 47
    • Highly Influential
    Notes on programming linguistics
    • Technical report,
    • 1971
    Method and notation for the formal definition of programming languages
    • Technical Report TR 25.087,
    • 1968
    Continuous lattices
    • 1971
    Continuous lattices
    • 1971
    Lattice theory, data types and semantics
    • Formal Semantics of Programming Languages: Courant Computer Science Symposium
    • 1970
    Lattice theory, data types and semantics
    • Formal Semantics of Programming Languages: Courant Computer Science Symposium
    • 1970
    Formal description of program structure and semantics in first order logic
    • Machine Intelligence
    • 1969
    A Correspondence Between ALGOL 60 and Church's Lambda- Notation: Part I*
    • 144
    • Highly Influential