Abstract
The framework of Unified Algebras, recently developed for the axiomatic specification of ADT, is modified by introducing again the notion of sort as a classification mechanism for elements of a type. While retaining the idea of sorts as values, Heterogeneous Unified Algebras allow the distinction between certain sorts and the definition of subsorts by applying operations to them. A Specification Logic (which can be extended to an Institution using only injective signature morphisms) is defined, and initial algebra and free construction are shown to exist.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H.Ehrig, B.Mahr: Fundamentals of Algebraic Specification 1. Initial Semantics and Equations Springer, EATCS Monographs on Theoretical Computer Science 6 (1985).
H.Ehrig, F.Parisi-Presicce: Nonequivalence of categories for equational algebraic specifications. In Proc. 8th Workshop on Abstr. Data Types, 1991, Springer Lecture Notes in Computer Science 665 (1993) 222–235.
H.Ehrig, P.Pepper, F.Orejas: On Recent Trends in Algebraic Specification. In ICALP'89 Proc. Int. Coll. on Automata, Languages and Programming, Springer Lecture Notes in Computer Science 372 (1989) 263–288.
J.A.Goguen, R.M.Bustrall: Introducing Institutions. Proc. Logics of Programming Workshop, Springer Lecture Notes in Computer Science 164 (1984) 221–256.
J.A.Goguen, R.Diaconescu: A Short Oxford Survey of Order Sorted Algebras. Algebraic Specification Column, EATCS Bulletin 48 (1992) 120–133.
J.A.Goguen, J.Meseguer: Order Sorted Algebras I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comp. Sci. 105 (1992) 217–273.
P.D.Mosses: Unified Algebras and Institutions. In Proc. 4th IEEE Ann. Symp. on Logic in Computer Science, IEEE Press (1989) 304–312.
P.D.Mosses: Unified Algebras and Modules. In Proc. 16th Ann. ACM Symp. on Principles of Programming Languages, ACM (1989) 329–343.
P.D.Mosses: The use of sorts in algebraic specifications. In Proc. 8th Workshop on Abstr. Data Types, 1991, Springer Lecture Notes in Computer Science 665 (1993) 66–92.
F.Parisi-Presicce, S.Veglioni: Heterogeneous Unified Algebras. Tecnical Report 22, Dip. di Matematica, Universit de L'Aquila (1992).
A.Poigné: Partial algebras, subsorting and dependent data types. In Proc. 5th Workshop on Abstract Data Types, 1987, Springer Lecture Notes in Computer Science 332 (1988) 208–234.
A.Poigné: Parametrization for order-sorted algebraic specifications. J. Comput. System Sci. vol. 40 no. 2 (1990) 229–268.
A.Poigné: Once more on order-sorted algebras. In Proc. Symposium on Math. Foundations of Computer Science, Springer Lecture Notes in Computer Science 520 (1991) 397–405.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parisi-Presicce, F., Veglioni, S. (1993). Heterogeneous unified algebras. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_53
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive