论文信息 - Strong Normalization of Polymorphic Calculus for Delimited Continuations

Strong Normalization of Polymorphic Calculus for Delimited Continuations

The notion of delimited continuations has been proved useful in various areas of computer programming such as partial evaluation, mobile computing, and web transaction. In our previous work, we proposed polymorphic calculi with control operators for delimited continuations. This paper presents a proof of strong normalization (SN) of these calculi based on a refined (i.e. administrative redex-free) CPS translation.

Yukiyoshi Kameyama | Kenichi Asai

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

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

[3] Amr Sabry,et al. A type-theoretic foundation of continuations and prompts , 2004, ICFP '04.

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

[5] Yukiyoshi Kameyama,et al. Typed Dynamic Control Operators for Delimited Continuations , 2008, FLOPS.

[6] Kenichi Asai. Logical relations for call-by-value delimited continuations , 2005, Trends in Functional Programming.

[7] Mark Lillibridge,et al. Explicit polymorphism and CPS conversion , 1993, POPL '93.

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

[9] Andrzej Filinski,et al. Representing monads , 1994, POPL '94.

[10] Matthias Felleisen,et al. A Syntactic Approach to Type Soundness , 1994, Inf. Comput..

[11] Kenichi Asai. On typing delimited continuations: three new solutions to the printf problem , 2009, High. Order Symb. Comput..

[12] Peter Thiemann,et al. Combinators for program generation , 1999, Journal of Functional Programming.

[13] Yukiyoshi Kameyama,et al. Polymorphic Delimited Continuations , 2007, APLAS.