Axioms for Delimited Continuations in the CPS Hierarchy

A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard call-by-value CPS translation, Danvy and Filinski discovered the CPS hierarchy and proposed a family of control operators, shift and reset, that make it possible to capture successive delimited continuations in a CPS hierarchy.

[1]  Olivier Danvy,et al.  Type-directed partial evaluation , 1995, POPL '96.

[2]  Timothy G. Griffin,et al.  A formulae-as-type notion of control , 1989, POPL '90.

[3]  Olivier Danvy,et al.  AN OPERATIONAL FOUNDATION FOR DELIMITED CONTINUATIONS IN THE CPS HIERARCHY , 2005 .

[4]  Kenichi Asai.  Offline partial evaluation for shift and reset , 2004, PEPM '04.

[5]  Amr Sabry,et al.  Reasoning about programs in continuation-passing style , 1992, LFP '92.

[6]  Robert Hieb,et al.  Subcontinuations , 1994, LISP Symb. Comput..

[7]  Olivier Danvy,et al.  Continuation-based partial evaluation , 1994, LFP '94.

[8]  Harvey M. Friedman,et al.  Classically and intuitionistically provably recursive functions , 1978 .

[9]  Takayasu Ito,et al.  Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics , 2001, Lecture Notes in Computer Science.

[10]  Olivier Danvy,et al.  Abstracting control , 1990, LISP and Functional Programming.

[11]  Olivier Danvy,et al.  An Operational Investigation of the CPS Hierarchy , 1999, ESOP.

[12]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[13]  Jørgen Lindskov Knudsen,et al.  Advances in Exception Handling Techniques , 2001, Lecture Notes in Computer Science.

[14]  Kenichi Asai.  Online partial evaluation for shift and reset , 2002, PEPM.

[15]  Hayo Thielecke,et al.  Answer Type Polymorphism in Call-by-Name Continuation Passing , 2004, ESOP.

[16]  Yukiyoshi Kameyama,et al.  A sound and complete axiomatization of delimited continuations , 2003, ICFP '03.

[17]  Olivier Danvy,et al.  Representing Control: a Study of the CPS Transformation , 1992, Mathematical Structures in Computer Science.

[18]  Akinori Yonezawa,et al.  Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling , 2000, Advances in Exception Handling Techniques.

[19]  Didier Rémy,et al.  A generalization of exceptions and control in ML-like languages , 1995, FPCA '95.

[20]  Matthias Felleisen,et al.  The theory and practice of first-class prompts , 1988, POPL '88.

[21]  O. Danvy,et al.  An Operational Foundation for Delimited Continuations , 2003 .

[22]  Yukiyoshi Kameyama,et al.  A Type-Theoretic Study on Partial Continuations , 2000, IFIP TCS.

[23]  Andrzej Filinski,et al.  Representing layered monads , 1999, POPL '99.

[24]  Olivier Danvy,et al.  A Functional Abstraction of Typed Contexts , 1989 .

[25]  Olivier Danvy,et al.  On Evaluation Contexts, Continuations, and the Rest of the Computation , 2004 .