Abstract
Hierarchical abstract types, where particular sorts, operations, and axioms are designated as primitive, with conditional equational formulas are studied. Introducing notions of different homomorphisms particular models of this class can be distinguished as initial or (weakly) terminal. Sufficient conditions for the existence of such models are given and their relationship to the principle of fully abstract semantics is investigated. By this the concept of algebraic specification is extended to specify the semantics of programming languages in a completely abstract algebraic way as it is demonstrated for two toy languages.
| Original language | English |
|---|---|
| Pages (from-to) | 47-64 |
| Number of pages | 18 |
| Journal | Acta Informatica |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1982 |