Termination of linear rewriting systems
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 448-458
- https://doi.org/10.1007/3-540-10843-2_36
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- 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
- Computing in systems described by equationsLecture Notes in Computer Science, 1977
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973