Simplifying Algebraic Functional Systems

A popular formalism of higher order rewriting, especially in the light of termination research, are the Algebraic Functional Systems (AFSs) defined by Jouannaud and Okada. However, the formalism is very permissive, which makes it hard to obtain results; consequently, techniques are often restricted to a subclass. In this paper we study termination-preserving transformations to make AFS-programs adhere to a number of standard properties. This makes it significantly easier to obtain general termination results.

[1]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[2]  Stefan Kahrs.  Confluence of Curried Term-Rewriting Systems , 1995, J. Symb. Comput..

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

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

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

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

[7]  Jan Willem Klop,et al.  Comparing Curried and Uncurried Rewriting , 1993, J. Symb. Comput..

[8]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

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

[10]  Cynthia Kop,et al.  Higher Order Dependency Pairs for Algebraic Functional Systems , 2011, RTA.

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

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

[13]  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.