Polymorphic Delimited Continuations

Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski, the proposed type system allows pure expressions to be polymorphic. Thanks to the explicit presence of answer types, our type system satisfies various important properties, including strong type soundness, existence of principal types and an inference algorithm, and strong normalization. Relationship to CPS translation as well as extensions to impredicative polymorphism are also discussed. These technical results establish the foundation of polymorphic delimited continuations.

• Type: Conference
• Year: 2007
• Where: APLAS
• Authors: Kenichi Asai, Yukiyoshi Kameyama
• Keywords: APLAS 2007, Polymorphic Delimited Continuations, Polymorphic Type, Programming Languages, Type System