A fully abstract model for concurrent constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 493 LNCS, Issue , 1991, Pages 296-319

  De Boer, Frank S ^a   Palamidessi, Catuscia ^b,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LOGIC PROGRAMMING; SEMANTICS;

ABSTRACT MODELING; COMMUNICATION MECHANISMS; COMPOSITIONALITY; CONCURRENT CONSTRAINT PROGRAMMING; CONCURRENT LOGIC PROGRAMMING; CONCURRENT PROGRAMMING; FULL ABSTRACTION; PARALLEL OPERATORS;

SOFTWARE DESIGN;

EID: 85030151043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-53982-4_17     Document Type: Conference Paper

References (18)

1. J.W. de Bakker and J.N. Kok. Uniform abstraction, atomicity and contractions in the comparative semantics of Concurrent Prolog. In Proc. of the International Conference on Fifth Generation Computer Systems, pages 347–355, Tokyo, Japan, 1988. OHMSHA, LTD. Extended Abstract, full version available as CWI report CS-8834.
2. J.W. de Bakker and J.N. Kok. Comparative metric semantics for Concurrent Prolog. Theoretical Computer Science, 75(1/2):15–44, 1990.
3. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Control flow versus logic: a denotational and a declarative model for Guarded Horn Clauses. In A. Kreczmar and G. Mirkowska, editors, Proc. of the Symposium on Mathematical Foundations of Computer Science, volume 379 of Lecture Notes in Computer Science, pages 165–176. Springer-Verlag, 1989.
4. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Semantic models for a version of PARLOG. In Giorgio Levi and Maurizio Martelli, editors, Proc. of the Sixth International Conference on Logic Programming, Series in Logic Programming, pages 621–636, Lisboa, 1989. The MIT Press. Extended version to appear in Theoretical Computer Science.
5. F.S. de Boer and C. Palamidessi. Concurrent logic languages: Asynchronism and language comparison. In Proc. of the North American Conference on Logic Programming, Series in Logic Programming, pages 175–194. The MIT Press, 1990. Full version available as technical report TR 6/90, Dipartimento di Informatica, Università di Pisa.
6. F.S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In J.C.M. Baeten and J.W. Klop, editors, Proc. of Concur 90, volume 458 of Lecture Notes in Computer Science, pages 99–114, Amsterdam, 1990. Springer-Verlag. Full version available as report at the Technische Universiteit Eindhoven.
7. M. Falaschi, M. Gabbrielli, G. Levi, and M. Murakami. Nested Guarded Horn Clauses: a language provided with a complete set of Unfolding Rules. In Proc. of the Japanese National Conference on Logic Programming '89, 1989.
8. M. Gabbrielli and G. Levi. Unfolding and fixpoint semantics for concurrent constraint logic programs. In H. Kirchner and W. Wechler, editors, Proc. of the Second Int. Conf. on Algebraic and Logic Programming, Lecture Notes in Computer Science, pages 204–216, Nancy, France, 1990. Springer-Verlag.
9. H. Gaifman, M. J. Maher, and E. Shapiro. Reactive Behaviour semantics for Concurrent Constraint Logic Programs. In E. Lusk and R. Overbeck, editors, North American Conference on Logic Programming, 1989.
10. R. Gerth, M. Codish, Y. Lichtenstein, and E. Shapiro. Fully abstract denotational semantics for Concurrent Prolog. In Proc. of the Third IEEE Symposium on Logic In Computer Science, pages 320–335. IEEE Computer Society Press, New York, 1988.
11. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In 14th ACM Principles of Programming Languages Conference, pages 111–119, Munich, F.R.G., 1987. ACM, New York.
12. J.N. Kok. A compositional semantics for Concurrent Prolog. In R. Cori and M. Wirsing, editors, Proc. Fifth Symposium on Theoretical Aspects of Computer Science, volume 294 of Lecture Notes in Computer Science, pages 373–388. Springer-Verlag, 1988.
13. 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.
14. V.A. Saraswat. Partial Correctness Semantics for CP(ø,|,&). In Proc. of the Conference on Foundations of Software Computing and Theoretical Computer Science, volume 206 of Lecture Notes in Computer Science, pages 347–368. Springer-Verlag, 1985.
15. V.A. Saraswat. A somewhat logical formulation of CLP synchronization primitives. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proc. of the Fifth International Conference on Logic Programming, Series in Logic Programming, pages 1298–1314, Seattle, USA, 1988. The MIT Press.
16. V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, january 1989. Published by The MIT Press, U.S.A., 1990.
17. 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.
18. M. Rinard, V.A. Saraswat and P. Panangaden. A fully abstract semantics for concurrent constraint programming. In Proc. of the eighteenth ACM Symposium on Principles of Programming Languages. ACM, New York, 1991.