© 1992

Universal Algebra for Computer Scientists


Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 25)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Wolfgang Wechler
    Pages 1-88
  3. Wolfgang Wechler
    Pages 89-133
  4. Wolfgang Wechler
    Pages 135-241
  5. Wolfgang Wechler
    Pages 243-295
  6. Back Matter
    Pages 297-341

About this book


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.


Abstrakter Datentyp Algebraic Semantics Algebraische Semantik Algebraische Spezifikation Fixpiont Methods Fixpunkt (Math.) Notation Termersetzung algebra computer science development semantics term rewriting data structures

Authors and affiliations

  1. 1.Institut für InformatikUniversität WürzburgWürzburgGermany

Bibliographic information

Industry Sectors
IT & Software