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
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A rationale for conditional equational programming
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Nondeterministic algebraic specifications and nonconfluent term rewriting
Journal of Logic Programming
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
Nondeterminism in algebraic specifications and algebraic programs
Nondeterminism in algebraic specifications and algebraic programs
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Declarative interpretations reconsidered
Proceedings of the eleventh international conference on Logic programming
A feature constraint system for logic programming with entailment
FGCS'921 Selected papers of the conference on Fifth generation computer systems
A complete and recursive feature theory
Theoretical Computer Science
A lazy narrowing calculus for functional logic programming with algebraic polymorphic types
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Term rewriting and all that
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Tiny Constrain Functional Logic Language and Its Continuation Semantics
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
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)
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Narrowing Failure in Functional Logic Programming
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Combining Layz Narrowing with Disequality Constraints
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Embedding Multiset Constraints into a Lazy Functional Logic Language
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Introducing Constraint Functional Logic Programming
Seminar and Workshop on Declarative Programming
A General Scheme for Constraint Functional Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Constrained Equational Deduction
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
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 Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
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
A declarative debugger of incorrect answers for constraint functional-logic programs
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
Declarative constraint programming with definitional trees
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 0.00 |
In this paper we propose a new generic scheme CFLP(D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. As in the case of the well known CLP(D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints. CFLP(D) programs are presented as sets of constrained rewrite rules that define the behaviour of possibly higher order and/or non-deterministic lazy functions over D. As the main novelty w.r.t. previous related work, we present a Constraint Rewriting Logic CRWL(D) which provides a declarative semantics for CFLP(D) programs. This logic relies on a new formalization of constraint domains and program interpretations, which allows a flexible combination of domain specific data values and user defined data constructors, as well as a functional view of constraints.