Auf ein Miniaturbild klicken, um zu Google Books zu gelangen.
Lädt ... Universal Algebra for Computer Scientistsvon Wolfgang Wechler
Keine Lädt ...
Melde dich bei LibraryThing an um herauszufinden, ob du dieses Buch mögen würdest. Keine aktuelle Diskussion zu diesem Buch. Keine Rezensionen keine Rezensionen | Rezension hinzufügen
Gehört zur Reihe
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. Keine Bibliotheksbeschreibungen gefunden. |
Aktuelle DiskussionenKeine
Google Books — Lädt ... GenresMelvil Decimal System (DDC)004.01Information Computer Science; Knowledge and Systems Computer science Computer science -- subdivisions Theory And InstructionKlassifikation der Library of Congress [LCC] (USA)BewertungDurchschnitt:
Bist das du?Werde ein LibraryThing-Autor. |