On Termination of Higher-Order Rewriting

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.

[1]  Stefan Kahrs,et al.  Towards a Domain Theory for Termination Proofs , 1995, RTA.

[2]  Femke van Raamsdonk,et al.  Higher-Order Rewriting , 1999, RTA.

[3]  J. C. van dePol.  Termination of higher-order rewrite systems , 1996 .

[4]  Joachim Steinbach,et al.  Termination of Combined (Rewrite and lambda-Calculus) Systems , 1992, CTRS.

[5]  Olav Lysne,et al.  A Termination Ordering for Higher Order Rewrite System , 1995, RTA.

[6]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[7]  Vincent van Oostrom,et al.  Higher-Order Families , 1996, RTA.

[8]  Albert Rubio,et al.  A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form , 1996, RTA.

[9]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[11]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[12]  J. V. D. Pol,et al.  Termination of higher-order rewrite systems , 1996 .

[13]  Herman Geuvers,et al.  Modularity of Strong Normalization in the Algebraic-lambda-Cube , 1997, J. Funct. Program..

[14]  Frédéric Blanqui,et al.  Termination and Confluence of Higher-Order Rewrite Systems , 2000, RTA.

[15]  Tobias Nipkow,et al.  Higher-Order Rewrite Systems and Their Confluence , 1998, Theor. Comput. Sci..

[16]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[17]  Herman Geuvers,et al.  Modularity of strong normalization in the algebraic-λ-cube , 1997, Journal of Functional Programming.

[18]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[19]  Albert Rubio,et al.  The higher-order recursive path ordering , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[20]  Albert Rubiozy.  A Recursive Path Ordering for Higher-order Terms in -long -normal Form ? , 1996 .

[21]  Jean-Pierre Jouannaud,et al.  A computation model for executable higher-order algebraic specification languages , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[22]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[23]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..