Reducing Search Space in Solving Higher-Order Equations

Authors:
Tetsuo Ida;Mircea Marin;Taro Suzuki
Affiliations:
-;-;-
Venue:
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Year:
2002

Citing 8
Cited 0

Higher-order unification revisited: Complete sets of transformations

Journal of Symbolic Computation
Lazy narrowing: strong completeness and eager variable elimination

TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Term rewriting and all that

Term rewriting and all that
A deterministic lazy narrowing calculus

Journal of Symbolic Computation
Solving Higher-Order Equations: From Logic to Programming

Solving Higher-Order Equations: From Logic to Programming
Standardization Theorem Revisited

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
Leftmost outside-in narrowing calculi

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.