Definitional interpreters for higher-order programming languages (1972)

by John C. Reynolds
Venue:Reprinted from the proceedings of the 25th ACM National Conference
Citations:299 - 2 self

Active Bibliography

110 The Discoveries of Continuations – John C. Reynolds - 1993
6 Interpreter Prototypes From Formal Language Definitions – Gregory John Michaelson - 1993
15 The Early Search for Tractable Ways of Reasoning About Programs – C. B. Jones - 2003
9 On the Search for Tractable Ways of Reasoning about Programs – C. B. Jones - 2001
Functions, Frames, and Interactions -- completing a λ-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments – Claus Reinke - 1998
2 Can programming be liberated from the von . . . – John Backus - 1978
unknown title – unknown authors
J is for JavaScript: A direct-style correspondence between Algol-like languages and JavaScript using . . . – Olivier Danvy, Chung-Chieh Shan, Ian Zerny
2 A mechanical analysis of program verification strategies – Sandip Ray - 2008
13 Verification Condition Generation via Theorem Proving – John Matthews, J Strother Moore, Ip Ray, Daron Vroon - 2006
55 Structured programming with go to statements – Donald E. Knuth - 1974
8 Abstract Models of Storage – Robert D. Tennent, Dan R. Ghica - 2000
24 A Theorem Prover for a Computational Logic – Robert S. Boyer, J Strother Moore - 1990
1 Using the Topological Characterization of Synchronous Models – Giovanni Adagio - 2002
110 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
3 A Rational Deconstruction of Landin’s J Operator – Olivier Danvy, Kevin Millikin - 2006
27 A rational deconstruction of Landin’s SECD machine – Olivier Danvy, Kevin Millikin - 2004
10 Recursion from Iteration – Andrzej Filinski - 1994
Histories of Discoveries of Continuations: Belles-Lettres with Equivocal Tenses – Peter Landin Department, Peter Landin - 1997