Skip to main content
SpringerLink
Log in

Concurrent constraint programming and non-commutative logic

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1414))

Included in the following conference series:

Abstract

This paper presents a connection between the intuitionistic fragment of a non-commutative version of linear logic introduced by the first author (NLI) and concurrent constraint programming (CC). We refine existing logical characterizations of operational aspects of CC, by providing a logical interpretation of finer observable properties of CC programs, namely stores, successes and suspensions.

Current affiliation : McGill University. Post-doctoral fellowship from the INRIA.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9, 1991.

    Google Scholar 

  2. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96, 1992.

    Google Scholar 

  3. E. Best, F.S. de Boer, and C. Palamidessi. Concurrent constraint programming with information removal. In Proc. of Coordination '97. Springer LNCS, 1997.

    Google Scholar 

  4. G. Boudol. Asynchrony and the π-calculus. Technical Report RR 1702, INRIA, 1992.

    Google Scholar 

  5. Ph. de Groote. Partially commutative linear logic: sequent calculus and phase semantics. In Proofs and Linguistic Categories, Proceedings 1996 Roma Workshop. In V. M. Abrusci and C. Casadio, eds. Cooperativa Libraria Universitaria Editrice Bologna, 1996.

    Google Scholar 

  6. F. Fages. Constructive negation by pruning. J. of Logic Programming, 32(2), 1997.

    Google Scholar 

  7. F. Fages, P. Ruet, and S. Soliman. Linear concurrent constraint programming: operational and phase semantics. Technical Report LIENS, 1997.

    Google Scholar 

  8. F.S. de Boer, M. Gabbrielli, and C. Palamidessi. Proving correctness of constraint logic programming with dynamic scheduling. In Proceedings of SAS '96, Springer LNCS 1145, 1996.

    Google Scholar 

  9. J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1), 1987.

    Google Scholar 

  10. J.Y. Girard. Towards a geometry of interaction. Contemporary Mathematics, 92:69–108, 1989.

    Google Scholar 

  11. 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 

  12. R. Jagadeesan, V. Shanbhogue, and V.A. Saraswat. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Parc, 1991.

    Google Scholar 

  13. 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 

  14. J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65(3):154–170, 1958.

    Google Scholar 

  15. P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Parc Xerox Tech. Report, 1991.

    Google Scholar 

  16. 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 

  17. N. Marti-Oliet and J. Meseguer. From petri nets to linear logic. In Proceedings of Category Theory and Computer Science, pages 313–340, Springer LNCS 389, 1989.

    Google Scholar 

  18. N. Mendler, P. Panangaden, P.J. Scott, and R.A.G. Seely. A logical view of concurrent constraint programming. Nordic J. of Computing, 2, 1995.

    Google Scholar 

  19. 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 

  20. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1), 1992.

    Google Scholar 

  21. R. Mohring. Computationally tractable classes of ordered sets. NATO ASI Series (I.Rival, ed), 255, 1989.

    Google Scholar 

  22. C. Palamidessi. Constraint programming for concurrent and distributed computing. In Proc. of the JFPLC-UNIF '97, Invited talk, pages 11–20, 1997.

    Google Scholar 

  23. G. Perrier. Concurrent programming as proof net construction. Technical Report CRIN 96-R-132, INRIA-Lorraine, 1996.

    Google Scholar 

  24. 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 

  25. Ch. Retoré. Pomset logic-A non-commutative extension of commutative linear logic. In TLCA '97, Springer LNCS 1210, 1997.

    Google Scholar 

  26. P. Ruet. Logical semantics of concurrent constraint programming. In Proceedings of CP '96, 2nd International Conference on Constraint Programming, Cambridge, MA, Springer LNCS 1118, 1996.

    Google Scholar 

  27. P. Ruet. Non-commutative linear logic with mobilities. Presented at the Logic Colloquium '96, San Sebastian, Spain, Bulletin of Symbolic Logic 3-2:274–275, Jan. 1997.

    Google Scholar 

  28. P. Ruet. Non-commutative logic and concurrent constraint programming. PhD thesis, Université Denis Diderot, Paris 7, 1997.

    Google Scholar 

  29. V.A. Saraswat. Concurrent constraint programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.

    Google Scholar 

  30. V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Parc Xerox Technical Report, 1992.

    Google Scholar 

  31. 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 

  32. P.J. Stuckey. Constructive negation for constraint logic programming. Information and Computation, 118(1), 1995.

    Google Scholar 

  33. D.N. Yetter. Quantales and (non-commutative) linear logic. J. of Symbolic Logic, 55(1), 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIENS-CNRS, Ecole Normale Supérieure, 45 rue d'Ulm, 75005, Paris, France

    Paul Ruet & François Fages

Authors
  1. Paul Ruet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Fages
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ruet, P., Fages, F. (1998). Concurrent constraint programming and non-commutative logic. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028028

Download citation

  • DOI: https://doi.org/10.1007/BFb0028028

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64570-2

  • Online ISBN: 978-3-540-69353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation