论文信息 - A Reduction Ordering for Higher-Order Terms

A Reduction Ordering for Higher-Order Terms

We investigate one of the classical problems of the theory ofterm rewriting, namely termination. We present an ordering for compar-ing higher-order terms that can be utilized for testing termination anddecreasingness of higher-order conditional term rewriting systems. Theordering relies on a first-order interpretation of higher-order terms anda suitable extension of the RPO.

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

[2] Joachim Steinbach. Termination of rewriting - extensions, comparison and automatic generation of simplification orderings , 1994 .

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

[4] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[5] Carlos Loría-Sáenz,et al. A theoretical framework for reasoning about program construction based on extensions of rewrite systems , 1993 .

[6] Jürgen Avenhaus,et al. Higher Order Conditional Rewriting and Narrowing , 1994, CCL.

[7] Nachum Dershowitz,et al. Topics in Termination , 1993, RTA.

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

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

[10] Nachum Dershowitz,et al. A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..