The thesis is that an abstract data type is a model of a set of axioms which is both initial and prime; initiality is to be connected with the constructive operations, primeness with the algorithmic ones. In a sense the prime model gives a characterization of the maximal set of objects one can describe. Finally, the authors introduce the notion of m-completeness of a theory, and show how by requiring this property for the abstract model one can guarantee that all the formulas holding on this model hold also on all the `concrete' representation.
Bertoni, A., Mauri, G., Miglioli, P. (1979). Model theoretic aspects of abstract data specification. In B. Domolki, T. Gergely (a cura di), Mathematical Logic in Computer Science (pp. 181-193). Amsterdam : North Holland.
Model theoretic aspects of abstract data specification
Mauri, G;
1979
Abstract
The thesis is that an abstract data type is a model of a set of axioms which is both initial and prime; initiality is to be connected with the constructive operations, primeness with the algorithmic ones. In a sense the prime model gives a characterization of the maximal set of objects one can describe. Finally, the authors introduce the notion of m-completeness of a theory, and show how by requiring this property for the abstract model one can guarantee that all the formulas holding on this model hold also on all the `concrete' representation.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
