scientific article; zbMATH DE number 3921961

MaRDI QIDQ3696501zbMATH OpenFDO

Authors Michaël Rusinowitch

Publication date 1985

zbMATH Keywords

simplification orderings

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Path of subterms ordering and recursive decomposition ordering revisited
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Extensions and comparison of simplification orderings
• On recursive path ordering
• Maximal extensions of simplification orderings

Cited in

(10)

• Termination orderings for associative-commutative rewriting systems
• On recursive path ordering
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• History and basic features of the critical-pair/completion procedure
• Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
• Proving termination of (conditional) rewrite systems. A semantic approach
• A Lambda-Free Higher-Order Recursive Path Order
• scientific article; zbMATH DE number 604876 (Why is no real title available?)
• Automating the Knuth Bendix ordering

This page was built for publication:

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