Foundation and Application of Delimited Continuations
| Project/Area Number |
18500005
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Ochanomizu University |
|---|
Principal Investigator |
ASAI Kenichi Ochanomizu University, 大学院・人間文化創成科学研究科, 准教授 (10262156)
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
KAMEYAMA Yukiyoshi 筑波大学, 大学院・システム情報工学研究科, 准教授 (10195000)
|
|---|
| Project Period (FY) |
2006 – 2009
|
| Project Status |
Completed (Fiscal Year 2009)
|
| Budget Amount *help |
¥3,890,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥690,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2007: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2006: ¥900,000 (Direct Cost: ¥900,000)
|
|---|
| Keywords | プログラム理論 / 部分継続 / 情報基礎 |
|---|
| Research Abstract |
The conventional monomorphic type system for delimited continuations is extended to cope with polymorphism. The various properties of the type system are proved, such as type soundness. The type soundness is formalized using the Coq proof assistant. Ther low-level implementation of delimited continuations that copies a part of stack is shown to be systematically derivable from their definitional interpreter. Based on the technique, a compiler that produces machine code is constructed. As annaturally implemented with delimited continuation constructs.
|
Report
(6 results)
Research Products
(46 results)
