scientific article; zbMATH DE number 3821100

MaRDI QIDQ3667939zbMATH OpenFDO

Authors Pierre Lescanne

Publication date 1982

Full work available at URL https://eudml.org/doc/92169

zbMATH Keywords

term rewriting systemsterminationequational theoriesrecursive path orderingdecomposition orderingleft-weighted termsrecursive lexicographic ordering

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 3810909 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3198033 (Why is no real title available?)
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• A note on simplification orderings
• Abstract Data Type Specification in the Affirm System
• On multiset orderings
• Orderings for term-rewriting systems
• Proofs by induction in equational theories with constructors
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(7)

• Path of subterms ordering and recursive decomposition ordering revisited
• An effective proof of the well-foundedness of the multiset path ordering
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Termination of rewriting
• Termination orderings for associative-commutative rewriting systems
• Proof of termination of the rewriting system SUBSET on CCL
• scientific article; zbMATH DE number 3926235 (Why is no real title available?)

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