Proper Tail Recursion and Space Efficiency (1998)

Cached

Download Links

by William D. Clinger
Citations:59 - 1 self

Documents Related by Co-Citation

255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
333 The mechanical evaluation of expressions – P J Landin - 1964
90 Stack Inspection: Theory and Variants – Cédric Fournet, Andrew D. Gordon - 2001
74 PLT MzScheme: Language manual – Matthew Flatt, Copyright C○- Matthew Flatt - 1997
625 Compiling With Continuations – A W Appel - 1992
72 Control operators, the SECDmachine, and the λ-calculus – Matthias Felleisen, Daniel P Friedman - 1986
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
24 Programming languages and lambda calculi. Unpublished lecture notes – M Felleisen, M Flatt
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
156 Fundamental concepts in programming languages – C Strachey - 1967
19 From Interpreter to Logic Engine by Defunctionalization – Dariusz Biernacki, Olivier Danvy - 2004
65 A functional correspondence between evaluators and abstract machines – Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard - 2003
34 A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines – Mads Sig Ager, Olivier Danvy, Jan Midtgaard - 2004
70 Defunctionalization at Work – Olivier Danvy, Lasse R. Nielsen - 2001
20 Tail call elimination on the Java Virtual Machine – Michel Schinz, Martin Odersky - 2001
43 Modeling an algebraic stepper – John Clements, Matthew Flatt, Matthias Felleisen - 2001