Orderings for term-rewriting systems
- 31 December 1982
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 17 (3), 279-301
- https://doi.org/10.1016/0304-3975(82)90026-3
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A note on simplification orderingsInformation Processing Letters, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Automatic Proofs of Theorems in Analysis Using Nonstandard TechniquesJournal of the ACM, 1977
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Algebraic simplificationCommunications of the ACM, 1971
- Decision procedures for real and p‐adic fieldsCommunications on Pure and Applied Mathematics, 1969
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963