A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming a Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming

@inproceedings{Jacquet1999AFA,
  title={A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming a Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming},
  author={Jean-Marie Jacquet and Lubo Brim and David Gilbert and Mojm{\'i}r K ret{\'i}nsk{\'y}},
  year={1999}
}
Concurrent constraint programming is classically based on asynchronous communication via a shared store. In previous work ((1, 2]), we presented a new version of the ask and tell primitives which features synchronicity, our approach being based on the idea of telling new information just in the case that a concurrently running process is asking for it. We… CONTINUE READING