| 書目名稱 | Universal Algebra for Computer Scientists |
| 編輯 | Wolfgang Wechler |
| 視頻video | http://file.papertrans.cn/943/942204/942204.mp4 |
| 叢書名稱 | Monographs in Theoretical Computer Science. An EATCS Series |
| 圖書封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1992 |
| 關(guān)鍵詞 | Abstrakter Datentyp; Algebraic Semantics; Algebraische Semantik; Algebraische Spezifikation; Fixpiont Me |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-76771-5 |
| isbn_softcover | 978-3-642-76773-9 |
| isbn_ebook | 978-3-642-76771-5Series ISSN 1431-2654 Series E-ISSN 2193-2069 |
| issn_series | 1431-2654 |
| copyright | Springer-Verlag Berlin Heidelberg 1992 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 16:16
發(fā)表于 2025-3-21 19:15:23
