## Strong Normalization of Polymorphic Calculus for Delimited Continuations

### BibTeX

@MISC{Kameyama_strongnormalization,

author = {Yukiyoshi Kameyama and Kenichi Asai},

title = {Strong Normalization of Polymorphic Calculus for Delimited Continuations},

year = {}

}

### OpenURL

### Abstract

Abstract. 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.

### Citations

566 | A syntactic approach to type soundness
- Wright, Felleisen
- 1994
(Show Context)
Citation Context ... : τ is derivable. Theorem 2 (Progress). If ⊢p 〈e〉 : τ is derivable, then 〈e〉 can be reduced. By Theorems 1 and 2, we can conclude that our type system is sound (strong type soundness in the sense of =-=[18]-=-). Theorem 3 (Principal Type and Type Inference). In λ s/r let , principal type exists, and we can construct a sound and complete type inference algorithm as an extension of HindleyMilner’s algorithm.... |

250 | A formulae-as-types notion of control
- Griffin
- 1990
(Show Context)
Citation Context ...or continuations, which has been intensively studied from theory to implementation and practical applications. Type-theoretic studies on “call/cc” have revealed that it corresponds to classical logic =-=[10]-=-. Delimited continuation is a similar notion to (unlimited) continuation, but it represents part of the rest of the computation rather than whole rest of the computation. Since Danvy and Filinski have... |

210 |
Call-by-name, call-by-value and the λ-calculus
- Plotkin
- 1976
(Show Context)
Citation Context ... refine the definitional CPS translation so that it may produce fewer administrative redexes. There are several ways to define such optimized CPS translations since Plotkin proposed Colon Translation =-=[16]-=-. Here we use an extended version of two-level lambda calculus [7] as the target calculus of the translation, and define a refined CPS translation from λ s/r let to it. 4.1 Two-Level Version of Polymo... |

148 |
Proofs and Types, volume 7 of Cambridge Tracts
- Girard, Lafont, et al.
- 1989
(Show Context)
Citation Context ... as one of the most fundamental properties of many typed lambda calculi which correspond to logical systems under the Curry-Howard isomorphism. For instance, strong normalization of Girard’s System F =-=[9]-=- implies its (logical) consistency. On the other hand, strong normalization of computational calculi with control operators is a subtle issue as shown by the following list:v ::= c | x | λx.e value e... |

133 | Representing Monads
- Filinski
- 1994
(Show Context)
Citation Context ...ression, or a conditional. Note that we omit the fixpoint operator from the calculus in [4]. 3 Filinski did not give a type system explicitly, but his well-known implementation of “shift” and “reset” =-=[8]-=- specifies a certain type system. 2(λx.e)v � e[v/x] 〈v〉 � v 〈F [Sk.e]〉 � 〈let k = λx.〈F [x]〉 in e〉 let x = v in e � e[v/x] if true then e1 else e2 � e1 if false then e1 else e2 � e2 Fig. 2. Reduction... |

98 | Abstracting Control
- Danvy, Filinski
- 1990
(Show Context)
Citation Context ... represents part of the rest of the computation rather than whole rest of the computation. Since Danvy and Filinski have proposed the control operators “shift” and “reset” for delimited continuations =-=[6]-=-, they have been proved useful in various applications such as backtracking [6], A-normalization in direct style [2], let-insertion in partial evaluation [17], type-safe “printf” [3], and web transact... |

83 | Representing Control: A Study of the CPS transformation
- Danvy, Filinski
- 1992
(Show Context)
Citation Context ...r delimited continuations comes from the fact that there exists a simple, compositional CPS translation. Danvy and Filinski gave the precise semantics of shift and reset in terms of a CPS translation =-=[6, 7]-=-, and based on their translation, various theoretical results as well as applications using shift and reset have been proposed (see, for instance, [12]). In this section, we present an extension of Da... |

69 | Explicit polymorphism and CPS conversion
- HARPER, LILLIBRIDGE
- 1993
(Show Context)
Citation Context ...e2 else e3 expression Fig. 1. Syntax of λ s/r let . – A typed calculus with “call/cc” is strongly normalizing, while that with exception in Standard ML is not strongly normalizing (see, for instance, =-=[11]-=-). – The calculus with “shift” and “reset” under Filinski’s typing 3 is not normalizing, while, under Danvy and Filinski’s type system, it is strongly normalizing [1]. – A typed calculus with “control... |

67 | A Functional Abstraction of Typed Contexts - Danvy, Filinski - 1989 |

