Universal Algebra for Computer Scientists: Vol 25 (EATCS Monographs in Theoretical Computer Science) - Tapa dura
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Universal Algebra for Computer Scientists: Vol 25 (EATCS...
Imagen del vendedor
Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Studibuch, Stuttgart, Alemania
Calificación del vendedor: 5 de 5 estrellas
hardcover. Condición: Sehr gut. 351 Seiten; 9783540542803.2 Gewicht in Gramm: 1. Nº de ref. del artículo: 1137495
Comprar usado
EUR 57,71
Envío por EUR 62,30
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles