String-rewriting systems
by Book, Ronald V., Otto, Friedrich
fromTexts and Monographs in Computer Science
String-rewriting systems
by Book, Ronald V., Otto, Friedrich
fromTexts and Monographs in Computer Science
String rewriting systems
by Book, Ronald V., Otto, Friedrich
fromTexts and Monographs in Computer Science
String-rewriting systems
by Book, Ronald V., Otto, Friedrich
fromTexts and Monographs in Computer Science
String-rewriting systems
by Book, Ronald V., Otto, Friedrich
fromTexts and Monographs in Computer Science
"Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, f…
An introduction to the theory of term rewriting systems. This is a technique used in computer science, especially functional programming, for abstract data type specification and automatic theorem-proving.
I. Basic specifications. 1. Signatures -- 2. Models -- 3. Sentences -- 4. Satisfaction -- 5. Proof system -- II. Structuring specifications. 6. Fundamental semantics concepts -- 7. Module imports -- 8. Views -- 9. Parameterized modules -- 10. Module expressions -- 11. Built-in m…
CafeOBJ is an industrial strength modern algebraic specification language, a successor of the famous OBJ language, and directly incorporating new paradigms such as behavioural concurrent specification and rewriting logic. CafeOBJ is the core of an environment supporting the syst…