论文信息 - Higher Order Dependency Pairs With Argument Filterings - 字舞流文

Higher Order Dependency Pairs With Argument Filterings

We present a termination method for left-linear Higher-order Rewrite Systems (HRSs) that are algebraic using a higher-order generalization of dependency pairs with argument filterings.

Cynthia Kop | F. van Raamsdonk

[1] Takahito Aoto,et al. Dependency Pairs for Simply Typed Term Rewriting , 2005, RTA.

[2] Masahiko Sakai,et al. Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems , 2009, IEICE Trans. Inf. Syst..

[3] Takahito Aoto,et al. Argument Filterings and Usable Rules for Simply Typed Dependency Pairs , 2009, FroCoS.

[4] Jürgen Giesl,et al. Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[5] Masahiko Sakai,et al. On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems , 2001, IEICE Trans. Inf. Syst..

[6] Masahiko Sakai,et al. An Extension of the Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems , 2001 .