Logic programming: functions, relations, and equations
Logic programming: functions, relations, and equations
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Term rewriting and all that
Solving Combinatorial Problems with a Constraint Functional Logic Language
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Combining Layz Narrowing with Disequality Constraints
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
A General Scheme for Constraint Functional Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Functional Plus Logic Programming with Built-In and Symbolic Constraints
PPDP '99 Proceedings of the International Conference PPDP'99 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
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
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Adding constraints to curry via flat guards
Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic 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 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
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international 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
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on 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
Declarative constraint programming with definitional trees
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Improving the performance of FD constraint solving in a CFLP system
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Extending the TOY system with the ECLiPSe solver over sets of integers
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
The new generic scheme CFLP (D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given constraint domain D. In this paper we extend such framework with a suitable operational semantics, which relies on a new constrained lazy narrowing calculus for goal solving parameterized by a constraint solver over the given domain D. This new calculus is sound and strongly complete w.r.t. the declarative semantics of CFLP (D)programs, which was formalized in [24] by means of a Constraint Rewriting Logic CRWL (D).