@article{oai:ipsj.ixsq.nii.ac.jp:00073760,
 author = {Sho, Suzuki and Keiichirou, Kusakari and Frederic, Blanqui and Sho, Suzuki and Keiichirou, Kusakari and Frederic, Blanqui},
 issue = {2},
 journal = {情報処理学会論文誌プログラミング（PRO）},
 month = {Mar},
 note = {The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed λ-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filterings and usable rules to higher-order rewriting, hence providing the basis for a powerful automated termination prover for higher-order rewrite systems., The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed λ-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filterings and usable rules to higher-order rewriting, hence providing the basis for a powerful automated termination prover for higher-order rewrite systems.},
 pages = {1--12},
 title = {Argument Filterings and Usable Rules in Higher-order Rewrite Systems},
 volume = {4},
 year = {2011}
}