On exceptions versus continuations in the presence of state

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 397-411

  Thielecke, Hayo ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CALLING CONTEXTS; EXPRESSIVE POWER; FUNCTION CALLS; LOCAL STATE; OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 84947222716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_26     Document Type: Conference Paper

References (15)

1. Andrew Appel, David MacQueen, Robin Milner, and Mads Tofte. Unifying exceptions with constructors in Standard ML. Technical Report ECS LFCS 88 55, Laboratory for Foundations of Computer Science, University of Edinburgh, June 1988.
2. Carl Bruggeman, Oscar Waddell, and R. Kent Dybvig. Representing control in the presence of one-shot continuations. ACM SIGPLAN Notices, 31(5):99-107, May 1996.
3. Matthias Felleisen. On the expressive power of programming languages. In Science of Computer Programming, volume 17, pages 35-75, 1991.
4. Andrzej Filinski. Linear continuations. In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, 1992.
5. Carl A. Gunter, Didier Rémy, and Jon G. Riecke. A generalization of exceptions and control in ML-like languages. In Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture (FPCA'95), pages 12-23, La Jolla, California, June 25-28, 1995. ACM SIGPLAN/SIGARCH and IFIP WG2.8, ACM Press.
6. Peter J. Landin. A generalization of jumps and labels. Report, UNIVAC Systems Programming Research, August 1965.
7. Peter J. Landin. A generalization of jumps and labels. Higher-Order and Symbolic Computation, 11(2), 1998. Reprint of [6].
8. Mark Lillibridge. Exceptions are strictly more powerful than Call/CC. Technical Report CMU-CS-95-178, Carnegie Mellon University, July 1995.
9. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
10. John C. Reynolds. Theories of Programming Languages. Cambridge University Press, 1998.
11. Jon G. Riecke and Hayo Thielecke. Typed exceptions and continuations cannot macro-express each other. In Jîrí Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, Procedings ICALP '99, volume 1644 of LNCS, pages 635-644. Springer Verlag, 1999.
12. Dorai Sitaram and Matthias Felleisen. Reasoning with continuations II: full abstraction for models of control. In M. Wand, editor, Lisp and Functional Programming. ACM, 1990.
13. Guy L. Steele. Common Lisp: the Language. Digital Press, 1990.
14. Guy L. Steele and Richard P. Gabriel. The evolution of Lisp. In Richard L.Wexel- blat, editor, Proceedings of the Conference on History of Programming Languages, volume 28(3) of ACM Sigplan Notices, pages 231-270, New York, NY, USA, April 1993. ACM Press.
15. Mitchell Wand and Dino P. Oliva. Proving the correctness of storage representations. In 1992 ACM Conferenc on Lisp and Functional Programming, pages 151-160. ACM, ACM, August 1992.