scientific article; zbMATH DE number 3821100

zbMATH Open0518.68025MaRDI QIDQ3667939FDOQ3667939

Authors: Pierre Lescanne 

Publication date: 1982

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

Title of this publication is not available (Why is that?)

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

• Title not available (Why is that?)
• Orderings for term-rewriting systems
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Proofs by induction in equational theories with constructors
• On multiset orderings
• A note on simplification orderings
• Abstract Data Type Specification in the Affirm System
• Title not available (Why is that?)

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
• Title not available (Why is that?)

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)