The Discoveries of Continuations (1993)

by John C. Reynolds
Citations:110 - 2 self

Documents Related by Co-Citation

199 Call-by-name, call-by-value and the λ-calculus – G Plotkin - 1975
111 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
299 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
733 Notions of Computation and Monads – Eugenio Moggi - 1991
330 The mechanical evaluation of expressions – P J Landin - 1964
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
234 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
440 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
321 λµ-calculus: an algorithmic interpretation of classic natural deduction – M Parigot - 1992
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
75 Scheme: An interpreter for extended lambda calculus – Gerald Jay Sussman, Guy L Steele Jr. - 1975
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
148 The theory and practice of first-class prompts – M Felleisen - 1988
31 A generalization of jumps and labels – Peter J. Landin - 1965
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
31 A scheme for a higher-level semantic algebra – William Clinger, Daniel P Friedman, Mitchell Wand - 1985