A Sound and Complete Axiomatization of Delimited Continuations

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

Volumn 8, Issue , 2003, Pages 177-188

  Kameyama, Yukiyoshi ^a,c   Hasegawa, Masahito ^b,c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Axiomatization; Continuation; CPS translation

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS; THEOREM PROVING;

AXIOMATIZATION; CONTINUATION; CPS-TRANSLATION;

COMPUTER SCIENCE;

EID: 1142299742     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944722     Document Type: Conference Paper

References (32)

1. 5 Report on the Algorithmic Language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998.
2. K. Asai. Online Partial Evaluation for Shift and Reset. In Proc. ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 19-30, 2002.
3. G. Barthe, J. Hatcliff, and M. H. Sørensen. Reflections on Reflections. In Proc. Ninth International Symposium on Programming Language Implementation and Logic Programming, pages 241-258, 1997.
4. J. Berdine, P. O'Hearn, U. Reddy, and H. Thielecke. Linear Continuation Passing. Higher-Order and Symbolic Computation, pages 181-208, 2002.
5. O. Danvy. Formalizing Implementation Strategies for First-Class Continuations. In Proc. 9th European Symposium on Computing, Lecture Notes in Computer Science 1782, pages 151-160, 1990.
6. O. Danvy and A. Filinski. Abstracting Control. In Proc. 1990 ACM Conference on Lisp and Functional Programming, pages 151-160, 1990.
7. O. Danvy and A. Filinski. Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
8. O. Danvy and L. R. Nielsen. A First-Order One-Pass CPS Transformation. In Proc. FOSSACS 2002, Lecture Notes in Computer Science 2303, pages 98-113, 2002.
9. M. Felleisen. The Theory and Practice of First-Class Prompts. In Proc. 15th Symposium on Principles of Programming Languages, pages 180-190, 1988.
10. M. Felleisen and R. Hieb. The Revised Report on the Syntactic Theories of Sequential Control and State. Theoretical Computer Science, 103:235-271, 1992.
11. A. Filinski. Representing Monads. In Proc. 21st Symposium on Principles of Programming Languages, pages 446-457, 1994.
12. C. Führmann and H. Thielecke. On the Call-by-Value CPS Transform and its Semantics. Information and Computation, to appear.
13. M. Gasbichler and M. Sperber. Final shift for call/cc: Direct Implementation of Shift and Reset. In Proc. 7th International Conference on Functional Programming, pages 271-282, 2002.
14. C. A. Gunter, D. Remy, and J. G. Riecke. A Generalization of Exceptions and Control in ML-Like Languages. In Proc. Functional Programming and Computer Architecture, pages 12-23, 1995.
15. M. Hasegawa. Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus. In Proc. International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science 2441, pages 167-182, 2002.
16. M. Hasegawa. On the Semantics of Delimited Continuations. manuscript, 2003.
17. R. Hieb, R. Dybvig, and C. W. Anderson. Subcontinuations. Lisp and Symbolic Computation, 6:453-484, 1993.
18. M. Hofmann. Sound and Complete Axiomatisations of Call-by-Value Control Operators. Mathematical Structures in Computer Science, 5:461-482, 1995.
19. Y. Kameyama. A Type-Theoretic Study on Partial Continuations. In Proc. IFIP International Conference on Theoretical Computer Science, Lecture Notes in Computer Science 1872, pages 489-504, 2000.
20. E. Moggi. Computational Lambda-Calculus and Monads. In Proc. 4th Symposium on Logic in Computer Science, pages 14-28, 1989.
21. C. Murthy. Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work. In Proc. ACM Workshop on Continuation, pages 49-71, 1992.
22. G. D. Plotkin. Call-by-Name, Call-by-Value, and the λ-Calculus. Theoretical Computer Science, 1:125-159, 1975.
23. C. Queinnec and B. Serpette. A Dynamic Extent Control Operator for Partial Continuations. In Proc. 18th Symposium on Principles of Programming Languages, pages 174-184, 1991.
24. A. Sabry. Note on Axiomatizing the Semantics of Control Operators. Technical Report CIS-TR-96-03, Dept. of Information Science, Univ. of Oregon, 1996.
25. A. Sabry and M. Felleisen. Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic Computation, 6(3-4):289-360, 1993.
26. A. Sabry and P. Wadler. A Reflection on Call-by-Value. ACM Transactions on Programming Languages and Systems, 19(6):916-941, 1997.
27. T. Sekiguchi, T. Sakamoto, and A. Yonezawa. Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling. In Advances in Exception Handling Techniques, Lecture Notes in Computer Science 2022, pages 217-233, 2001.
28. G. L. Steele Jr. RABBIT: A Compiler for SCHEME. Technical Report AITR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1978.
29. C. Strachey and C. P. Wadsworth. Continuations: A Mathematical Semantics for Handling Full Jumps. Higher-Order and Symbolic Computation, 13(1/2):135-152, 2000.
30. E. Sumii. An Implementation of Transparent Migration on Standard Scheme. In Proc. Workshop on Scheme and Functional Programming, pages 61-63, 2000.
31. H. Thielecke. From Control Effects to Typed Continuation Passing. In Proc. 30th Symposium on Principles of Programming Languages, pages 139-149, 2003.
32. P. Thiemann. Cogen in Six Lines. In Proc. International Conference on Functional Programming, pages 180-189, 1996.