Abstract
We extend the termination proof methods based on reduction orderings to higher-order rewriting systems à la Nipkow using higher-order pattern matching for firing rules, and accommodate for any use of eta, as a reduction, as an expansion or as an equation. As a main novelty, we provide with a mechanism for transforming any reduction ordering including beta-reduction, such as the higher-order recursive path ordering, into a reduction ordering for proving termination of rewriting à la Nipkow. Non-trivial examples are carried out.
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., Jouannaud, J.-P., Okada, M.: The Calculus of Algebraic Constructions. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, p. 301. Springer, Heidelberg (1999)
Blanqui, F.: Termination and Confluence of Higher-Order Rewriting Systems. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833. Springer, Heidelberg (2000)
Blanqui, F., Jouannaud, J.-P., Okada, M.: Inductive Data Type Systems. Theoretical Computer Science 272(1-2), 41–68 (2002)
Barendregt, H.: Functional Programming and Lambda Calculus. In: [22], pp. 321–364.
Barendregt, H.: Typed lambda calculi. In: Abramsky, et al. (eds.) Handbook of Logic in Computer Science. Oxford University Press, Oxford (1993)
van de Pol, J.: Termination of Higher-Order Rewrite Systems. PhD thesis, Department of Philosophy, Utrecht University (1996)
Dershowitz, N.: Orderings for term rewriting systems. Theoretical Computer Science 17(3), 279–301 (1982)
van de Pol, J., Schwichtenberg, H.: Strict functional for termination proofs. In: Typed Lambda Calculi and Applications, Edinburgh. Springer, Heidelberg (1995)
Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: [22], pp. 321–364
Jouannaud, J.-P.: Higher-Order rewriting: Framework, Confluence and termination. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 224–250. Springer, Heidelberg (2005)
Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: Longo, G. (ed.) Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy. IEEE Comp. Soc. Press, Los Alamitos (1999)
Jouannaud, J.-P., Rubio, A.: Polymorphic Higher-Order Recursive Path Orderings (2005) (Submitted to JACM), http://www.lix.polytechnique.fr/Labo/Jean-Pierre.Jouannaud
Jouannaud, J.-P., Rubio, A.: Higher-Order Orderings for Normal Rewriting (2005) Full version, http://www.lix.polytechnique.fr/Labo/Jean-Pierre.Jouannaud
Jouannaud, J.-P., Rubio, A.: Higher-Order Recursive Path Orderings à la carte (2001), http://www.lix.polytechnique.fr/Labo/Jean-Pierre.Jouannaud
Jouannaud, J.-P., van Raamsdonk, F., Rubio, A.: Higher-order rewriting with types and arities (2005), http://www.lix.polytechnique.fr/Labo/Jean-Pierre.Jouannaud
Klop, J.W.: Combinatory Reduction Relations. In: Mathematical Centre Tracts, vol. 127. Mathematisch Centrum, Amsterdam (1980)
Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 2–116. Oxford University Press, Oxford (1992)
Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Computer Science 192(1), 3–29 (1998)
Miller, D.: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. Journal and Logic and Computation 1(4), 497–536 (1991)
Nipkow, T.: Higher-order critical pairs. In: 6th IEEE Symp. on Logic in Computer Science, pp. 342–349. IEEE Computer Society Press, Los Alamitos (1991)
Paulson, L.C.: Isabelle: the next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science. Academic Press, London (1990)
van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol. B. North-Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jouannaud, JP., Rubio, A. (2006). Higher-Order Orderings for Normal Rewriting. In: Pfenning, F. (eds) Term Rewriting and Applications. RTA 2006. Lecture Notes in Computer Science, vol 4098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11805618_29
Download citation
DOI: https://doi.org/10.1007/11805618_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36834-2
Online ISBN: 978-3-540-36835-9
eBook Packages: Computer ScienceComputer Science (R0)