Technical Reports

The ICICS/CS Reading Room

UBC CS TR-83-02 Summary

Data Types as Term Algebras, March 1983 K, Akira a and Karl Abrahamson

Data types in programming have been mathematically studied from two different viewpoints, namely data types as (initial) algebras and data types as complete partial orders. In this paper, we explore a possibility of finitaristic approach. For finitarists, the only sets accepted are ``recursively defined'' sets. We observe that recursive definition not only defines a set of terms but also basic operations over them, thus it induces an algebra of terms. We compare this approach to the existing two approaches. Using our approach we present finer classification of data types.

If you have any questions or comments regarding this page please send mail to