|
13
|
The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms
– Amr A. Sabry
- 1994
|
|
13
|
On the Transformation between Direct and Continuation Semantics
– Olivier Danvy, John Hatcliff
- 1993
|
|
21
|
Thunks and the λ-calculus
– John Hatcliff, Olivier Danvy
- 1997
|
|
69
|
Representing control: a study of the CPS transformation
– Olivier Danvy, Andrzej Filinski
- 1992
|
|
|
Type Theory for Programming Languages
– Robert Harper
- 1994
|
|
20
|
Definitional interpreters revisited
– John C. Reynolds, In Late, Jean Sammet, Burt Leavenworth, Art Evans
- 1998
|
|
44
|
Back to Direct Style
– Olivier Danvy
- 1994
|
|
|
Reasoning with Continuations III: A Complete Calculus of Control
– Amr Sabry, Matthias Felleisen
- 1992
|
|
|
On the Idempotence of the CPS Transformation
– Olivier Danvy, Karoline Malmkjær
- 1996
|
|
|
Amr Sabry
– University Of Oregon, Amr Sabry, Philip Wadler
- 1997
|
|
4
|
A Computational Formalization for Partial Evaluation (Extended Version)
– John Hatcliff, Olivier Danvy
- 1996
|
|
1
|
A Parallel Functional Language With First-Class Continuations. Programming Style and Semantics
– Luc Moreau
|
|
65
|
Explicit Polymorphism and CPS Conversion
– Robert Harper , Mark Lillibridge
- 1992
|
|
9
|
Types as graphs: Continuations in type logical grammar
– Chris Barker, Chung-chieh Shan
|
|
15
|
Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis
– Geoffrey Burn, Daniel Le M'etayer
- 1992
|
|
10
|
Recursion from Iteration
– Andrzej Filinski
- 1994
|
|
1
|
Interpreting functions as π-calculus processes: a tutorial
– Davide Sangiorgi
- 1999
|
|
|
Explicit Substitutions for the λΔ-calculus
– Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos
|
|
22
|
On proving syntactic properties of CPS programs
– Belmina Dzafic, Olivier Danvy, Olivier Danvy, Belmina Dza C, Frank Pfenning, Frank Pfenning
- 1999
|
