Rewrite Systems
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 134 references indexed in Scilit:
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Equational methods in first order predicate calculusJournal of Symbolic Computation, 1985
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- A note on simplification orderingsInformation Processing Letters, 1979
- The theory of well-quasi-ordering: A frequently discovered conceptJournal of Combinatorial Theory, Series A, 1972
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963
- On multiplicative systems defined by generators and relationsMathematical Proceedings of the Cambridge Philosophical Society, 1951