On Exceptions versus Continuations in the Presence of State (2000)

Cached

Download Links

by Hayo Thielecke
Venue:Programming Languages and Systems, 9th European Symposium on Programming, ESOP 2000,, number 1782 in LNCS
Citations:14 - 3 self

Documents Related by Co-Citation

110 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
8 Typed Exceptions and Continuations Cannot Macro-Express Each Other – Jon G. Riecke, Hayo Thielecke - 1999
240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
130 Representing Monads – Andrzej Filinski - 1994
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
36 Logic Continuations – C T Haynes - 1986
35 Monads and Composable Continuations – Philip Wadler - 1993
11 Using a Continuation Twice and Its Implications for the Expressive Power of Call/cc – Hayo Thielecke - 1998
8 Linearly Used Continuations – Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, Hayo Thielecke, Peter W. O’hearn - 2001
12 Assessing the Overhead of ML Exceptions by Selective CPS . . . – Olivier Danvy, Jung-taek Kim, O. Danvy, Jung-taek Kim, Kwangkeun Yi, Kwangkeun Yi - 1998
7 Comparing Control Constructs by Typing Double-barrelled CPS Transforms – Hayo Thielecke - 2001
9 Reflections on Landin’s J operator: a partly historical note – Matthias Felleisen - 1987
13 An Introduction to Landin's "A Generalization of Jumps and Labels " – Hayo Thielecke
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
33 A generalization of jumps and labels – Peter J. Landin - 1965
17 Comparing Control Constructs by Double-barrelled CPS – Hayo Thielecke - 2002
132 On the Expressive Power of Programming Languages – Matthias Felleisen - 1990
328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992