Rewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering

doi:10.1016/S0304-3975(98)00078-4

Theoretical Computer Science

Volume 208, Issues 1–2, 28 November 1998, Pages 33-58

https://doi.org/10.1016/S0304-3975(98)00078-4 Get rights and content

Under an Elsevier user license

open archive

Abstract

This paper extends the termination proof techniques based on rewrite orderings to a higher-order setting, by defining a recursive path ordering for simply typed higher-order terms in η-long β-normal form. This ordering is powerful enough to show termination of several complex examples.

Keywords

Higher-order rewriting

Typed lambda calculus

Termination orderings

Cited by (0)

^☆: This work was partly supported by the ESPRIT Basic Research Action CCL and the EU Human Capital and Mobility Network Console. A preliminary version is published in the Proceedings of the 7th International Conference on Rewriting Techniques and Applications, Lecture Notes In Computer Science, vol. 1103, Springer, Berlin.

²: This work results from a stay of the author at the Technical University of Catalonia.

Theoretical Computer Science

ContributionRewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering☆

Abstract

Keywords

Contribution
Rewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering☆