dc.contributor.author | Huntbach, Matthew | |
dc.date.accessioned | 2013-12-10T15:09:13Z | |
dc.date.available | 2013-12-10T15:09:13Z | |
dc.date.issued | 2013-12-10 | |
dc.identifier.issn | 1470-5559 | |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/4748 | |
dc.description.abstract | The principle behind concurrent logic programming is a set of processes which co-operate in monotonically constraining a global set of variables to particular values. Each process will have access to only some of the variables, and a process may bind a variable to a tuple containing further variables which may be bound later by other processes. This is a suitable
model for a coordination language. In this paper we describe a type system which ensures the co-operation principle is never breached, and which makes clear through syntax the pattern of data flow in a concurrent logic program. This overcomes problems previously associated with the practical use of concurrent logic languages. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | Department of Computer Science Research Reports;RR-02-03 - October 2002 | |
dc.subject | concurrent programming | en_US |
dc.subject | Logic programming | en_US |
dc.title | Coordination using a Single-Writer Multiple-Reader Concurrent Logic Language | en_US |
dc.type | Technical Report | en_US |