Parlog86 and the dining logicians
Author:
Open Access
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 31 (1) , 10-25
Abstract
A classic problem in concurrent programming is that of the "dining philosophers" which challenges the power of any aspiring concurrent program language. Recently, a growing number of logic programming languages have been refined to handle concurrent programming, one in particular is Parlog86.Keywords
This publication has 9 references indexed in Scilit:
- The concurrent logic programming language CP: Definition and operational semantics1987
- PARLOG: parallel programming in logicACM Transactions on Programming Languages and Systems, 1986
- Notes on the implementation of PARLOGThe Journal of Logic Programming, 1985
- The relation between logic programming and logic specificationPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1984
- A relational language for parallel programming1981
- An indeterminate constructor for applicative programming1980
- Communicating sequential processesCommunications of the ACM, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Hierarchical ordering of sequential processesActa Informatica, 1971