|
97
|
C.P.: Continuations: A mathematical semantics for handling full jumps
– C Strachey, Wadsworth
- 1974
|
|
8
|
Typed Exceptions and Continuations Cannot Macro-Express Each Other
– Jon G. Riecke, Hayo Thielecke
- 1999
|
|
150
|
Reasoning about Programs in Continuation-Passing Style
– Amr Sabry Sabry, Matthias Felleisen
|
|
206
|
A Formulae-as-Types Notion of Control
– Timothy G. Griffin
- 1990
|
|
36
|
Logic continuations
– C T Haynes
- 1987
|
|
11
|
Using a Continuation Twice and Its Implications for the Expressive Power of Call/cc
– Hayo Thielecke
- 1998
|
|
8
|
Linearly Used Continuations
– Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hayo Thielecke, Peter W. O’hearn
- 2001
|
|
12
|
Assessing the Overhead of ML Exceptions by Selective CPS . . .
– Olivier Danvy, Jung-taek Kim, O. Danvy, Jung-taek Kim, Kwangkeun Yi, Kwangkeun Yi
- 1998
|
|
30
|
A generalization of jumps and labels
– Peter J. Landin
- 1965
|
|
7
|
Comparing Control Constructs by Typing Double-barrelled CPS Transforms
– Hayo Thielecke
- 2001
|
|
9
|
Reflections on Landin’s J operator: a partly historical note
– Matthias Felleisen
- 1987
|
|
12
|
An Introduction to Landin's "A Generalization of Jumps and Labels "
– Hayo Thielecke
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
15
|
Comparing Control Constructs by Double-barrelled CPS
– Hayo Thielecke
- 2002
|
|
58
|
Full Abstraction for Functional Languages with Control
– James Laird
- 1997
|
|
116
|
On the Expressive Power of Programming Languages
– Matthias Felleisen
- 1990
|
|
105
|
A Syntactic Theory of Sequential Control
– M Felleisen, D P Friedman, E E Kohlbecker, B F Duba
- 1987
|
