Axioms for delimited continuations in the CPS Hierarchy

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

Volumn 3210, Issue , 2004, Pages 442-457

  Kameyama, Yukiyoshi ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Axiomatization; Control operators; Cps translations; Delimited continuations; Type system

Indexed keywords

CALCULATIONS;

AXIOMATIZATION; CONTROL OPERATORS; DELIMITED CONTINUATIONS; NATURAL EXTENSION; OPERATIONAL BEHAVIOR; PARTIAL EVALUATION; SOUND AND COMPLETE; TYPE SYSTEMS;

PROGRAM TRANSLATORS;

EID: 34147165326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_34     Document Type: Article

References (25)

1. 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.
2. K. Asai. Offline Partial Evaluation for Shift and Reset. In Proc. ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, to appear.
3. M. Biernacka, D. Biernacki, and O. Danvy. An operational foundation for delimited continuations. In Proc. Fourth ACM SIGPLAN Workshop on Continuations, Technical Report CSR-04-1, School of Computer Science, University of Birmingham, pages 25-34, 2004.
4. O. Danvy. Type-directed partial evaluation. In Proc. 23rd Symposium on Principles of Programming Languages, pages 242-257, 1996.
5. O. Danvy. On evaluation contexts, continuations, and the rest of the computation. In Proc. Fourth ACM SIGPLAN Workshop on Continuations, Technical Report CSR-04-1, School of Computer Science, University of Birmingham, pages 13-23, 2004.
6. O. Danvy and A. Filinski. A functional abstraction of typed contexts. Technical Report 89/12, DIKU, University of Copenhagen, 1989.
7. O. Danvy and A. Filinski. Abstracting Control. In Proc. 1990 ACM Conference on Lisp and Functional Programming, pages 151-160, 1990.
8. O. Danvy and A. Filinski. Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
9. O. Danvy and Z. Yang. An Operational Investigation of the CPS Hierarchy. In Proc. 8th European Symposium on Programming, Lecture Notes in Computer Science 1576, pages 224-242, 1999.
10. M. Felleisen. The Theory and Practice of First-Class Prompts. In Proc. 15th Symposium on Principles of Programming Languages, pages 180-190, 1988.
11. A. Filinski. Representing Layered Monads. In Proc. 26th Symposium on Principles of Programming Languages, pages 175-188, 1999.
12. H. Friedman. Classically and intuitionistically provably recursive functions. Lecture Notes in Mathematics 699, pages 21-28, 1978.
13. T. Griffin. A Formulae-as-Types Notion of Control. In Proc. 17th Symposium on Principles of Programming Languages, pages 47-58, 1990.
14. C. A. Gunter, D. Rémy, 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. R. Hieb, R. Dybvig, and C. W. Anderson. Subcontinuations. Lisp and Symbolic Computation, 6:453-484, 1993.
16. 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.
17. Y. Kameyama. Axiomatizing higher level delimited continuations. In Proc. 3rd ACM SIGPLAN Workshop on Continuations, Technical Report 545, Computer Science Department, Indiana University, pages 49-53, 2004.
18. Y. Kameyama and M. Hasegawa. A Sound and Complete Axiomatization of Delimited Continuations. In Proc. ACM International Conference on Functional Programming, pages 177-188, 2003.
19. J. Lawall and O. Danvy. Continuation-based partial evaluation. In Proc. 1994 ACM Conference on LISP and Functional Programming, pages 227-238, 1994.
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: Atranslation at work. In Proc. First ACM Workshop on Continuations, Technical Report STAN-CS-92-1426, Stanford University, pages 49-72, 1992.
22. A. Sabry. Note on Axiomatizing the Semantics of Control Operators. Technical Report CIS-TR-96-03, Dept. of Computer Science, University of Oregon, 1996.
23. A. Sabry and M. Felleisen. Reasoning about Programs in Continuation-Passing Style. Lisp and Symbolic Computation, 6(3-4):289-360, 1993.
24. 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.
25. H. Thielecke. Answer type polymorphism in call-by-name continuation passing. In Proc. 13th European Symposium on Programming, Lecture Notes in Computer Science 2986, pages 279-293, 2004.