Abstract
The term-generated models of an abstract data type can be represented by congruence relations on the term algebra. Total and partial heterogeneous algebras are considered as models of hierarchical abstract data types. Particular classes of models are studied and it is investigated under which conditions they form a complete lattice. This theory allows also to describe programming languages (and their semantic models) by abstract types. As example we present a simple deterministic stream processing language.
| Original language | English |
|---|---|
| Pages (from-to) | 139-174 |
| Number of pages | 36 |
| Journal | Theoretical Computer Science |
| Volume | 33 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - 1984 |
| Externally published | Yes |