A higher-order demand-driven narrowing calculus with definitional trees

Authors:
Rafael Del Vado Vírseda
Affiliations:
Dpto. de Sistemas Informáticos y Computación, Universidad Complutense de Madrid
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 5
Cited 6

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
A demand-driven narrowing calculus with overlapping definitional trees

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Higher-order narrowing with definitional trees

Journal of Functional Programming
Declarative constraint programming with definitional trees

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

A higher-order logical framework for the algorithmic debugging and verification of declarative programs

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp

Theory and Practice of Logic Programming
Cooperation of algebraic constraint domains in higher-order functional and logic programming

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains

Electronic Notes in Theoretical Computer Science (ENTCS)
A modular semantics for higher-order declarative programming with constraints

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
A theoretical framework for the declarative debugging of functional logic programs with lambda abstractions

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize the Constructor-based ReWriting Logic CRWL to the setting of the simply typed ?-calculus, where theories are presented by conditional overlapping fully extended pattern rewrite systems. We claim that this logic is useful for higher-order functional-logic programming, and propose a Higher-Order Lazy Narrowing calculus HOLNDT for answering joinability and reducibility queries, in which a variant of Definitional Trees is used to efficiently control the demand-driven narrowing strategy. The calculus HOLNDT is shown to be sound and strongly complete with respect to this higher-order conditional rewriting logic.