Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq
From MaRDI portal
Recommendations
Cited in
(11)- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
- Certified Higher-Order Recursive Path Ordering
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS
- A proof-theoretical investigation of Zantema's problem
- scientific article; zbMATH DE number 2154398 (Why is no real title available?)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- On the formalization of termination techniques based on multiset orderings
- Admissible ordering on monomials is well-founded: a constructive proof
- Coq formalization of the higher-order recursive path ordering
- An effective proof of the well-foundedness of the multiset path ordering
This page was built for publication: Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024845)