|
270
|
Λµ-calculus: an algorithmic interpretation of classical natural deduction
– M Parigot
- 1992
|
|
206
|
A Formulae-as-Types Notion of Control
– Timothy G. Griffin
- 1990
|
|
28
|
A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract)
– C.-H. L. Ong
- 1996
|
|
126
|
Duality of computation
– Pierre-louis Curien
- 2005
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
401
|
Computational Lambda-Calculus and Monads
– Eugenio Moggi
- 1988
|
|
105
|
A Syntactic Theory of Sequential Control
– M Felleisen, D P Friedman, E E Kohlbecker, B F Duba
- 1987
|
|
87
|
A New Deconstructive Logic: Linear Logic
– Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx
- 1995
|
|
363
|
LCF considered as a programming language
– G D Plotkin
- 1977
|
|
137
|
A new constructive logic: classical logic
– Jean-Yves Girard
- 1991
|
|
150
|
Reasoning about Programs in Continuation-Passing Style
– Amr Sabry Sabry, Matthias Felleisen
|
|
14
|
A Formulae-as-Types Notion of Control
– T Grin
- 1990
|
|
116
|
On the Expressive Power of Programming Languages
– Matthias Felleisen
- 1990
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
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
|
|
28
|
Extracting constructive content from classical logic via control-like reductions
– Franco Barbanera, Stefano Berardi
- 1993
|
|
42
|
Classical Logic, Continuation Semantics and Abstract Machines
– Thomas Streicher, Fachbereich Mathematik, B. Reus
- 1998
|
