1988 · 291 citations · 9 references
ComputingComputer ScienceProgramming LanguagesSyntaxSystems ProgrammingAbstract Syntax TreesControl SystemsControl TheoryControl-flow AnalysisProgramming Language DesignType SystemsLambda CalculusStructural Operational Semantics
An analysis of the λugr;-C-calculus and its problematic relationship to operational equivalence leads to a new control facility: the prompt-application. With the introduction of prompt-applications, the control calculus becomes a traditional calculus all of whose equations imply operational equivalence. In addition, prompt-applications enhance the expressiveness and efficiency of the language. We illustrate the latter claim with examples from such distinct areas as systems programming and tree processing.
9
Call-by-name, call-by-value and the λ-calculus
Gordon Plotkin · Theoretical Computer Science · 1975 · 1.2K citations
The Mechanical Evaluation of Expressions
P. J. Landin · The Computer Journal · 1964 · 932 citations · Full text
Definitional interpreters for higher-order programming languages
John Reynolds · 1972 · 668 citations
The next 700 programming languages
P. J. Landin · Communications of the ACM · 1966 · 581 citations · Full text