A Type System for Dynamic Delimited Continuations
スポンサーリンク
概要
- 論文の詳細を見る
We study the control operators "control" and "prompt" which manage part of continuations, that is, delimited continuations. They are similar to the well-known control operators "shift" and "reset", but differ in that the former is dynamic, while the latter is static. In this paper, we introduce a static type system for "control" and "prompt" which does not use recursive types. We design our type system based on the dynamic CPS transformation recently proposed by Biernacki, Danvy and Millikin. We alse itroduce let-polymorphism into our type system, and show that our type system satisfies several important properties such as strong type soudness.
- 一般社団法人情報処理学会の論文
- 2008-03-15
著者
-
Kameyama Yukiyoshi
Department Of Computer Science Graduate School Of Systems And Information Engineering University Of
-
YONEZAWA TAKUO
Department of Computer Science, Graduate School of Systems and Information Engineering, University o
-
Yonezawa Takuo
Department Of Computer Science Graduate School Of Systems And Information Engineering University Of
関連論文
- A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability(Type Theory and its Applications to Computer Systems)
- A Type System for Dynamic Delimited Continuations
- A Type System for Dynamic Delimited Continuations
- A Type System for Dynamic Delimited Continuations