Continuation-passing, closure-passing style (1989)

Cached

Download Links

by Trevor Jim
Venue:In Sixteenth ACM Symposium on Principles of Programming Languages
Citations:111 - 9 self

Documents Related by Co-Citation

1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
625 Compiling With Continuations – A W Appel - 1992
195 ORBIT: An optimizing compiler for Scheme – David Kranz, Richard Kelsey, Jonathan Rees, Paul Hudak, James Philbin, Norman Adams - 1987
128 Rabbit: A compiler for Scheme – Guy L Steele - 1978
333 The mechanical evaluation of expressions – P J Landin - 1964
195 Standard ML of New Jersey – Andrew W. Appel, David B. Macqueen - 1991
179 Lambda Lifting: Transforming Programs to Recursive Equations – Thomas Johnsson - 1985
171 Unboxed Objects and Polymorphic Typing – Xavier Leroy - 1992
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
92 A Standard ML Compiler – Andrew W. Appel, David B. Macqueen - 1987
72 Realistic Compilation by Program Transformation – Richard Kelsey, Paul Hudak - 1989
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
540 The Implementation of Functional Programming Languages – Peyton Jones, S L - 1987
64 Runtime Tags Aren't Necessary – Andrew W. Appel, Andrew W - 1988
298 Control-Flow Analysis of Higher-Order Languages – Olin Shivers - 1991
67 Space-Efficient Closure Representations – Zhong Shao, Andrew W. Appel - 1994
154 Typed closure conversion – Yasuhiko Minamide, Greg Morrisett, Robert Harper - 1996
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
83 Control operators, the SECD machine and the -calculus – M Felleisen, D P Friedman - 1986