Definitional interpreters for higher-order programming languages (1972)

Cached

Download Links

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

Documents Related by Co-Citation

91 Lambda-Calculus Schemata – Michael J. Fischer - 1993
490 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
595 Compiling with Continuations – Andrew Appel - 1992
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
107 Continuation-passing, closure-passing style – Trevor Jim - 1989
89 Abstract Models of Memory Management – Greg Morrisett, Matthias Felleisen, Robert Harper - 1995
1016 Proof-Carrying Code – George C. Necula - 1997
268 Region-Based Memory Management – Mads Tofte, Jean-Pierre Talpin - 1997
148 Call-by-name, call-by-value and the lambda-calculus – G D Plotkin
252 Compiling polymorphism using intensional type analysis – Robert Harper, Greg Morrisett - 1995
146 Typed closure conversion – Yasuhiko Minamide, Greg Morrisett, Robert Harper - 1996
299 The mechanical evaluation of expressions – P J Landin - 1964
219 Call-by-name, call-by-value, and the -calculus – G D Plotkin - 1975
78 Theory of programming language and semantics – R Milne, C A Starchey - 1976
557 From System F to Typed Assembly Language – Greg Morrisett, David Walker, Karl Crary, Neal Glew - 1998
1023 Yellin F. Java Virtual Machine Specification – T Lindholm - 1999
651 Notions of Computation and Monads – Eugenio Moggi - 1991
1224 Introduction to functional programming – Philip Wadler - 1995
33 Polymorphic type assignment and CPS conversion – Robert Harper, Mark Lillibridge - 1993