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.
|Number of pages||22|
|Journal||Journal of Symbolic Computation|
|Publication status||Published - 1989|
ASJC Scopus subject areas
- Algebra and Number Theory
- Computational Mathematics