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
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Proceedings of the Third International Conference on Algebraic and Logic Programming
A General Scheme for Constraint Functional Logic Programming
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
Constructor-based conditional narrowing
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative 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
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
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
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 Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Qualified Computations in Functional Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
A Logical Framework for Debugging in Declarative Constraint Programming
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
Declarative diagnosis of missing answers in constraint functional-logic programming
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Declarative diagnosis of wrong answers in constraint functional-logic programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Hi-index | 0.00 |
The new generic scheme CFLP($\mathcal{D}$) has been recently proposed in [14] as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain $\mathcal{D}$. Further, [15] presented a Constrained Lazy Narrowing Calculus $CLNC(\mathcal{D})$ as a convenient computation mechanism for solving goals for CFLP($\mathcal{D}$)-programs, which was proved sound and strongly complete with respect to CFLP($\mathcal{D}$)'s semantics. Now, in order to provide a formal foundation for an efficient implementation of goal solving methods in existing systems such as Curry [8] and $\mathcal{TOY}$ [13,6], this paper enriches the CFLP($\mathcal{D}$) framework by presenting an optimization of the CLNC($\mathcal{D}$) calculus by means of definitional trees to efficiently control the computation. We prove that this new Constrained Demanded Narrowing Calculus CDNC($\mathcal({D}$) preserves the soundness and completeness properties of CLNC($\mathcal{D}$) and maintains the good properties shown for needed and demand-driven narrowing strategies [4,11,17].