Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations

Authors:
Tetsuo Ida;Mircea Marin;Taro Suzuki
Affiliations:
-;-;-
Venue:
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Year:
2001

Citing 5
Cited 0

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
A deterministic lazy narrowing calculus

Journal of Symbolic Computation
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an extension and refinement of Prehofer's higher-order narrowing calculus LN using the techniques developed in the refinement of a first-order lazy narrowing calculus LNC. HOLN is defined to deal with both unoriented and oriented equations. It keeps track of the variables which are to be bound to normalized answers. We discuss the operating principle of HOLN, its main properties, i.e. soundness and completeness, and its further refinements. The solving capability of HOLN is illustrated with an example of program calculation.