|
52
|
A functional correspondence between evaluators and abstract machines
– Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
- 2003
|
|
32
|
A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
– Mads Sig Ager, Olivier Danvy, Jan Midtgaard
- 2004
|
|
59
|
Defunctionalization at Work
– Olivier Danvy, Lasse R. Nielsen
- 2001
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
23
|
A rational deconstruction of Landin’s SECD machine
– Olivier Danvy, Kevin Millikin
- 2004
|
|
19
|
From Interpreter to Logic Engine by Defunctionalization
– Dariusz Biernacki, Olivier Danvy
- 2004
|
|
17
|
An operational foundation for delimited continuations in the CPS hierarchy
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
70
|
D.P.: Control operators, the SECD machine and the λcalculus
– M Felleisen, Friedman
- 1986
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
91
|
RABBIT: a compiler for SCHEME
– STEELE JR, G L
- 1978
|
|
38
|
The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages
– Matthias Felleisen
- 1987
|
|
24
|
Programming languages and lambda calculi, unpublished lecture notes available at and last accessed in
– M Felleisen, M Flatt
- 2008
|
|
299
|
The mechanical evaluation of expressions
– P J Landin
- 1964
|
|
101
|
Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation
– Olivier
- 1992
|
|
22
|
Functional runtime systems within the lambda-sigma calculus
– Thérèse Hardin, Luc Maranget, Bruno Pagano
- 1998
|
|
55
|
An abstract framework for environment machines
– Pierre-Louis Curien
- 1991
|
|
12
|
A concrete framework for environment machines
– Małgorzata Biernacka, Olivier Danvy
- 2005
|
|
49
|
Danvy and Andrzej Filinski. Abstracting control
– Olivier
- 1990
|
|
20
|
On Evaluation Contexts, Continuations, and the Rest of Computation
– Olivier Danvy
|
