A process algebra for synchronous concurrent constraint programming

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2989

Full metadata record

DC Field	Value	Language
dc.contributor.author	Brim, L	-
dc.contributor.author	Gilbert, D	-
dc.contributor.author	Jacquet, JM	-
dc.contributor.author	Kretinsky, M	-
dc.coverage.spatial	15	en
dc.date.accessioned	2009-01-29T13:18:27Z	-
dc.date.available	2009-01-29T13:18:27Z	-
dc.date.issued	1996	-
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.identifier.isbn	3-540-61735-3	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2989	-
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.format.extent	257398 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Springer	en
dc.title	A process algebra for synchronous concurrent constraint programming	en
dc.type	Conference Paper	en
Appears in Collections:	Computer Science Dept of Computer Science Research Papers

Files in This Item:

File	Description	Size	Format
10.1.1.46.1366.pdf		251.37 kB	Adobe PDF	View/Open