A Theory of Inductive Data Types Involving Safe Pointers
Project/Area Number |
19700006
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Single-year Grants |
Research Field |
Fundamental theory of informatics
|
Research Institution | Gunma University |
Principal Investigator |
HAMANA Makoto Gunma University, 大学院・工学研究科, 助教 (90334135)
|
Project Period (FY) |
2007 – 2009
|
Project Status |
Completed (Fiscal Year 2009)
|
Budget Amount *help |
¥2,290,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥390,000)
Fiscal Year 2009: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2008: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2007: ¥600,000 (Direct Cost: ¥600,000)
|
Keywords | 関数型プログラミング言語 / 項書換え・データ構造・情報基礎 / 関数プログラム / 項書換え / 情報基礎 / データ構造 / 項書替え |
Research Abstract |
Cyclic sharing tree structures appear very often in logic and theoretical computer science. We investigate a mathematically clean representation of them. We apply the obtained representation to inductive datatypes in functional programming languages.
|
Report
(4 results)
Research Products
(29 results)