Logical semantics of concurrent constraint programming

  • Paul Ruet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)


This paper investigates logical characterizations of some aspects of concurrent constraint (cc) computations. It contains both negative and positive results.

We show that intuitionistic logic enables to observe the so-called stores of a concurrent constraint agent, but neither its successes nor its suspensions, even in the monotonic and deterministic case. On the other hand, IMALL (intuitionistic multiplicative and additive linear logic) does enable the observation of successes (but not that of suspensions): we consider a non-monotonic and non-deterministic version of cc, lcc, and we show that the successes of an lcc computation can be characterized logically; this holds also for cc, since cc can be faithfully translated into lcc.


Concurrent constraint programming intuitionistic logic linear logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Abrusci. Phase semantics and sequent calculus for pure non-commutative classical linear logic. Journal of Symbolic Logic, 56(4), 1991.Google Scholar
  2. 2.
    J.M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9, 1991.Google Scholar
  3. 3.
    G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96, 1992.Google Scholar
  4. 4.
    E. Best, F.S. de Boer, and C. Palamidessi. Concurrent constraint programming with information retrieval. Esprit project ACCLAIM final report, 1994.Google Scholar
  5. 5.
    G. Boudol. Asynchrony and the π-calculus. Technical Report RR 1702, INRIA, 1992.Google Scholar
  6. 6.
    F. Fages. Constructive negation by pruning. To appear in J. of Logic Programming, 1996.Google Scholar
  7. 7.
    F.S. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving concurrent constraint programs correct. In Proceedings of the ACM International Conference on Principles of Programming Languages, 1994.Google Scholar
  8. 8.
    J.Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.Google Scholar
  9. 9.
    J. Jaffar and J-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111–119. ACM, January 1987.Google Scholar
  10. 10.
    R. Jagadeesan, V. Shanbhogue, and V.A. Saraswat. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Parc, 1991.Google Scholar
  11. 11.
    N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.Google Scholar
  12. 12.
    K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(3):289–308, 1987.Google Scholar
  13. 13.
    P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Manuscript, 1992.Google Scholar
  14. 14.
    M.J. Maher. Logic semantics for a class of committed-choice programs. In Proceedings of ICLP'87, International Conference on Logic Programming, 1987.Google Scholar
  15. 15.
    D. Miller. The π-calculus as a theory in linear logic: preliminary results. In Proceedings Workshop on Extensions of Logic Programming, Springer LNCS 660, 1992.Google Scholar
  16. 16.
    R. Milner. The polyadic π-calculus. Technical Report ECS-LFCS-91-180, Edinburgh University, 1991.Google Scholar
  17. 17.
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1), 1992.Google Scholar
  18. 18.
    G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.Google Scholar
  19. 19.
    A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995.Google Scholar
  20. 20.
    Ch. Retoré. Réseaux et séquents ordonnés. PhD thesis, Université Paris 7, 1993.Google Scholar
  21. 21.
    V.A. Saraswat. Concurrent constraint programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.Google Scholar
  22. 22.
    V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Manuscript, 1992.Google Scholar
  23. 23.
    V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In POPL'91: Proceedings 18th ACM Symposium on Principles of Programming Languages, 1991.Google Scholar
  24. 24.
    P. J. Stuckey. Constructive negation for constraint logic programming. Information and Computation, 118(1), 1995.Google Scholar
  25. 25.
    C. Tse. The design and implementation of an actor language based on linear logic. Master Thesis, MIT, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Paul Ruet
    • 1
    • 2
  1. 1.LIENS, Ecole Normale SupérieureParisFrance
  2. 2.Thomson - LCROrsayFrance

Personalised recommendations