From control effects to typed continuation passing

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2003, Pages 139-149

  Thielecke, Hayo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Continuations; Control effects; Polymorphism; Type and effect systems

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL OPERATORS; PROGRAM ASSEMBLERS; SEMANTICS;

CONTINUATION PASSING STYLE (CPS);

COMPUTER PROGRAMMING LANGUAGES;

EID: 0038643935     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/604131.604144     Document Type: Conference Paper

References (28)

1. Amal Ahmed and David Walker. The logical approach to stack typing. ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'03), 2003.
2. Andrew Appel. Compiling with Continuations. Cambridge University Press, 1992.
3. Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Region analysis and the polymorphic lambda calculus. In Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science, pages 8-97, 1999.
4. Josh Berdine, Peter W. O'Hearn, Uday Reddy, and Hayo Thielecke. Linear continuation passing. Higher-order and Symbolic Computation, 15(2/3), 2002.
5. 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.
6. Olivier Danvy. Formalizing implementation strategies for first-class continuations. In Gert Smolka, editor, Programming Languages and Systems, 9th European Symposium on Programming, ESOP, number 1782 in LNCS, pages 88-103. Springer Verlag, 2000.
7. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, December 1992.
8. Olivier Danvy and Lasse R. Nielsen. A first-order one-pass CPS transformation. In Foundations of Software Science and Computation Structures (FoSSaCS) '02, number 2303 in LNCS. Springer, 2002.
9. Bruce Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Principles of Programming Languages (POPL'91), pages 163-173. ACM, January 1991.
10. Matthias Felleisen. The theory and practice of first-class prompts. In Principles of Programming Languages (POPL '88), pages 180-190. ACM, January 1988.
11. Carsten Führmann. Varieties of effects. In Foundations of Software Science and Computation Structures (FOSSACS) 2002, volume 2303 of LNCS, pages 144-158. Springer, 2002.
12. Timothy G. Griffin. A formulae-as-types notion of control. In Principles of Programming Languages (POPL '90), pages 47-50. ACM, 1990.
13. Robert Harper and Mark Lillibridge. Polymorphic type assignment and CPS conversion. In Olivier Danvy and Carolyn Talcott, editors, Proceedings of the ACM SIGPLAN Workshop on Continuations CW'92, pages 13-22. Department of Computer Science, Stanford University, June 1992. Published as technical report STAN-CS-92-1426.
14. Robert Harper and Mark Lillibridge. Explicit polymorphism and CPS conversion. In Principles of Programming Languages (POPL '93), pages 206-219. ACM, 1993.
15. Pierre Jouvelot and David K. Gifford. Reasoning about continuations with control effects. In Prgramming Language Design and Implementation (PLDI), pages 218-226. ACM, 1988.
16. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998.
17. John M. Lucassen and David K. Gifford. Polymorphic effect systems. In Principles of Programming Languages (POPL '88), pages 47-57. ACM, 1988.
18. Saunders Mac Lane. Categories for the Working Mathematician. Springer Verlag, 1971.
19. Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambda-calculi (summary). In Rohit Parikh, editor, Logics of Programs, number 193 in Lecture Notes in Computer Science, pages 219-224. Springer-Verlag, 1985.
20. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
21. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From system F to typed assembly language. In Principles of Programming Languages (POPL '98), pages 85-97. ACM, 1998.
22. Lasse R. Nielsen. A selective CPS transformation. In 27th Annual Conference on the Mathematical Foundations of Programming Semantics (MFPS), number 45 in ENTCS. Elsevier, 2001.
23. Andrew M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
24. John C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523, Amsterdam, 1983. Elsevier Science Publishers B. V. (North-Holland).
25. Jon G. Riecke and Hayo Thielecke. Typed exceptions and continuations cannot macro-express each other. In Proceedings 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of LNCS, pages 635-644. Springer Verlag, 1999.
26. Guy Steele. Rabbit: A compiler for Scheme. Technical Report AI TR 474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, May 1978.
27. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value lambda-calculus using a stack of regions. In Principles of Programming Languages (POPL '94), pages 88-201. ACM, 1994.
28. Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture (FPCA'89), pages 347-359. ACM, 1989.