HORPO with Computability Closure : A Reconstruction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

HORPO with Computability Closure : A Reconstruction


This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability clo- sure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.
Fichier principal
Vignette du fichier
main.pdf (196.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00168304 , version 1 (27-08-2007)


  • HAL Id : inria-00168304 , version 1
  • ARXIV : 0708.3582


Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio. HORPO with Computability Closure : A Reconstruction. 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Oct 2007, Yerevan, Armenia. ⟨inria-00168304⟩
125 View
189 Download



Gmail Facebook Twitter LinkedIn More