Universal Algebra for Computer Scientists

Written for computer scientists, this volume offers a new model-theoretic approach to universal algebra and presents a systematic development of the methods of results of universal algebra that are useful in a variety of applications in computer science. The book is concerned with the algebraic characterization of axiomatic classes of algebras by closure operators generalizing the famous Birkhoff Variety Theorem and the algebraic characterization of related theories. The book also presents a study of term rewriting systems. Beside basic notions, the Knuth-Bendix completion procedure and terminal 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.

[1]  G. Birkhoff.  Subdirect unions in universal algebra , 1944 .

[2]  Jiří Adámek.  How many variables does a quasivariety need? , 1990 .

[3]  Pierre Lescanne,et al.  An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations , 1986, CADE.

[4]  Michaël Rusinowitch.  Path of Subterms Ordering and Recursive Decomposition Ordering Revisited , 1985, RTA.

[5]  Jan Willem Klop,et al.  Term rewriting systems: a tutorial , 1987 .

[6]  Craig Platt,et al.  Iterated limits of universal algebras , 1971 .

[7]  Michael M. Richter,et al.  Systems of Reductions , 1987, Lecture Notes in Computer Science.

[8]  A. Selman.  Completeness of calculii for axiomatically defined classes of algebras , 1972 .

[9]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[10]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[11]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[12]  Stephen G. Simpson,et al.  Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume , 1985, Arch. Math. Log..

[13]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 2 , 1990, EATCS Monographs on Theoretical Computer Science.

[14]  Donald Sannella,et al.  Some Thoughts on Algebraic Specification , 1984, ADT.

[15]  Paul Bernays,et al.  A System of Axiomatic Set Theory , 1976 .

[16]  Stephen L. Bloom,et al.  Finitary quasi-varieties , 1982 .

[17]  W. W. Boone.  THE WORD PROBLEM. , 1958, Proceedings of the National Academy of Sciences of the United States of America.

[18]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[19]  Robin Milner,et al.  LCF: A Way of Doing Proofs with a Machine , 1979, MFCS.

[20]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[21]  Irène Guessarian,et al.  Survey on classes of interpretations and some of their applications , 1983, SIGA.

[22]  Jiří Adámek,et al.  Absolutely definable varieties of continuous algebras , 1987 .

[23]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[24]  G. Markowsky.  Chain-complete posets and directed sets with applications , 1976 .

[25]  John V. Guttag,et al.  The specification and application to programming of abstract data types. , 1975 .

[26]  Joseph A. Goguen,et al.  Semantics of computation , 1974, Category Theory Applied to Computation and Control.

[27]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[28]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[29]  Martin Gogolla,et al.  Algebraische Spezifikation abstrakter Datentypen , 1989 .