240

A FormulaeasTypes Notion of Control
– Timothy G. Griffin
 1990

300

Definitional interpreters for higherorder programming languages
– John C. Reynolds
 1972

110

Continuations: A Mathematical Semantics for Handling Full Jumps
– Christopher Strachey
 1974

201

Callbyname, callbyvalue and the λcalculus
– G Plotkin, D
 1975

13

An Introduction to Landin's "A Generalization of Jumps and Labels "
– Hayo Thielecke

93

Typing FirstClass Continuations in ML
– Robert Harper, Bruce F. Duba, David Macqueen
 1992

110

The Discoveries of Continuations
– John C. Reynolds
 1993

61

A Generalization of Exceptions and Control in MLlike Languages
– Carl A. Gunter, Didier Rémy, Jon G. Riecke
 1995

730

Notions of Computation and Monads
– Eugenio Moggi
 1991

333

The mechanical evaluation of expressions
– P J Landin
 1964

70

Categorical Structure of Continuation Passing Style
– Hayo Thielecke, Alan Paxton, Andy Pitts, Jon Riecke, David N. Turner, Phil Wadler
 1997

65

Extracting constructive content from classical proofs
– C R Murthy
 1990

605

The Definition of Standard ML (Revised
– Robin Milner, Mads Tofte, Robert Harper, David Macqueen
 1997

126

A correspondence between ALGOL 60 and Church’s lambda notation
– P J Landin
 1965

68

Continuation Semantics in Typed LambdaCalculi
– Albert R. Meyer, Mitchell Wand
 1985

74

Scheme: An interpreter for extended lambda calculus
– Gerald Jay Sussman, Guy L Steele Jr.
 1975

31

A scheme for a higherlevel semantic algebra
– William Clinger, Daniel P Friedman, Mitchell Wand
 1985

150

The theory and practice of firstclass prompts
– M Felleisen
 1988

32

Reasoning with Continuations II: Full Abstraction for Models of Control
– Dorai Sitaram, Matthias Felleisen
 1990
