Exceptions, continuations and macro-expressiveness

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

Volumn 2305, Issue , 2002, Pages 133-146

  Laird, James ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

COUNTER EXAMPLES; FIRST ORDER LOGIC; IMPERATIVE LANGUAGES; SOURCE LANGUAGE;

MACROS;

EID: 84957106137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_10     Document Type: Conference Paper

References (14)

1. Matthias Felleisen. On the expressive power of programming languages. In Science of Computer Programming, volume 17, pages 35–75, 1991.
2. Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, and Bruce Duba. A syntactic theory of sequential control. Theoretical Computer Science, 52:205 – 207, 1987.
3. C. Gunter, D. Remy, and J. Riecke. A generalization of exceptions and control in ML like languages. In Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pages 12–23, 1995.
4. J. Laird. Full abstraction for functional languages with control. In Proceedings of the Twelfth International Symposium on Logic In Computer Science, LICS’97. IEEE Computer Society Press, 1997.
5. J. Laird. A fully abstract game semantics of local exceptions. In Proceedings of the Sixteenth International Symposium on Logic In Computer Science, LICS’01. IEEE Computer Society Press, 2001.
6. M. Lillibridge. Unchecked exceptions can be strictly more powerful than Call/CC. Higher-Order and Symbolic Computation, 12(1):75–104, 1999.
7. J. Mitchell. On abstraction and the expressive power of programming languages. In Proc. Theor. Aspects of Computer Software, pages 290–310, 1991.
8. C.-H. L. Ong and C. Stewart. A Curry-Howard foundation for functional computation with control. In Proceedings of ACM SIGPLAN-SIGACT syposium on Principles of Programming Languages, Paris, January 1997. ACM press, 1997.
9. M. Parigot. calculus: an algorithmic interpretation of classical natural deduction. In Proc. International Conference on Logic Programming and Automated Reasoning, pages 190–201. Springer, 1992.
10. J. Reynolds. Theories of Programming Languages. Cambridge University Press, 1998.
11. Jon G. Riecke. The Logic and Expressibility of Simply-Typed Call-by-Value and Lazy Languages. PhD thesis, Massachusetts Institute of Technology, 1991. Available as technical report MIT/LCS/TR-523 (MIT Laboratory for Computer Science).
12. J. Riecke and H. Thielecke. Typed exceptions and continuations cannot macroexpress each other. In J. Wiedermann, P. van Emde Boas and M. Nielsen, editor, Proceedings of ICALP’99, volume 1644 of LNCS, pages 635 –644. Springer, 1999.
13. A. Sabry and M. Felleisen. Reasoning about programs in continuation-passing style. LISP and Symbolic Computation, 6(3/4):289–360, 1993.
14. H. Thielecke. On exceptions versus continuations in the presence of state. In Proceedings of ESOP 2000, volume 1782 of LNCS. Springer, 2000.