Abstract
We discuss the termination methods using the higher-order recursive path ordering and the general scheme for higher-order rewriting systems and combinatory reduction systems.
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
F. Barbanera, M. Fernández, and H. Geuvers. Modularity of strong normalization in the algebraic lambda-cube. Jounal of Functional Programming, 7(6):613–660, 1997. An earlier version appears in the Proceedings of LICS’ 94.
F. Blanqui. Termination and con uence of higher-order rewrite systems. In L. Bachmair, editor, Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA’ 99), number 1833 in LNCS, pages 47–62, Norwich, UK, July 2000. Springer Verlag.
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
J.-P. Jouannaud and M. Okada. A computation model for executable higher-order algebraic specification languages. In Proceedings of the 6th annual IEEE Symposium on Logic in Computer Science (LICS’ 91), pages 350–361, Amsterdam, The Netherlands, July 1991.
J.-P. Jouannaud and A. Rubio. A recursive path ordering for higher-order terms in η-long β-normal form. In H. Gantzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA’ 96), number 1103 in LNCS, pages 108–122, New Brunswick, USA, July 1996. Springer Verlag.
J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In Proceedings of the 14th annual IEEE Symposium on Logic in Computer Science (LICS’ 99), pages 402–411, Trento, Italy, July 1999.
J.-P. Jouannaud and A. Rubio. Higher-order recursive path orderings à la carte. http://www.lri.fr/~jouannau/biblio.html, 2000.
J.W. Klop. Combinatory Reduction Systems. Number 127 in Mathematical Centre Tracts. CWI, Amsterdam, The Netherlands, 1980. PhD Thesis.
J.W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory Reduction Systems: introduction and survey. Theoretical Computer Science, 121:279–308, 1993. Special issue in honour of Corrado Böhm.
C. Loria-Saenz and J. Steinbach. Termination of combined (rewrite and lambda-calculus) systems. In M. Rusinowitch and J.-L. Rémy, editors, Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems (CTRS’92), number 656 in LNCS, pages 143–147, Pont-à -Mousson, France, April 1993. Springer Verlag.
O. Lysne and J. Piris. A termination ordering for higher order rewrite systems. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA’ 95), number 914 in LNCS, pages 26–40, Kaiserslautern, Germany, April 1995. Springer Verlag.
R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192:3–29, 1998.
D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.
T. Nipkow. Higher-order critical pairs. In Proceedings of the 6th annual IEEE Symposium on Logic in Computer Science (LICS’ 91), pages 342–349, Amsterdam, The Netherlands, July 1991.
V. van Oostrom. Higher-order families. In H. Gantzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA’ 96), number 1103 in LNCS, pages 392–407, New Brunswick, USA, July 1996. Springer Verlag.
J.C. van de Pol. Termination of higher-order rewrite systems. PhD thesis, Utrecht University, Utrecht, The Netherlands, December 1996.
F. van Raamsdonk. Higher-order rewriting. In P. Narendran and M. Rusinowitch, editors, Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA’ 99), number 1631 in LNCS, pages 220–239, Trento, Italy, July 1999. Springer Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Raamsdonk, F. (2001). On Termination of Higher-Order Rewriting. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive