Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/2989
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrim, L-
dc.contributor.authorGilbert, D-
dc.contributor.authorJacquet, JM-
dc.contributor.authorKretinsky, M-
dc.coverage.spatial15en
dc.date.accessioned2009-01-29T13:18:27Z-
dc.date.available2009-01-29T13:18:27Z-
dc.date.issued1996-
dc.identifier.citationProceedings of ALP96: The Fifth International Conference on Algebraic and Logic Programming, Aachen, Germany, 24-27 September 1996, pp. 165-178en
dc.identifier.isbn3-540-61735-3-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/2989-
dc.description.abstractConcurrent 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.format.extent257398 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringeren
dc.titleA process algebra for synchronous concurrent constraint programmingen
dc.typeConference Paperen
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
10.1.1.46.1366.pdf251.37 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.