On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems

Abstract

This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. In the first order case, the termination of term rewriting systems are proved by showing the non-existence of an infinite R-chain of the dependency pairs. However, the termination and the non-existence of an infinite R-chain do not… (More)

Topics

6 Figures and Tables

Cite this paper

@article{Sakai2005OnDP, title={On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems}, author={Masahiko Sakai and Keiichirou Kusakari}, journal={IEICE Transactions}, year={2005}, volume={88-D}, pages={583-593} }