Copyright © 2002 Published by Elsevier Science B.V. All rights reserved.
Truly concurrent constraint programming
Available online 25 April 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for
that is fully abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained structure of computation; in particular the Interleaving Law
(a→P)
(b→Q)=(a→(P
(b→Q)))(b→(Q
(a→P)))
(b→Q)=(a→(P
(b→Q)))(b→(Q
(a→P)))





E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