25 | A Sound and Complete Axiomatization of Delimited Continuations
- Kameyama, Hasegawa
- 2003
(Show Context)
Citation Context ... shift and reset in terms of a CPS translation [6, 7], and based on their translation, various theoretical results as well as applications using shift and reset have been proposed (see, for instance, =-=[12]-=-). In this section, we present an extension of Danvy and Filinski’s CPS translation, namely, a CPS translation from λ s/r let to a pure polymorphic lambda calculus λlet. We call this CPS translation a... |

24 |
A type-theoretic foundation of continuations and prompts
- Ariola, Herbelin, et al.
- 2004
(Show Context)
Citation Context ... normalizing (see, for instance, [11]). – The calculus with “shift” and “reset” under Filinski’s typing 3 is not normalizing, while, under Danvy and Filinski’s type system, it is strongly normalizing =-=[1]-=-. – A typed calculus with “control” and “prompt”, the other control operators for delimited continuations, is not normalizing [13]. Similarly, a typed calculus with the control operator cupto is not n... |

22 |
Combinators for program generation
- Thiemann
- 1999
(Show Context)
Citation Context ...t” and “reset” for delimited continuations [6], they have been proved useful in various applications such as backtracking [6], A-normalization in direct style [2], let-insertion in partial evaluation =-=[17]-=-, type-safe “printf” [3], and web transaction [15]. This paper investigates the type structure of “shift” and “reset”, and in particular, proves strong normalization of a polymorphic calculus for them... |

20 | Polymorphic Delimited Continuations
- Asai, Kameyama
- 2007
(Show Context)
Citation Context ...], and web transaction [15]. This paper investigates the type structure of “shift” and “reset”, and in particular, proves strong normalization of a polymorphic calculus for them. In our previous work =-=[4]-=-, we have introduced a polymorphic type system for “shift” and “reset”, and proved a number of properties such as type soundness (subject reduction and progress). The strong normalization property, ho... |

10 | On Typing Delimited Continuations: Three New Solutions to the Printf Problem,” to appear in Higher-Order and Symbolic Computation. Also available as
- Asai
- 2006
(Show Context)
Citation Context ...ted continuations [6], they have been proved useful in various applications such as backtracking [6], A-normalization in direct style [2], let-insertion in partial evaluation [17], type-safe “printf” =-=[3]-=-, and web transaction [15]. This paper investigates the type structure of “shift” and “reset”, and in particular, proves strong normalization of a polymorphic calculus for them. In our previous work [... |

4 | Logical Relations for Call-by-value Delimited Continuations
- Asai
- 2007
(Show Context)
Citation Context ...have proposed the control operators “shift” and “reset” for delimited continuations [6], they have been proved useful in various applications such as backtracking [6], A-normalization in direct style =-=[2]-=-, let-insertion in partial evaluation [17], type-safe “printf” [3], and web transaction [15]. This paper investigates the type structure of “shift” and “reset”, and in particular, proves strong normal... |

3 | Typed dynamic control operators for delimited continuations
- Kameyama, Yonezawa
- 2008
(Show Context)
Citation Context ...le, under Danvy and Filinski’s type system, it is strongly normalizing [1]. – A typed calculus with “control” and “prompt”, the other control operators for delimited continuations, is not normalizing =-=[13]-=-. Similarly, a typed calculus with the control operator cupto is not normalizing [14]. Hence, we can say SN for the calculi with control operators is a non-trivial issue. This paper solves the problem... |

1 |
Simply Typed Lambda-Calculus with a Typed-Prompt Delimited Control is not Strongly Normalizing
- Kiselyov
- 2006
(Show Context)
Citation Context ... calculus with “control” and “prompt”, the other control operators for delimited continuations, is not normalizing [13]. Similarly, a typed calculus with the control operator cupto is not normalizing =-=[14]-=-. Hence, we can say SN for the calculi with control operators is a non-trivial issue. This paper solves the problem for the case of “shift” and “reset” under the polymorphic type system. The rest of t... |

1 |
Demo of Persistent Delimited Continuations in OCaml for Nested Web Transactions
- Kiselyov
- 2008
(Show Context)
Citation Context ...ey have been proved useful in various applications such as backtracking [6], A-normalization in direct style [2], let-insertion in partial evaluation [17], type-safe “printf” [3], and web transaction =-=[15]-=-. This paper investigates the type structure of “shift” and “reset”, and in particular, proves strong normalization of a polymorphic calculus for them. In our previous work [4], we have introduced a p... |