|
652
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
88
|
Typing First-Class Continuations in ML
– Robert Harper, Bruce F. Duba, David Macqueen
- 1992
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
401
|
Computational Lambda-Calculus and Monads
– Eugenio Moggi
- 1988
|
|
1225
|
Introduction to functional programming
– Philip Wadler
- 1995
|
|
29
|
Reasoning with Continuations II: Full Abstraction for Models of Control
– Dorai Sitaram, Matthias Felleisen
- 1990
|
|
219
|
Call-by-name, call-by-value, and the -calculus
– G D Plotkin
- 1975
|
|
363
|
LCF considered as a programming language
– Gordon D Plotkin
- 1977
|
|
488
|
A Syntactic Approach to Type Soundness
– Andrew K. Wright, Matthias Felleisen
- 1992
|
|
37
|
Control delimiters and their hierarchies
– Dorai Sitaram, Matthias Felleisen
- 1990
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
30
|
A Dynamic Extent Control Operator for Partial Continuations
– Christian Queinnec, Bernard Serpette, Ecole Polytechnique
- 1991
|
|
19
|
Partial Continuations as the Difference of Continuations, A Duumvirate of Control Operators
– Luc Moreau, Christian Queinnec
- 1994
|
|
573
|
The Definition of Standard ML (Revised
– Robin Milner, Mads Tofte, Robert Harper, David MacQueen
- 1997
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
