|
27
|
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
– V Balat, R Di Cosmo, M P Fiore
|
|
195
|
Type-directed partial evaluation
– Olivier Danvy
- 1996
|
|
38
|
The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages
– Matthias Felleisen
- 1987
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
18
|
Combinators for program generation
– Peter Thiemann
- 1999
|
|
19
|
From Interpreter to Logic Engine by Defunctionalization
– Dariusz Biernacki, Olivier Danvy
- 2004
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
40
|
Recycling Continuations
– Jonathan Sobel, Daniel P. Friedman
- 1998
|
|
19
|
A type-theoretic foundation of continuations and prompts
– Zena M Ariola, Hugo Herbelin, Amr Sabry
- 2004
|
|
29
|
Modeling Web Interactions
– Paul Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen
- 2003
|
|
13
|
An Operational Foundation for Delimited Continuations
– Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
- 2003
|
|
17
|
Handling Control
– Dorai Sitaram
- 1993
|
|
8
|
An Implementation of Transparent Migration on Standard Scheme
– Eijiro Sumii
- 2000
|
|
69
|
Representing control: a study of the CPS transformation
– Olivier Danvy, Andrzej Filinski
- 1992
|
|
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
|
|
6
|
Une étude des sommes fortes : isomorphismes et formes normales
– V Balat
- 2002
|
