The Discoveries of Continuations (1993)

by John C. Reynolds
Citations:110 - 2 self

Documents Related by Co-Citation

730 Notions of Computation and Monads – Eugenio Moggi - 1991
110 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
333 The mechanical evaluation of expressions – P J Landin - 1964
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
150 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
328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992
298 Control-Flow Analysis of Higher-Order Languages – Olin Shivers - 1991
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
46 On the relation between direct and continuation semantics – J C Reynolds - 1974
65 Extracting constructive content from classical proofs – C R Murthy - 1990
68 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998