Termination by completion
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 1 (2) , 79-96
- https://doi.org/10.1007/bf01810293
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Path of subterms ordering and recursive decomposition ordering revisitedJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Rewriting systems on FP expressions to reduce the number of sequences yieldedScience of Computer Programming, 1986
- Proof of termination of the rewriting system subst on CCLTheoretical Computer Science, 1986
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980