A Constructive Axiomatization of the Recursive Path Ordering
نویسندگان
چکیده
Résumé We give an axiomatization of Recursive Path Orders in the Calculus of Inductive Constructions. Then, we show that they are monotonic strict partial orders, and that they are well-founded. The proof of the well-foundedness is particularly short and elementary. Finally, we produce three relations that are proved to model the axiomatization: the Multiset Path Ordering, the Lexicographic Path Ordering, and the Recursive Path Ordering with status. All this work is implemented in the Coq proof assistant.
منابع مشابه
Certified Higher-Order Recursive Path Ordering
Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higher-order case thus creating the higher-order recursive path ordering (HORPO) [8]. They proved that this ordering can be used for proving termination of higher-order TRSs wh...
متن کاملWell-Founded Recursive Relations
We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting à la Ferreira-Zantema and a wellfounded relation .. This construction generalizes several variants of the recursive path ordering on terms and of the Knuth-Bendix ordering. It also applies to other domains, of graphs, of infinite terms, of word and tree automata notably. We then exte...
متن کاملA Constructive Proof of the Topological Kruskal Theorem
We give a constructive proof of Kruskal’s Tree Theorem— precisely, of a topological extension of it. The proof is in the style of a constructive proof of Higman’s Lemma due to Murthy and Russell (1990), and illuminates the role of regular expressions there. In the process, we discover an extension of Dershowitz’ recursive path ordering to a form of cyclic terms which we call μ-terms. This all c...
متن کامل(HO)RPO Revisited
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present paper, we study in more details the relations between the computability closure and the (higher-order) recursive path ordering. We show that the first-order ...
متن کاملRecursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering =B. It can be used for incremental (innermost) termination proofs of hierarchical unions by defining =B as an extension of the termination proof obtained fo...
متن کامل