Polymorphic higher-order recursive path orderings

@article{Jouannaud2007PolymorphicHR,
  title={Polymorphic higher-order recursive path orderings},
  author={Jean-Pierre Jouannaud and Albert Rubio},
  journal={J. ACM},
  year={2007},
  volume={54},
  pages={2:1-2:48}
}
This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. These relations can be generated from two given well-founded orderings, on the function symbols and on the type constructors. The obtained orderings on terms are well founded, monotonic, stable under substitution and include… 

Figures from this paper

Coq formalization of the higher-order recursive path ordering
  • A. Koprowski
  • Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2009
TLDR
This paper describes the undertaking of providing a complete, axiom-free, fully constructive formalization of results in the proof assistant Coq of the higher-order recursive path ordering, HORPO with a proof of its well-foundedness.
The computability path ordering
TLDR
The computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols, is introduced and the well-foundedness proof shows that core CPO captures the essence of computability arguments ^#224, la Tait and Girard, therefore explaining its name.
Normal Higher-Order Termination
TLDR
The termination proof methods based on reduction orderings are extended to higher-order rewriting systems based on higher- order pattern matching and a weakly polymorphic, algebraic extension of Church’s simply typed λ-calculus is accommodated.
Higher-Order Orderings for Normal Rewriting
TLDR
The termination proof methods based on reduction orderings are extended to higher-order rewriting systems a la Nipkow using higher- order pattern matching for firing rules, and any use of eta, as a reduction, as an expansion or as an equation is accommodate.
A Formalization of the Simply Typed Lambda Calculus in Coq
TLDR
A formalization of the simply typed lambda calculus with constants and with typing à la Church using the theorem prover Coq is presented, among other results, definitions of typed terms over arbitrary many-sorted signature, an equivalence relation generalizing the concept of α-convertibility to free variables and a proof of strong normalization of β-reduction.
The recursive path and polynomial ordering for first-order and higher-order terms
TLDR
A simple ordering is presented that combines both RPO and POLO and defines a family of orderings that includes both and is extended to higher-order terms, providing a new fully automatable use of polynomial interpretations in combination with beta-reduction.
12 : 2 Polymorphic Higher-Order Termination
TLDR
This work generalises the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism and eases the applicability of the method in the non-polymorphic setting by allowing for the encoding of inductive data types.
Polymorphic Higher-order Termination
TLDR
This work generalises the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism and eases the applicability of the method in the non-polymorphic setting by allowing for the encoding of inductive data types.
Graph Path Orderings
TLDR
The graph path ordering inspired by the recursive path ordering on terms is introduced and it is shown that it is a well-founded rewrite ordering on graphs for which checking termination of a finite set of graph rewrite rules is decidable.
The recursive path and polynomial ordering∗
TLDR
This work presents a simple ordering that combines both RPO and POLO and defines a family of orderings that includes both, and extends them with the possibility of having, at the same time, an RPO-like treatment for some symbols and a POLO- like treatment for the others.
...
...

References

SHOWING 1-10 OF 94 REFERENCES
The higher-order recursive path ordering
  • J. Jouannaud, A. Rubio
  • Mathematics
    Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
  • 1999
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus
A Monotonic Higher-Order Semantic Path Ordering
TLDR
The first monotonic higher-order semantic path ordering (MHOSPO) is defined, a simple and easily automatable ordering which generalizes other more ad-hoc methods like MSPO and gives evidence of its power by means of several natural and non-trivial examples which cannot be handled by HORPO.
A computation model for executable higher-order algebraic specification languages
  • J. Jouannaud, M. Okada
  • Computer Science, Mathematics
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
TLDR
A general modularity result, which allows as particular cases primitive recursive functionals of higher types, transfinite recursion of highertypes, and inheritance for all types, is proved.
Termination Proofs for Higher-order Rewrite Systems
TLDR
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [12], which combines the computational aspects of term rewriting and simply typed lambda calculus and produces a proof technique similar to the proof technique for the termination of a well-founded monotone algebra.
Higher-Order Orderings for Normal Rewriting
TLDR
The termination proof methods based on reduction orderings are extended to higher-order rewriting systems a la Nipkow using higher- order pattern matching for firing rules, and any use of eta, as a reduction, as an expansion or as an equation is accommodate.
Termination of rewriting in the Calculus of Constructions
TLDR
The criterion is general enough to accept definitions by rewriting of many well-known higher order functions, for example dependent recursors for inductive types or proof carrying functions, and makes it a very good candidate for inclusion in a proof assistant based on the Curry-Howard isomorphism.
Higher-order critical pairs
  • T. Nipkow
  • Computer Science
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
TLDR
The notion of critical pair is generalized to higher-order rewrite systems, and the analog of the critical pair lemma is proved.
Well-Founded Recursive Relations
We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting ≫ a la Ferreira-Zantema and a well-founded relation ▹. This construction generalizes
Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering
Higher-order rewriting with types and arities
Background. Higher-order rewrite rules are increasingly used in programming languages and logical systems, with three main goals: to set up a general infrastructure for computations, to describe
...
...