|
13
|
An Operational Foundation for Delimited Continuations
– Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
- 2003
|
|
17
|
On the Dynamic Extent of Delimited Continuations
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
23
|
A rational deconstruction of Landin’s SECD machine
– Olivier Danvy, Kevin Millikin
- 2004
|
|
17
|
A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
– Małgorzata Biernacka, Olivier Danvy
- 2005
|
|
3
|
A Rational Deconstruction of Landin’s J Operator
– Olivier Danvy, Kevin Millikin
- 2006
|
|
34
|
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
– Mads Sig Ager, Olivier Danvy, Jan Midtgaard
- 2005
|
|
9
|
Refunctionalization at Work
– Olivier Danvy, Kevin Millikin
- 2008
|
|
|
Décrire Et Comparer Les Implantations De Langages Fonctionnels
– Rémi Douence, Pascal Fradet
- 1996
|
|
7
|
A Systematic Study of Functional Language Implementations
– Rémi Douence, Pascal Fradet
- 1998
|
|
10
|
A Taxonomy of Functional Language Implementations Part II: Call-by-Name, Call-by-Need and Graph Reduction
– Rémi Douence , Pascal Fradet
- 1996
|
|
23
|
From Interpreter to Compiler and Virtual Machine: a Functional Derivation
– Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
- 2003
|
|
4
|
A study of syntactic and semantic artifacts and its application to lambda definability, strong normalization, and weak normalization in the presence of state
– Johan Munk
- 2008
|
|
|
On Inter-deriving Small-step and Big-step Semantics: A Case Study for Storeless Call-by-need Evaluation
– Olivier Danvy A, Kevin Millikin B, Johan Munk C, Ian Zerny A
|
|
|
Towards Compatible and Interderivable . . . Part I: Denotational Semantics, Natural Semantics, and Abstract Machines
– Olivier Danvy
- 2008
|
|
1
|
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines
– Olivier Danvy
- 2008
|
|
20
|
Functional Back-Ends within the Lambda-Sigma Calculus
– Thérèse Hardin, Luc Maranget, Bruno Pagano
- 1996
|
|
|
The Call-by-need Lambda Calculus, Revisited
– Stephen Chang, Matthias Felleisen
|
|
8
|
Syntactic Theories in Practice
– Olivier Danvy, Lasse R. Nielsen
- 2002
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|