Universal algebra for computer scientists

Front Cover
Springer-Verlag, 1992 - Computers - 339 pages
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Preliminaries
1
Reductions
89
Universal Algebra
135
Copyright

4 other sections not shown

Other editions - View all

Common terms and phrases