1990
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
Publication
Publication
Presented at the
International Colloquium on Automata, Languages and Programming, Coventry
Term rewriting systems are important for computability theory of abstract data types, for automatic theorem proving, and for the foundations of functional programming. In this short survey we present, starting from first principles, several of the basic notions and facts in the area of term rewriting. Our treatment, which often will be informal, covers abstract rewriting, Combinatory Logic, orthogonal systems, strategies, critical pair completion, and some extended rewriting formats.
| Additional Metadata | |
|---|---|
| , | |
| Springer | |
| International Colloquium on Automata, Languages and Programming | |
| Organisation | Specification and Analysis of Embedded Systems |
|
Klop, J. W. (1990). Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond. In Lecture Notes in Computer Science (pp. 350–369). Springer. |
|
