Reasoning with Continuations II: Full Abstraction for Models of Control (1990)

by Dorai Sitaram , Matthias Felleisen
Venue:In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming
Citations:32 - 4 self

Documents Related by Co-Citation

150 The theory and practice of first-class prompts – M Felleisen - 1988
130 Representing Monads – Andrzej Filinski - 1994
730 Notions of Computation and Monads – Eugenio Moggi - 1991
116 A syntactic theory of sequential control – M Felleisen, D P Friedman, E Kohlbecker, B Duba - 1987
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
30 A Dynamic Extent Control Operator for Partial Continuations – Christian Queinnec, Bernard Serpette, Ecole Polytechnique - 1991
19 Partial Continuations as the Difference of Continuations, A Duumvirate of Control Operators – Luc Moreau, Christian Queinnec - 1994
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
48 Dybvig. Continuations and concurrency – R Hieb, R Kent - 1990
395 LCF considered as a programming language – G Plotkin - 1977
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
625 Compiling With Continuations – A W Appel - 1992