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.
This work has been also supported in part by JSPS Grant-in-Aid for Scientific Research (B) 12480066, 2000–2002, and (C) 13680388, 2001–2002. Mircea Marin has been supported by JSPS postdoc fellowship 00096, 2000–2001.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
G. Boudol. Computational Semantics of Term Rewriting Systems. Technical report, INRIA, February 1983.
M. Fay. First-Order Unification in Equational Theories. In Proceedings of the 4th Conference on Automated Deduction, pages 161–167, 1979.
G. Huet and J.-J. Lévy. Computations in Orthogonal Rewriting Systems, I and II. In Computational Logic, Essays in Honor of Alan Robinson, pages 396–443. The MIT Press, 1992.
J.-M. Hullot. Canonical Forms and Unification. In Proceedings of the 5th Conference on Automated Deduction, volume 87 of LNCS, pages 318–334. Springer, 1980.
T. Ida and K. Nakahara. Leftmost Outside-in Narrowing Calculi. Journal of Functional Programming, 7(2):129–161, 1997.
M. Marin, T. Ida, and T. Suzuki. Cooperative constraint functional logic programming. In T. Katayama, T. Tamai, and N. Yonezaki, editors, International Symposium on Principles of Software Evolution (ISPSE 2000), Kanazawa, Japan, November 1–2, 2000. IEEE Computer Society.
A. Middeldorpand S. Okui. A Deterministic Lazy Narrowing Calculus. Journal of Symbolic Computation, 25(6):733–757, 1998.
A. Middeldorp, S. Okui, and T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theoretical Computer Science, 167(1,2):95–130, 1996.
M. Marin, T. Suzuki, and T. Ida. Refinements of lazy narrowing for leftlinear fully-extended pattern rewrite systems. Technical Report ISE-TR-01-180, Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, Japan, to appear, 2001.
C. Prehofer. Solving Higher-Order Equations. From Logic to Programming. Foundations of Computing. Birkhäuser Boston, 1998.
W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations. Journal of Symbolic Computation, 8:101–140, 1989.
T. Suzuki. Standardization Theorem Revisited. In Proceedings of 5th International Conference, ALP’96, volume 1139 of LNCS, pages 122–134, 1996.
V. van Oostrom. Personal communication, August 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ida, T., Marin, M., Suzuki, T. (2002). Reducing Search Space in Solving Higher-Order Equations. In: Arikawa, S., Shinohara, A. (eds) Progress in Discovery Science. Lecture Notes in Computer Science(), vol 2281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45884-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-45884-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43338-5
Online ISBN: 978-3-540-45884-5
eBook Packages: Springer Book Archive