Normal Higher-Order Termination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2013

Normal Higher-Order Termination


We extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching. We accommodate, on the one hand, a weakly polymorphic, algebraic extension of Church's simply typed λ-calculus, and on the other hand, any use of eta, as a reduction, as an expansion or as an equation. The user's rules may be of any type in this type system, either a base, functional, or weakly polymorphic type.
Fichier principal
Vignette du fichier
acmsubmission-final.pdf (489.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01239068 , version 1 (07-12-2015)



Jean-Pierre Jouannaud, Albert Rubio. Normal Higher-Order Termination. ACM Transactions on Computational Logic, 2013, ⟨10.1145/26999.13⟩. ⟨hal-01239068⟩
80 View
73 Download



Gmail Facebook Twitter LinkedIn More