A Generalization of Exceptions and Control in ML-like Languages (1995)

by Carl A. Gunter , Didier Rémy , Jon G. Riecke
Venue:IN PROC. FPCA
Citations:61 - 0 self

Documents Related by Co-Citation

150 The theory and practice of first-class prompts – M Felleisen - 1988
130 Representing Monads – Andrzej Filinski - 1994
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
30 A Dynamic Extent Control Operator for Partial Continuations – Christian Queinnec, Bernard Serpette, Ecole Polytechnique - 1991
32 Reasoning with Continuations II: Full Abstraction for Models of Control – Dorai Sitaram, Matthias Felleisen - 1990
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
66 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
19 Partial Continuations as the Difference of Continuations, A Duumvirate of Control Operators – Luc Moreau, Christian Queinnec - 1994
24 Shift to control – Chung chieh Shan - 2004
16 How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible – O Kiselyov - 2005
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
14 Final Shift for Call/cc: Direct Implementation of Shift and Reset – Martin Gasbichler, Michael Sperber - 2002