Year: 1982
Type: article
Abstract: A mathematical model for the notion "data type" is presented. The proposed theory seems to be at least as powerful as the initial algebra approach (see [1]), but can be handled far more easily. A clear distinction is drawn between algebras that are data types and those being merely implementations of types. If an algebra is a type, then each of its elements can be calculated by finite application of operators associated to that type. The model includes error handling.
Source: ACM SIGPLAN Notices
Author: Gebhard Greiter
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: data types, algebra, initial algebras, error handling
Open Access status: bronze
OpenAlex ID: W2033580006
