Publication:3667939
From MaRDI portal
zbMath0518.68025MaRDI QIDQ3667939
Publication date: 1982
Full work available at URL: https://eudml.org/doc/92169
termination; term rewriting systems; recursive path ordering; equational theories; decomposition ordering; left-weighted terms; recursive lexicographic ordering
68Q65: Abstract data types; algebraic specification
Related Items
An effective proof of the well-foundedness of the multiset path ordering, Termination orderings for associative-commutative rewriting systems, Termination of rewriting, Path of subterms ordering and recursive decomposition ordering revisited, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Proof of termination of the rewriting system SUBSET on CCL, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Proofs by induction in equational theories with constructors
- A note on simplification orderings
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- On multiset orderings
- Abstract Data Type Specification in the Affirm System
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture