Abstract
The most basic assumption in work on algebraic specification is that programs are modelled as algebras. This point of view abstracts from the concrete details of code and algorithms, and regards the input/output behaviour of functions and the representation of data as of primary importance. Representing programs in terms of sets (of data values) and ordinary mathematical functions over these sets greatly simplifies the task of reasoning about program correctness. The necessary underpinnings are offered by universal algebra, necessarily in a many-sorted variant, building on the classical single-sorted version. This chapter summarizes the basic concepts and results concerning many-sorted algebras that will be required for the rest of this book.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sannella, D., Tarlecki, A. (2011). Universal algebra. In: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17336-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-17336-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17335-6
Online ISBN: 978-3-642-17336-3
eBook Packages: Computer ScienceComputer Science (R0)