Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blanqui, F. (HO)RPO revisited. Research Report 5972, INRIA (2006)
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)
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)
Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM 54(1), 1–48 (2007)
Walukiewicz-Chrzaszcz, D.: Termination of rewriting in the Calculus of Constructions. In: Proceedings of the Workshop on Logical Frameworks and Meta-languages (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blanqui, F., Jouannaud, JP., Rubio, A. (2007). HORPO with Computability Closure: A Reconstruction. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-75560-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75558-6
Online ISBN: 978-3-540-75560-9
eBook Packages: Computer ScienceComputer Science (R0)