V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, january 1989. Published by The MIT Press, U.S.A., 1990.

The model M we present here, for concurrent constraint programming, is compositional with respect to all the operators of the language (prefixing, parallelism, ...

The model M we present here, for concurrent constraint programming, is compositional with respect to all the operators of the language (prefixing, parallelism, ...

Di Giusto CGabbrielli M(2008)Full abstraction for LindaProceedings of the Theory and practice of software, 17th European conference on Programming languages ...

It is the first fully abstract semantics which takes into account both non-determinism, infinite computations, and fairness. We present a simple concurrent ...

We consider here a paradigm for (asynchronous) concurrent programming, based on the above mechanism, and provided with the standard operators of choice, ...

A fully abstract model for Concurrent Constraint Programming. de Boer, F.S.. (1991) Utrecht University Repository. (Report). Download/Full Text.

A compositional and fully abstract semantics for concurrent constraint programming is developed. It is the first fully abstract semantics which.

A fully abstract model for Concurrent Constraint Programming. F.S. de Boer. Intelligente Systemen; Utrecht University; Dep Informatica. Research output: Book ...

F.S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In J.C.M. ...