Reducing Search Space in Solving Higher-Order Equations

We describe the results of our investigation of equational problem solving in higher-order setting. The main problem is identified to be that of reducing the search space of higher-order lazy narrowing calculi, namely how to reduce the search space without losing the completeness of the calculi. We present a higher-order calculus HOLN0 as a system of inference rules and discuss various refinements that enable the reduction of the search space by eliminating some sources of nondeterminism inherent in the calculus.

[1]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[2]  Jozef Gruska.  Foundations of Computing , 1997 .

[3]  Aart Middeldorp,et al.  A Deterministic Lazy Narrowing Calculus , 1998, J. Symb. Comput..

[4]  Tetsuo Ida,et al.  Lazy Narrowing: Strong Completeness and Eager Variable Elimination , 1996, Theor. Comput. Sci..

[5]  Wayne Snyder,et al.  Higher-Order Unification Revisited: Complete Sets of Transformations , 1989, J. Symb. Comput..

[6]  G Boudol.  Computational semantics of term rewriting systems , 1986 .

[7]  G. Boudol.  Computational semantics of terms rewriting systems , 1983 .

[8]  Tetsuo Ida,et al.  Leftmost outside-in narrowing calculi , 1997, Journal of Functional Programming.

[9]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[10]  筑波大学電子・情報工学系,et al.  Refinements of lazy narrowing for left-linear fully-extended pattern rewrite systems , 2001 .

[11]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[12]  Christian Prehofer,et al.  Solving higher order equations: from logic to programming , 2012 .

[13]  Taro Suzuki.  Standardization Theorem Revisited , 1996, ALP.

[14]  Tetsuo Ida,et al.  Cooperative constraint functional logic programming , 2000, Proceedings International Symposium on Principles of Software Evolution.

[15]  Christian Prehofer,et al.  Solving Higher-Order Equations , 1998, Progress in Theoretical Computer Science.