この論文をさがす
抄録
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 also introduce let-polymorphism into our type system and show that our type system satisfies several important properties such as strong type soundness.
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 also introduce let-polymorphism into our type system, and show that our type system satisfies several important properties such as strong type soundness.
収録刊行物
-
- 情報処理学会論文誌プログラミング(PRO)
-
情報処理学会論文誌プログラミング(PRO) 49 (SIG3(PRO36)), 28-38, 2008-03-15
東京 : 情報処理学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1050001337890488832
-
- NII論文ID
- 110006684628
-
- NII書誌ID
- AA11464814
-
- ISSN
- 18827802
- 03875806
-
- NDL書誌ID
- 9421235
-
- 本文言語コード
- en
-
- 資料種別
- article
-
- データソース種別
-
- IRDB
- NDL
- CiNii Articles
- KAKEN