@article{oai:nagoya.repo.nii.ac.jp:00007858,
 author = {SAKAI, Masahiko and WATANABE, Yoshitsugu and SAKABE, Toshiki},
 issue = {8},
 journal = {IEICE Transactions on Information and Systems},
 month = {Aug},
 note = {This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. We show that the termination property of higher-order rewrite systems can be checked by the non-exsistence of an infinite R-chain, which is an extension of Arts' and Giesl's result for the first-order case. It is clarified that the subterm property of the quasi-ordering, used for proving termination automatically, is indispensable.},
 pages = {1025--1032},
 title = {An Extension of the Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems},
 volume = {E84-D},
 year = {2001}
}