@article{oai:nagoya.repo.nii.ac.jp:00019000,
 author = {鈴木, 翔 and 草刈, 圭一朗 and 坂部, 俊樹 and 酒井, 正彦 and 西田, 直樹 and SUZUKI, Sho and KUSAKARI, Keiichirou and SAKABE, Toshiki and SAKAI, Masahiro and NISHIDA, Naoki},
 issue = {343},
 journal = {電子情報通信学会技術研究報告SS, ソフトウェアサイエンス},
 month = {Dec},
 note = {項書換え系(TRS)の拡張として高階関数を直接扱える単純型付き項書換え系(STRS)やさらにλ抽象も扱える高階書換え系(HRS)が提案されている.静的依存対法はこれら高階の系における非常に強力な停止性証明法である.静的依存対法で停止性を証明する際には引数切り落とし法や実効規則の概念が重要となる.これらはTRS上で提案されSTRS上に拡張されているが, HRS上では知られていない.本論文ではHRS上の引数切り落とし法と実効規則の概念を与える.さらに我々の成果は単なる拡張ではなく,引数切り落とし法で要求されていた適用条件を取り除き,実効規則の定義から高階変数を介した依存性を取り除くという改良も伴っている., Simply-typed term rewriting systems (STRSs) and higher-order rewrite systems (HRSs) have been proposed to extend term rewriting systems (TRSs). These systems can handle higher-order functions directly, and moreover HRSs are allowed to have a A-abstraction syntax. Static dependency pair methods are very powerful methods for proving termination of these higher-order systems. Notions of argument filtering and usable rules play important roles in proving termination by the static dependency pair method. These notions are proposed on TRSs, and extended to STRSs. However, we have not known these notions on HRSs. In this paper, we extend notions of argument filtering and usable rules onto HRSs. In addition, these extensions include some enhancements : removing an applicable condition demanded by existing argument filtering methods on STRSs, and removing a dependency through higher-order variables from the definition of usable rule.},
 pages = {25--30},
 title = {高階書換え系における引数切り落とし法と実効規則},
 volume = {109},
 year = {2009}
}