Truly concurrent constraint programming (Q1605181)

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 cc 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\rightarrow P)\parallel(b\rightarrow Q)=(a\rightarrow (P\parallel(b\rightarrow Q)))(b\rightarrow(Q\parallel(a\rightarrow P)))\) is not verified (\(\square\) is indeterminate choice). Relationships between such a denotational approach to true concurrency and different powerdomain constructions are explored.