Please use this identifier to cite or link to this item:
Full metadata record
|dc.identifier.citation||Proceedings of ALP96: The Fifth International Conference on Algebraic and Logic Programming, Aachen, Germany, 24-27 September 1996, pp. 165-178||en|
|dc.description.abstract||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.||en|
|dc.title||A process algebra for synchronous concurrent constraint programming||en|
|Appears in Collections:||Computer Science|
Dept of Computer Science Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.