|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
57
|
Abstract continuations: A mathematical semantics for handling full functional jumps
– Matthias Felleisen, Mitchell Wand, Daniel P Friedman, Bruce F Duba
|
|
40
|
Recycling Continuations
– Jonathan Sobel, Daniel P. Friedman
- 1998
|
|
49
|
Danvy and Andrzej Filinski. Abstracting control
– Olivier
- 1990
|
|
30
|
A Dynamic Extent Control Operator for Partial Continuations
– Christian Queinnec, Bernard Serpette, Ecole Polytechnique
- 1991
|
|
29
|
Reasoning with Continuations II: Full Abstraction for Models of Control
– Dorai Sitaram, Matthias Felleisen
- 1990
|
|
69
|
Representing control: a study of the CPS transformation
– Olivier Danvy, Andrzej Filinski
- 1992
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
88
|
Typing First-Class Continuations in ML
– Robert Harper, Bruce F. Duba, David Macqueen
- 1992
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
237
|
The Revised Report on the Syntactic Theories of Sequential Control and State
– Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb
- 1992
|
|
37
|
Control delimiters and their hierarchies
– Dorai Sitaram, Matthias Felleisen
- 1990
|
|
19
|
Partial Continuations as the Difference of Continuations, A Duumvirate of Control Operators
– Luc Moreau, Christian Queinnec
- 1994
|
|
14
|
How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible
– Oleg Kiselyov
- 2005
|
|
20
|
Shift to control
– Chung-chieh Shan
- 2004
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
12
|
Final Shift for Call/cc: Direct Implementation of Shift and Reset
– Martin Gasbichler, Michael Sperber
- 2002
|
