Abstract
In the last two decades universal algebra has become useful and important in theoretical computer science. In particular, structural aspects such as syntax and semantics, data abstraction, etc., are mainly investigated by methods of universal algebra. To describe, for example, the semantics of abstract data types or program schemes, algebras are generally needed as models in which all syntactic symbols involved in the considered objects are interpreted. In this approach, classes of algebras have to be manipulated in a suitable way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wechler, W. (1992). Universal Algebra. In: Universal Algebra for Computer Scientists. EATCS Monographs on Theoretical Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76771-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-76771-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-76773-9
Online ISBN: 978-3-642-76771-5
eBook Packages: Springer Book Archive