A demand-driven narrowing calculus with overlapping definitional trees

Authors:
Rafael del Vado Vírseda
Affiliations:
Universidad Complutense de Madrid, Madrid, Spain
Venue:
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Year:
2003

Citing 11
Cited 14

Nondeterministic algebraic specifications and nonconfluent term rewriting

Journal of Logic Programming
Call by need computations to root-stable form

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that

Term rewriting and all that
A deterministic lazy narrowing calculus

Journal of Symbolic Computation
Strongly sequential and inductively sequential term rewriting systems

Information Processing Letters
A needed narrowing strategy

Journal of the ACM (JACM)
A Demand Driven Computation Strategy for Lazy Narrowing

PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Higher-order narrowing with definitional trees

Journal of Functional Programming
Leftmost outside-in narrowing calculi

Journal of Functional Programming

A lazy narrowing calculus for declarative constraint programming

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Designing an efficient computation strategy in CFLP(FD) using definitional trees

Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
A new generic scheme for functional logic programming with constraints

Higher-Order and Symbolic Computation
A Framework for Interpreting Traces of Functional Logic Computations

Electronic Notes in Theoretical Computer Science (ENTCS)
A simple rewrite notion for call-time choice semantics

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint functional logic programming over finite domains

Theory and Practice of Logic Programming
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics

Applications of Declarative Programming and Knowledge Management
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
Constraint Functional Logic Programming Revisited

Electronic Notes in Theoretical Computer Science (ENTCS)
A higher-order demand-driven narrowing calculus with definitional trees

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Multi-paradigm declarative languages

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Declarative constraint programming with definitional trees

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
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 propose a demand-driven conditional narrowing calculus in which a variant of definitional trees [2] is used to efficiently control the narrowing strategy. This calculus is sound and strongly complete w.r.t. Constructor-based ReWriting Logic (CRWL) semantics [7] for a wide class of constructor-based conditional term rewriting systems. The calculus mantains the optimality properties of the needed narrowing strategy [5]. Moreover, the treatment of strict equality as a primitive rather than a defined function symbol, leads to an improved behaviour w.r.t. needed narrowing.