抄録
A new data type declaration mechanism of defining codatatypes is introduced to a functional programming language ML. Codatatypes are dual to datatypes for which ML already has a mechanism of defining. Sums and finite lists are defined as datatypes, but their duals, products and infinite lists, could not be defined in ML. This new facility gives ML the missing half of data types and makes ML symmetric. Categorical and domain-theoretic characterization of codatatypes are also given.
本文言語 | English |
---|---|
ページ(範囲) | 629-650 |
ページ数 | 22 |
ジャーナル | Journal of Symbolic Computation |
巻 | 8 |
号 | 6 |
DOI | |
出版ステータス | Published - 1989 |
外部発表 | はい |
ASJC Scopus subject areas
- 代数と数論
- 計算数学