Partial Continuations as the Difference of Continuations, A Duumvirate of Control Operators (1994)

by Luc Moreau , Christian Queinnec
Venue:International Conference on Programming Language Implementation and Logic Programming (PLILP'94). Proceedings
Citations:19 - 2 self

Documents Related by Co-Citation

58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
148 The theory and practice of first-class prompts – M Felleisen - 1988
130 Representing Monads – Andrzej Filinski - 1994
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
32 Reasoning with Continuations II: Full Abstraction for Models of Control – Dorai Sitaram, Matthias Felleisen - 1990
30 A Dynamic Extent Control Operator for Partial Continuations – Christian Queinnec, Bernard Serpette, Ecole Polytechnique - 1991
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
48 Dybvig. Continuations and concurrency – R Hieb, R Kent - 1990
257 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
34 Monads and Composable Continuations – Philip Wadler - 1993
111 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
49 Controlling Effects – Andrzej Filinski - 1996
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
65 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
733 Notions of Computation and Monads – Eugenio Moggi - 1991
133 On the Expressive Power of Programming Languages – Matthias Felleisen - 1990