The Tail-Recursive SECD Machine (1999)

Cached

Download Links

by John D. Ramsdell
Venue:Journal of Automated Reasoning
Citations:5 - 0 self

Documents Related by Co-Citation

333 The mechanical evaluation of expressions – P J Landin - 1964
60 Proper Tail Recursion and Space Efficiency – William D. Clinger - 1998
13 The art of the interpreter or, the modularity complex (parts zero, one – G J Sussman
17 Essentials of Programming Languages, second edition – D P Friedman, M Wand, C T Haynes - 2001
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
130 Representing Monads – Andrzej Filinski - 1994
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
93 Rabbit: A compiler for Scheme – Guy L Steele Jr - 1978
70 Defunctionalization at Work – Olivier Danvy, Lasse R. Nielsen - 2001
156 Fundamental concepts in programming languages – C Strachey - 1967
72 Control operators, the SECDmachine, and the λ-calculus – Matthias Felleisen, Daniel P Friedman - 1986
90 Stack Inspection: Theory and Variants – Cédric Fournet, Andrew D. Gordon - 2001
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
8 Portable and high-level access to the stack with Continuation Marks – J Clements - 2005
27 A rational deconstruction of Landin’s SECD machine – Olivier Danvy, Kevin Millikin - 2004
54 Continuation-Based Program Transformation Strategies – M Wand - 1980