A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (2005)

Cached

Download Links

by Mads Sig Ager , Olivier Danvy , Jan Midtgaard
Venue:Theoretical Computer Science
Citations:38 - 20 self

Documents Related by Co-Citation

66 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
27 A rational deconstruction of Landin’s SECD machine – Olivier Danvy, Kevin Millikin - 2004
299 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
73 Control Operators, the SECD machine, and the λ-calculus – M Felleisen, D P Friedman - 1986
199 Call-by-name, call-by-value and the λ-calculus – G Plotkin - 1975
19 From Interpreter to Logic Engine by Defunctionalization – Dariusz Biernacki, Olivier Danvy - 2004
39 The Calculi of λv-CS conversion: a syntactic theory of control and state in imperative higher order programming – M Felleisen - 1987
18 An operational foundation for delimited continuations in the CPS hierarchy – Dariusz Biernacki, Olivier Danvy - 2005
330 The mechanical evaluation of expressions – P J Landin - 1964
93 Rabbit: A compiler for Scheme – G L Steele Jr - 1978
23 Functional runtime systems within the lambda–sigma calculus – T Hardin, L Maranget, B Pagano - 1998
24 Programming languages and lambda calculi. Unpublished lecture notes – M Felleisen, M Flatt
20 A concrete framework for environment machines – Małgorzata Biernacka, Olivier Danvy - 2005
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
59 From operational semantics to abstract machines – John Hannan, Dale Miller - 1992
21 On Evaluation Contexts, Continuations, and the Rest of Computation – Olivier Danvy