The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming
Concurrent constraint programming
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alma-O: an imperative language that supports declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear concurrent constraint programming: operational and phase semantics
Information and Computation
The Logic Programming Paradigm: A 25-Year Perspective
The Logic Programming Paradigm: A 25-Year Perspective
| Hi-index | 0.00 |
We provide a denotational semantics for first-order logic that captures the two-level view of the computation process typical for constraint programming. At one level we have the usual program execution. At the other level an automatic maintenance of the constraint store takes place. We prove that the resulting semantics is sound with respect to the truth definition. By instantiating it by specific forms of constraint management policies we obtain several sound evaluation policies of first-order formulas. This semantics can also be used a basis for sound implementation of constraint maintenance in presence of block declarations and conditionals.