Path of subterms ordering and recursive decomposition ordering revisited

DOI10.1016/S0747-7171(87)80023-8MaRDI QIDQ1099655zbMATH OpenOpenAlexFDO

Authors Michaël Rusinowitch

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

zbMATH Keywords

rewriting systemscomputing of normal formsrecursive decomposition orderingrecursive path orderingsubterms ordering

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 3921961
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Extensions and comparison of simplification orderings
• Simplification orderings: Putting them to the test
• Solving simplification ordering constraints

Cites work

• scientific article; zbMATH DE number 3870584 (Why is no real title available?)
• scientific article; zbMATH DE number 3810909 (Why is no real title available?)
• scientific article; zbMATH DE number 3821100 (Why is no real title available?)
• scientific article; zbMATH DE number 3905845 (Why is no real title available?)
• On multiset orderings
• Orderings for term-rewriting systems
• Proving termination with multiset orderings

Cited in

(14)

• On the recursive decomposition ordering with lexicographical status and other related orderings
• On the complexity of recursive path orderings
• Improving associative path orderings
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• An improved general path order
• Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
• Extensions and comparison of simplification orderings
• Polymorphic higher-order recursive path orderings
• scientific article; zbMATH DE number 3921961 (Why is no real title available?)
• Simplification orderings: Putting them to the test
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Termination by completion
• A Lambda-Free Higher-Order Recursive Path Order
• Time bounded rewrite systems and termination proofs by generalized embedding

This page was built for publication: Path of subterms ordering and recursive decomposition ordering revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099655)