|
20
|
Shift to control
– Chung-chieh Shan
- 2004
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
17
|
An operational foundation for delimited continuations in the CPS hierarchy
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
14
|
How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible
– Oleg Kiselyov
- 2005
|
|
70
|
D.P.: Control operators, the SECD machine and the λcalculus
– M Felleisen, Friedman
- 1986
|
|
17
|
On the Dynamic Extent of Delimited Continuations
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
20
|
On Evaluation Contexts, Continuations, and the Rest of Computation
– Olivier Danvy
|
|
49
|
Danvy and Andrzej Filinski. Abstracting control
– Olivier
- 1990
|
|
40
|
Recycling Continuations
– Jonathan Sobel, Daniel P. Friedman
- 1998
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
91
|
RABBIT: a compiler for SCHEME
– STEELE JR, G L
- 1978
|
|
57
|
Abstract continuations: A mathematical semantics for handling full functional jumps
– Matthias Felleisen, Mitchell Wand, Daniel P Friedman, Bruce F Duba
|
|
59
|
Defunctionalization at Work
– Olivier Danvy, Lasse R. Nielsen
- 2001
|
|
31
|
A scheme for a higher-level semantic algebra
– William Clinger, Daniel P Friedman, Mitchell Wand
- 1985
|
|
13
|
A Simple Proof of a Folklore Theorem about Delimited Control
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
|
2
|
A monadic framework for subcontinuations. Available at http://www.cs.indiana.edu/~sabry/research. html
– R K Dybvig, S Peyton-Jones, A Sabry
- 2005
|
