Journal of the ACM (JACM)
Introduction to Constraint Logic Programming
Introduction to Constraint Logic Programming
Solving Combinatorial Problems with a Constraint Functional Logic Language
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Declarative Diagnosis in the CLP Scheme
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
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 proof theoretic approach to failure in functional logic programming
Theory and Practice of Logic Programming
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic 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)
Declarative constraint programming with definitional trees
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
Declarative diagnosis of missing answers in constraint functional-logic programming
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
| Hi-index | 0.00 |
This paper proposes the integration of finite domain (FD) constraints into a general purpose lazy functional logic programming language by means of a concrete instance of the generic scheme CFLP(D), proposed in [19] for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. We sketch in this CFLP(FD) language the basis of an efficient computation strategy for solving goals for programs by using definitional trees [1] in order to efficiently control the computation and maintain the good properties shown for needed and demand-driven narrowing strategies [4, 15, 25] in functional logic programming. This convenient computation mechanism is obtained as an optimization of the generic Constrained Lazy Narrowing Calculus CLNC(D) presented in [20], which has been proved sound and strongly complete w.r.t. a suitable CFLP(D) semantics, and provides a formal foundation for efficient implementations in existing systems such as Curry [11] and TOY [17]. Finally, we describe the execution of an example implemented in the CFLP(FD) system called TOY(FD) [9], which is based on the theoretical ideas introduced in this paper, following our computation strategy.