Typed exceptions and continuations cannot macro-express each other

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

Volumn 1644 LNCS, Issue , 1999, Pages 635-644

  Riecke, Jon G ^a   Thielecke, Hayo ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTROL CONSTRUCTS; FUNCTIONAL LANGUAGES;

AUTOMATA THEORY;

EID: 84887467016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_60     Document Type: Conference Paper

References (22)

1. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland, 1981. Revised Edition, 1984.
2. O. Danvy and J. L. Lawall. Back to direct style II: First-class continuations. In Proceedings, 1992 ACM Conference on Lisp and Functional Programming, pages 299-310.ACM, 1992.
3. M. Felleisen. The theory and practice of first-class prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 180-190. ACM, 1988.
4. M. Felleisen. On the expressive power of programming languages. Science of Computer Programming, 17:35-75, 1991.
5. J. Gosling, B. Joy, and G. Steele. The Java(tm) Language Specification. Addison Wesley, 1996.
6. G. Kahn. Natural semantics. In Proceedings Symposium on Theoretical Aspects of Computer Science, volume 247 of Lect. Notes in Computer Sci., NewYork, 1987. Springer-Verlag.
7. R. Kelsey, W. Clinger, and J. Rees, editors. Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(3):7-105, 1998.
8. P. J. Landin. A generalization of jumps and labels. Report, UNIVAC Systems Programming Research, August 1965.
9. P. J. Landin.Ageneralization of jumps and labels. Higher-Order and Symbolic Computation, 11(2), 1998.
10. X. Leroy and P.Weis. Manual de reference du language Caml. InterEditions, Paris, 1998.
11. M. Lillibridge. Exceptions are strictly more powerful than call/cc. Technical Report CMSCS- 95-178, School of Computer Science, Carnegie Mellon University, 1995.
12. M. Lillibridge. Uncaught exceptions can be strictly more powerful than call/cc. Higher- Order and Symbolic Computation, 12(1):275-307, 1999.
13. A. R. Meyer and M. Wand. Continuation semantics in typed lambda-calculi (summary). In R. Parikh, editor, Proceedings of the Conference on Logics of Programs, 1985, Lecture Notes in Computer Science 193, pages 219-224. Springer-Verlag, 1985.
14. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
15. E. Moggi. Notions of computation and monads. Information and Control, 93:55-92, 1991.
16. J. H. Morris. Lambda-calculus models of programming languages. Technical ReportMACTR- 57, M.I.T. Lab. for Computer Science, 1968.
17. G. D. Plotkin. Call-by-name, call-by-value and the ffcalculus. Theoretical Computer Sci., 1:125-159, 1975.
18. Plotkin, G. D. LCF considered as a programming language. Theoretical Computer Sci., 5:223-257, 1977.
19. J. C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233-247, November 1993.
20. D. Sitaram and M. Felleisen. Reasoning with continuations II: Full abstraction for models of control. In Proceedings of the 1990 ACMConference on Lisp and Functional Programming, pages 161-175. ACM, 1990.
21. H. Thielecke. Using a continuation twice and its implications for the expressive power of call/cc. Higher-Order and Symbolic Computation, 12(1), 1999.
22. A. vanWijngaarden. Recursive definition of syntax and semantics. In T. B. Steel, Jr, editor, Formal Language Description Languages for Computer Programming, Proceedings of an IFIP Working Conference, pages 13-24, 1964.