Rewriting
Top Cited Papers
- 1 January 2001
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 75 references indexed in Scilit:
- Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengthsTheoretical Computer Science, 1995
- Generating polynomial orderingsInformation Processing Letters, 1994
- A completion procedure for conditional equationstJournal of Symbolic Computation, 1991
- Automating the Knuth Bendix orderingActa Informatica, 1990
- Rewriting with a nondeterministic choice operatorTheoretical Computer Science, 1988
- 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
- Programming with EquationsACM Transactions on Programming Languages and Systems, 1982
- 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