Higher Order Dependency Pairs for Algebraic Functional Systems

We extend the termination method using dynamic dependency pairs to higher order rewriting systems with beta as a rewrite step, also called Algebraic Functional Systems (AFSs). We introduce a variation of usable rules, and use monotone algebras to solve the constraints generated by dependency pairs. This approach differs in several respects from those dealing with higher order rewriting modulo beta (e.g. HRSs).

[1]  Jürgen Giesl,et al.  The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs , 2005, LPAR.

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

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

[4]  Keiichirou Kusakari,et al.  Argument filterings and usable rules in higher-order rewrite systems , 2011, ArXiv.

[5]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[6]  Nao Hirokawa,et al.  Uncurrying for Termination , 2008, LPAR.

[7]  J. C. van dePol.  Termination of higher-order rewrite systems , 1996 .

[8]  Masahiko Sakai,et al.  Enhancing dependency pair method using strong computability in simply-typed term rewriting , 2007, Applicable Algebra in Engineering, Communication and Computing.

[9]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[10]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[11]  Masahiko Sakai,et al.  Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques , 2009, IEICE Trans. Inf. Syst..

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

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

[14]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[15]  Albert Rubio,et al.  The Computability Path Ordering: The End of a Quest , 2008, CSL.

[16]  Kusakari Keiichirou.  On Proving Termination of Term Rewriting Systems with Higher - Order Variables , 2001 .

[17]  Nao Hirokawa,et al.  Automating the Dependency Pair Method , 2005, CADE.

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

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

[20]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[21]  Albert Rubio,et al.  The higher-order recursive path ordering , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[22]  Jean-Pierre Jouannaud,et al.  A computation model for executable higher-order algebraic specification languages , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[23]  Cynthia Kop,et al.  Higher Order Dependency Pairs With Argument Filterings , 2010 .