|
20
|
Shift to control
– Chung-chieh Shan
- 2004
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
19
|
A Sound and Complete Axiomatization of Delimited Continuations
– Yukiyoshi Kameyama, Masahito Hasegawa
- 2003
|
|
14
|
How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible
– Oleg Kiselyov
- 2005
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
59
|
Defunctionalization at Work
– Olivier Danvy, Lasse R. Nielsen
- 2001
|
|
17
|
An operational foundation for delimited continuations in the CPS hierarchy
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
70
|
D.P.: Control operators, the SECD machine and the λcalculus
– M Felleisen, Friedman
- 1986
|
|
5
|
un Exemple de Patrick Greussay
– Sur
- 2004
|
|
23
|
Delimited Dynamic Binding
– Oleg Kiselyov, Chung-chieh Shan , Amr Sabry
- 2006
|
|
13
|
A Simple Proof of a Folklore Theorem about Delimited Control
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
37
|
Control delimiters and their hierarchies
– Dorai Sitaram, Matthias Felleisen
- 1990
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
