Asian Symposium on Programming Languages and Systems

APLAS 2007: Programming Languages and Systems pp 239-254

Polymorphic Delimited Continuations

  • Kenichi Asai
  • Yukiyoshi Kameyama
Conference paper

DOI: 10.1007/978-3-540-76637-7_16

Volume 4807 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Asai K., Kameyama Y. (2007) Polymorphic Delimited Continuations. In: Shao Z. (eds) Programming Languages and Systems. APLAS 2007. Lecture Notes in Computer Science, vol 4807. Springer, Berlin, Heidelberg

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.

Keywords

Type System Delimited Continuation Control Operator CPS Translation Predicative/Impredicative Polymorphism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kenichi Asai
    • 1
  • Yukiyoshi Kameyama
    • 2
  1. 1.Department of Information Science, Ochanomizu University 
  2. 2.Department of Computer Science, University of Tsukuba