The Discoveries of Continuations (1993)

Cached

Download Links

by John C. Reynolds , A. Van Wijngaarden , A. W. Mazurkiewicz , F. L. Morris , C. P. Wadsworth , J. H. Morris , M. J. Fischer , S. K. Abdali
Citations:101 - 2 self

Documents Related by Co-Citation

97 C.P.: Continuations: A mathematical semantics for handling full jumps – C Strachey, Wadsworth - 1974
263 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
174 Call-by-name, call-by-value and the λ-calculus – G Plotkin - 1976
299 The mechanical evaluation of expressions – P Landin - 1964
652 Notions of Computation and Monads – Eugenio Moggi - 1991
79 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
206 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
88 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
150 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
401 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
30 A generalization of jumps and labels – Peter J. Landin - 1965
219 Call-by-name, call-by-value, and the -calculus – G D Plotkin - 1975
31 A scheme for a higher-level semantic algebra – William Clinger, Daniel P Friedman, Mitchell Wand - 1985
270 Λµ-calculus: an algorithmic interpretation of classical natural deduction – M Parigot - 1992
83 Control operators, the SECD machine and the -calculus – M Felleisen, D P Friedman - 1986
37 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
122 The theory and practice of first-class prompts – M Felleisen - 1988
61 Extracting Constructive Content from Classical Proofs – C Murthy - 1990
64 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985