Abstract
In the last years there have been several proposals to extend logic programming with the constructs for concurrency, aiming at the development of a concurrent language which would maintain the typical advantages of logic programming: declarative reading, computations as proofs, amenability to metaprogramming etc. Examples of concurrent logic languages include PARLOG [6], Concurrent Prolog [12], Guarded Horn Clauses [15] and their so-called flat versions.
This is a preview of subscription content, log in via an institution.
References
J.A. Bergstra and J.W. Klop. Process algebra: specification and verification in bisimulation semantics. In Mathematics and Computer Science II, CWI Monographs, pages 61–94. North-Holland, 1986.
F.S. de Boer, E. Best, and C. Palamidessi. Concurrent Constraint Programming with Information Removal. Technical Report, Dipartimento di Informatica, Università di Genova, Genova. 1994.
F.S. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving Concurrent Constraint Programs Correct. In Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages, 1993.
F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In S. Abramsky and T.S.E. Maibaum, editors, Proc. of TAPSOFT/CAAP, volume 493 of Lecture Notes in Computer Science, pages 296–319. Springer-Verlag, 1991.
S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. Journal of ACM, 31:499–560, 1984.
K.L. Clark and S. Gregory. PARLOG: parallel programming in logic. ACM Trans. on Programming Languages and Systems, (8):1–49, 1986.
M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Confluence and Concurrent Constraint Programming. Technical Report, Dipartimento di Informatica, Università di Pisa, Pisa. 1994.
J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc,. of ACM Symposium on Principles of Programming Languages, pages 111–119. ACM, New York, 1987.
M. J. Maher. Logic semantics for a class of committed-choice programs. In Jean-Louis Lassez, editor, Proc. of the Fourth International Conference on Logic Programming, Series in Logic Programming, pages 858–876, Melbourne, 1987. The MIT Press.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1980.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, U.S.A., 1990.
E.Y. Shapiro. A subset of Concurrent Prolog and its interpreter. Technical Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo, 1983.
V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the seventeenth ACM Symposium on Principles of Programming Languages, pages 232–245. ACM, New York, 1990.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Concurrent Constraint Programming. In Proc. of the eighteenth ACM Symposium on Principles of Programming Languages. ACM, New York, 1991.
K. Ueda. Guarded Horn Clauses. In E. Y. Shapiro, editor, Concurrent Prolog: Collected Papers. The MIT Press, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palamidessi, C. (1994). Concurrent constraint programming. In: Hermenegildo, M., Penjam, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1994. Lecture Notes in Computer Science, vol 844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58402-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-58402-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58402-5
Online ISBN: 978-3-540-48695-4
eBook Packages: Springer Book Archive