|
60
|
Categorical Structure of Continuation Passing Style
– Hayo Thielecke, Alan Paxton, Andy Pitts, Jon Riecke, David N. Turner, Phil Wadler
- 1997
|
|
74
|
Control Categories and Duality: on the Categorical Semantics of the Lambda-Mu Calculus
– Peter Selinger, I Nger
- 1999
|
|
10
|
Recursion from Iteration
– Andrzej Filinski
- 1994
|
|
401
|
Computational Lambda-Calculus and Monads
– Eugenio Moggi
- 1988
|
|
89
|
Premonoidal Categories and Notions of Computation
– John Power, Edmund Robinson
- 1995
|
|
34
|
Declarative continuations: an investigation of duality in programming language semantics
– A Filinski
- 1989
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
17
|
Sound and Complete Axiomatisations of Call-By-Value Control Operators
– Martin Hofmann, Mart I N Hofmann
- 1994
|
|
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
|
|
30
|
A generalization of jumps and labels
– Peter J. Landin
- 1965
|
|
11
|
Using a Continuation Twice and Its Implications for the Expressive Power of Call/cc
– Hayo Thielecke
- 1998
|
|
270
|
Λµ-calculus: an algorithmic interpretation of classical natural deduction
– M Parigot
- 1992
|
|
13
|
Typing First-Class Continuations in
– B Duba, R Harper, D MacQueen
- 1993
|
|
97
|
C.P.: Continuations: A mathematical semantics for handling full jumps
– C Strachey, Wadsworth
- 1974
|
|
7
|
Direct models of the computational lambdacalculus
– C Führmann
- 1999
|
|
91
|
Lambda-Calculus Schemata
– Michael J. Fischer
- 1993
|
|
88
|
Typing First-Class Continuations in ML
– Robert Harper, Bruce F. Duba, David Macqueen
- 1992
|
