|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
122
|
The theory and practice of first-class prompts
– M Felleisen
- 1988
|
|
219
|
Call-by-name, call-by-value, and the -calculus
– G D Plotkin
- 1975
|
|
237
|
The Revised Report on the Syntactic Theories of Sequential Control and State
– Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb
- 1992
|
|
150
|
Reasoning about Programs in Continuation-Passing Style
– Amr Sabry Sabry, Matthias Felleisen
|
|
48
|
Back to Direct Style II: First-Class Continuations
– Olivier Danvy, Julia L. Lawall
- 1996
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
107
|
Continuation-passing, closure-passing style
– Trevor Jim
- 1989
|
|
190
|
ORBIT: An optimizing compiler for Scheme
– D KRANZ, R KELSEY, J REES, P HUDAK, J PHILBIN, N ADAMS
- 1986
|
|
1497
|
The Definition of Standard ML
– Robin Milner, Mads Tofte, Robert Harper
- 1990
|
|
206
|
A Formulae-as-Types Notion of Control
– Timothy G. Griffin
- 1990
|
|
105
|
A Syntactic Theory of Sequential Control
– M Felleisen, D P Friedman, E E Kohlbecker, B F Duba
- 1987
|
|
1016
|
Proof-Carrying Code
– George C. Necula
- 1997
|
|
54
|
A Generalization of Exceptions and Control in ML-like Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
- 1995
|
|
159
|
Lambda Lifting: Transforming Programs to Recursive Equations
– Thomas Johnsson
- 1985
|
|
153
|
Revised report on the algorithmic language Scheme
– W Clinger, J Rees
- 1991
|
|
137
|
Essentials of programming languages
– D P Friedman, M Wand, C T Haynes
- 1992
|
