A type-theoretic foundation of continuations and prompts

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2004, Pages 40-53

  Ariola, Zena M ^a   Herbelin, Hugo ^b   Sabry, Amr ^c  

^a UNIVERSITY OF OREGON   (United States)

^b INRIA   (France)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Callcc; Continuation; Monad; Prompt; Reset; Shift; Subcontinuation; Subtraction

Indexed keywords

CALLCC; CONTINUTATION; MONAD; PROMPT; RESET; SHIFT; SUBCONTINUATION; SUBTRATION;

CALCULATIONS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; THEOREM PROVING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 13344280976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. Z. M. Ariola and H. Herbelin. Minimal classical logic and control operators. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of LNCS, pages 128-136, Eindhoven, The Netherlands, June 30 - July 4, 2003. SpringerVerlag,
2. T. Crolard. Subtractive logic. Theor. Comput. Sci., 254(12):151-185, 2001.
3. T. Crolard. A formulae-as-types interpretation of subtractive logic. Journal of Logic and Computation (Special issue on Modalities in Constructive Logics and Type Theories), 2004, To appear.
4. P.-L. Curien and H. Herbelin. The duality of computation. In Proceedings of the 5th International Conference on Functional Programming, pages 233-243, 2000.
5. O. Danvy and A. Filinski. A functional abstraction of typed contexts. Technical Report 89/12, DIKU, University of Copenhagen, Copenhagen, Denmark, 1989.
6. O. Danvy and A. Filinski. Abstracting control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, pages 151-160, New York, NY, 1990. ACM.
7. R. K. Dybvig, S. Peyton-Jones, E. Moggi, A. Sabry, and O. Waddell. Monadic functional subcontinuations. Unpublished manuscript, 2004.
8. M. Felleisen. The theory and practice of first-class prompts. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL '88), pages 180-190, Jan 1988.
9. M. Felleisen. On the expressive power of programming languages. In N. Jones, editor, ESOP '90 3rd European Symposium on Programming, Copenhagen, Denmark, volume 432, pages 134-151. Springer-Verlag, New York, N.Y., 1990.
10. M. Felleisen, D. Friedman, and E. Kohlbecker. A syntactic theory of sequential control. Theoretical Computer Science, 52(3):205-237, 1987.
11. M. Felleisen, M. Wand, D. P. Friedman, and B. F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Conference on USP and Functional Programming, Snowbird, Utah, pages 52-62. ACM, 1988.
12. A. Filinski. Representing monads. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL'94), Portland, OR, USA, 17-21 Jan. 1994, pages 446-457, New York, 1994. ACM Press.
13. A. Filinski. Representing layered monads. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL'99), San Antonio, Texas, pages 175-188. ACM Press, 1999.
14. S. E. Ganz, D. P. Friedman, and M. Wand. Trampolined style. In Proceedings of the 4th ACM SIGPLAN international conference on Functional programming, pages 18-27. ACM Press, 1999.
15. T. G. Griffin. The formulae-as-types notion of control. In Proceedings of the 17th Annual ACM Symp. on Principles of Programming Languages, POPL'90, S an Francisco, CA, USA, 17-19 Jan 1990, pages 47-57, New York, 1990. ACM Press.
16. C. A. Gunter, D. Rémy, and J. G. Riecke. A generalization of exceptions and control in ML-like languages. In Functional Programming & Computer Architecture, New York, 1995. ACM Press.
17. J. Guzmán and A. Suárez. An extended type system for exceptions. In Record of the 5th ACM SIGPLAN workshop on ML and its Applications, June 1994. Also appears as Research Report 2265, INRIA, BP 105 - 78153 Le Chesnay Cedex, France.
18. C. T. Haynes. Logic continuations. In Proceedings of the 3th International Conference on Logic Programming, volume 225 of LNCS, pages 671-685, Berlin, July 1986. Springer-Verlag.
19. C. T. Haynes, D. Friedman, and M. Wand. Obtaining coroutines from continuations. Journal of Computer Languages, 11:143-153, 1986.
20. R. Hieb, K. Dybvig, and C. W. Anderson, III. Subcontinuations. Lisp and Symbolic Computation, 7(1):83-110, 1994.
21. R. Hieb and R. K. Dybvig. Continuations and Concurrency. In PPoPP '90, Symposium on Principles and Practice of Parallel Programming, volume 25(3) of SIGPLAN NOTICES, pages 128-136, Seattle, Washington, March 14-16, 1990. ACM Press.
22. W. Howard. The formulae-as-types notion of construction. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry; Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, 1980.
23. Y. Kameyama. A type-theoretic study on partial continuations. In IFIP TCS, pages 489-504, 2000.
24. Y. Kameyama. Towards logical understanding of delimited continuations. In Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01), 2001.
25. Y. Kameyama and M. Hasegawa. A sound and complete axiomatization of delimited continuations. In Proc. of 8th ACM SIGPIAN Int. Conf. on Functional Programming, ICFP'03, Uppsala, Sweden, 25-29 Aug. 2003, volume 38(9) of SIGPLAN Notices, pages 177-188. ACM Press, New York, 2003.
26. M. Lillibridge. Unchecked exceptions can be strictly more powerful than call/cc. Higher-Order and Symbolic Computation, 12(1):75-104, Apr. 1999.
27. E. Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in computer science, pages 14-23. IEEE Press, 1989.
28. L. Moreau. A syntactic theory of dynamic binding, Higher Order Symbol. Comput., 11(3):233-279, 1998.
29. L. Moreau and C. Queinnec. Partial Continuations as the Difference of Continuations. A Duumvirate of Control Operators. In International Conference on Programming Language Implementation and Logic Programming (PULP'94), number 844 in LNCS pages 182-197, Madrid, Spain, Sept. 1994. Springer-Verlag.
30. C. Murthy. Control operators, hierarchies, and pseudoclassical type systems: A-translation at work. In ACM workshop on Continuations, pages 49-71, 1992.
31. M. Parigot. Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In Proceedings of International Conference on Logic Programming and Automated Reasoning (LPAR '92), St. Petersburg, Russia, pages 190-201. Springer-Verlag, 1992.
32. C. Rauszer. Semi-boolean algebras and their application to intuitionistic logic with dual connectives. Fundamenta Mathematicae, 83:219-249, 1974.
33. J. G. Riecke and H. Thielecke. Typed exceptions and continuations cannot macro-express each other. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of LNCS, pages 635-644, Berlin, 1999. Springer-Verlag.
34. A. Sabry and M. Felleisen. Reasoning about programs in continuation-passing style. Lisp Symb. Comput., 6(3-4):289-360, 1993.
35. D. Sitaram and M. Felleisen. Control delimiters and their hierarchies. Lisp and Symbolic Computation, 3(1):67-99, 1990.
36. The SML/NJ library. Available from http://smlnj.org/.
37. H. Thielecke. On exceptions versus continuations in the presence of state. In Proceedings of the 9th European Symposium On Programming (ESOP), volume 1782 of LNCS, pages 397-411, Berlin, 2000. Springer-Verlag.
38. H. Thielecke. Contrasting exceptions and continuations. Version available from http://www.cs.bham.ac.uk/~hxt/research/exncontjournal.pdf, 2001.
39. H. Thielecke. Comparing control constructs by double-barrelled CPS. Higher-order and Symbolic Computation, 15(2/3):119-136, 2002.
40. P. Wadler. Monads and composable continuations. Lisp and Symbolic Computation, 7(1):39-56, Jan. 1994.
41. M. Wand. Continuation-based multiprocessing revisited. Higher-Order and Symbolic Computation, 12(3):285-299, Oct. 1999. Reprinted from the proceedings of the 1990 Lisp Conference, with a foreword.