|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
|
23
|
Delimited Dynamic Binding
– Oleg Kiselyov, Chung-chieh Shan , Amr Sabry
- 2006
|
|
27
|
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
– V Balat, R Di Cosmo, M P Fiore
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
17
|
Handling Control
– Dorai Sitaram
- 1993
|
|
19
|
A type-theoretic foundation of continuations and prompts
– Zena M Ariola, Hugo Herbelin, Amr Sabry
- 2004
|
|
8
|
An Implementation of Transparent Migration on Standard Scheme
– Eijiro Sumii
- 2000
|
|
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
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
22
|
Constraining control
– Daniel P Friedman, Christopher T Haynes
- 1985
|
|
29
|
Modeling Web Interactions
– Paul Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen
- 2003
|
|
14
|
Memoization in type-directed partial evaluation
– Vincent Balat, Olivier Danvy
- 2002
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
38
|
The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages
– Matthias Felleisen
- 1987
|
|
19
|
From Interpreter to Logic Engine by Defunctionalization
– Dariusz Biernacki, Olivier Danvy
- 2004
|
|
18
|
Combinators for program generation
– Peter Thiemann
- 1999
|
