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

Documents Related by Co-Citation

333 The mechanical evaluation of expressions – P J Landin - 1964
625 Compiling With Continuations – A W Appel - 1992
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
90 Abstract Models of Memory Management – Greg Morrisett, Matthias Felleisen, Robert Harper - 1995
111 Continuation-passing, closure-passing style – Trevor Jim - 1989
154 Typed closure conversion – Yasuhiko Minamide, Greg Morrisett, Robert Harper - 1996
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
1097 Proof-Carrying Code – George C. Necula - 1997
180 The next 700 programming languages – P J Landin - 1966
84 A Theory of Programming Language Semantics – R Milne, C Strachey - 1976
283 Region-Based Memory Management – Mads Tofte, Jean-Pierre Talpin - 1997
101 Lambda-Calculus Schemata – Michael J. Fischer - 1993
171 Call-by-name, call-by-value, and the lambda calculus – Gordon Plotkin - 1975
35 Polymorphic type assignment and CPS conversion – Robert Harper, Mark Lillibridge - 1993
260 Compiling polymorphism using intensional type analysis – Robert Harper, Greg Morrisett - 1995
15 Proving algorithms by tail functions – A Mazurkiewicz - 1971
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
191 Outline of a mathematical theory of computation – D S Scott - 1970