On the algebraic definition of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
OPAL: design and implementation of an algebraic programming language
Proceedings of the international conference on Programming languages and system architectures
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic, Programming, and PROLOG
Logic, Programming, and PROLOG
Solving Combinatorial Problems with a Constraint Functional Logic Language
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Algebraic Properties of Idempotent Substitutions
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
A General Scheme for Constraint Functional Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
An Architecture for Cooperating Constraint Solvers on Reals
Selected Papers from Constraint Programming: Basics and Trends
Mathematical Theory of Computation
Mathematical Theory of Computation
Synthesis of efficient constraint-satisfaction programs
The Knowledge Engineering Review
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
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
TOY: A System for Experimenting with Cooperation of Constraint Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Solution strategies for multi-domain constraint logic programs
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Playing with TOY: constraints and domain cooperation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
| Hi-index | 0.01 |
Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different language paradigms into a unified framework. Furthermore, we study the syntactic, semantic and operational impacts of this idea for the amalgamation of declarative and constraint programming.