scientific article; zbMATH DE number 3870584

MaRDI QIDQ3336681zbMATH OpenFDO

Authors Pierre Lescanne

Publication date 1984

zbMATH Keywords

Recursive Decomposition OrderingREVEtermination of Term Rewriting systemswell-founded ordering

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Software, source code, etc. for problems pertaining to computer science (68-04) Theory of software (68N99) Abstract data types; algebraic specification (68Q65)

Recommendations

• On the recursive decomposition ordering with lexicographical status and other related orderings
• scientific article; zbMATH DE number 176122
• A termination ordering for higher order rewrite systems
• scientific article; zbMATH DE number 3930339
• scientific article; zbMATH DE number 3905845

Cited in

(12)

• Termination orderings for associative-commutative rewriting systems
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• Proving termination of (conditional) rewrite systems. A semantic approach
• Relative undecidability in term rewriting. I: The termination hierarchy
• An improved general path order
• scientific article; zbMATH DE number 862680 (Why is no real title available?)
• An overview of LP, the Larch Prover
• Extensions and comparison of simplification orderings
• Rewriting Techniques and Applications
• Two applications of analytic functors
• On the recursive decomposition ordering with lexicographical status and other related orderings

Describes a project that uses

Uses Software

• REVE

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 Q3336681)