Paper Info
Title
Polymorphic Delimited Continuations
Abstract
This paper presents a polymorphic type system for a language with de- limited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski, the proposed type system allows pure expressions to be polymor- phic. 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 transla- tion as well as extensions to impredicative polymorphism are also discussed. These technical results establish the foundation of polymorphic delimited continuations.
Year
DOI
Venue
2007
10.1007/978-3-540-76637-7_16
Asian Symposium on Programming Languages and Systems
Keywords
Field
DocType
answer type,polymorphic delimited continuation,cps translation,polymorphic type system,delimited continuation,monomorphic type system,proposed type system,delimited control operator,principal type,predicative/impredicative polymorphism.,strong type soundness,strong normalization,type system,control operator,polymorphism,satisfiability
Programming language,Normalization (statistics),Expression (mathematics),Inference,Computer science,Delimited continuation,Operator (computer programming),Impredicativity,Soundness
Conference
Volume
ISSN
ISBN
4807
0302-9743
3-540-76636-7
Citations 
PageRank 
References 
19
0.79
18
Authors
2
Name
Order
Citations
PageRank
Kenichi Asai19414.89
Yukiyoshi Kameyama217117.29