HORPO with Computability Closure: A Reconstruction

  • Frédéric Blanqui
  • Jean-Pierre Jouannaud
  • Albert Rubio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4790)


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 closure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blanqui, F. (HO)RPO revisited. Research Report 5972, INRIA (2006)Google Scholar
  2. 2.
    Blanqui, F., Jouannaud, J.-P., Rubio, A.: Higher order termination: from Kruskal to computability. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  4. 4.
    Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM 54(1), 1–48 (2007)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Walukiewicz-Chrzaszcz, D.: Termination of rewriting in the Calculus of Constructions. In: Proceedings of the Workshop on Logical Frameworks and Meta-languages (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Frédéric Blanqui
    • 1
  • Jean-Pierre Jouannaud
    • 2
  • Albert Rubio
    • 3
  1. 1.INRIA & LORIA, Protheo team, Campus Scientifique, BP 239, 54506 Vandœuvre-lès-Nancy CedexFrance
  2. 2.LIX, École Polytechnique, 91400 PalaiseauFrance
  3. 3.Technical University of Catalonia, Pau Gargallo 5, 08028 BarcelonaSpain

Personalised recommendations