A path ordering for proving termination of term rewriting systems
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 173-187
- https://doi.org/10.1007/3-540-15198-2_11
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean ringsPublished by Springer Nature ,2005
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- 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
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970