A process Algebra for Synchronous Concurrent ConstraintProgramming
Luboš Brim, DAVID R. GILBERT, Jean-Marie Jacquet, Mojmír Křetínský · Brunel University Research Archive (BURA) (Brunel University London) · 1995
Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new version of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it. An operational and an algebraic semantics are defined. The algebraic semantics is proved to be sound and complete with respect to a compositional operational semantics which is also presented in the paper. 1 Introduction As a consequence of being a generalisation of previous proposals for concurrent logic programming languages (Concurrent Prolog, Parlog, GHC, etc.), concurrent constraint programming has naturally inherited one of their main features: the asynchronous character of the communication. This is obtained by ask primitives blocking when the information on the store is not complete enough to entail the asked constraints. Following these lines, a natur...