Path of subterms ordering and recursive decomposition ordering revisited
From MaRDI portal
Publication:1099655
DOI10.1016/S0747-7171(87)80023-8zbMath0638.68107OpenAlexW2053806880MaRDI QIDQ1099655
Publication date: 1987
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80023-8
rewriting systemsrecursive path orderingcomputing of normal formsrecursive decomposition orderingsubterms ordering
Related Items
Extensions and comparison of simplification orderings, Time bounded rewrite systems and termination proofs by generalized embedding, An improved general path order, On the recursive decomposition ordering with lexicographical status and other related orderings, On the complexity of recursive path orderings, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Termination by completion, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Simplification orderings: Putting them to the test
Cites Work
