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:110 - 2 self

Documents Related by Co-Citation

111 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
199 Call-by-name, call-by-value and the λ-calculus – G Plotkin - 1975
299 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
733 Notions of Computation and Monads – Eugenio Moggi - 1991
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
330 The mechanical evaluation of expressions – P J Landin - 1964
440 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
148 The theory and practice of first-class prompts – M Felleisen - 1988
31 A scheme for a higher-level semantic algebra – William Clinger, Daniel P Friedman, Mitchell Wand - 1985
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
321 λµ-calculus: an algorithmic interpretation of classic natural deduction – M Parigot - 1992
473 Denotational Semantics: the Scott-Strachey Approach to Programming Languages Theory – J E Stoy - 1977
297 Control-Flow Analysis of Higher-Order Languages – Olin Shivers - 1991
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
63 Extracting constructive content from classical proofs – Chetan Murthy - 1990
46 On the relation between direct and continuation semantics – J C Reynolds - 1974