{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171370},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645702"},{"type":"electronic","value":"9783540693536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028028","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:02:06Z","timestamp":1132642926000},"page":"406-423","source":"Crossref","is-referenced-by-count":6,"title":["Concurrent constraint programming and non-commutative logic"],"prefix":"10.1007","author":[{"given":"Paul","family":"Ruet","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"J.M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9, 1991.","DOI":"10.1007\/BF03037173"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96, 1992.","DOI":"10.1016\/0304-3975(92)90185-I"},{"key":"25_CR3","unstructured":"E. Best, F.S. de Boer, and C. Palamidessi. Concurrent constraint programming with information removal. In Proc. of Coordination '97. Springer LNCS, 1997."},{"key":"25_CR4","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Technical Report RR 1702, INRIA, 1992."},{"key":"25_CR5","unstructured":"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."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"F. Fages. Constructive negation by pruning. J. of Logic Programming, 32(2), 1997.","DOI":"10.1016\/S0743-1066(96)00092-1"},{"key":"25_CR7","unstructured":"F. Fages, P. Ruet, and S. Soliman. Linear concurrent constraint programming: operational and phase semantics. Technical Report LIENS, 1997."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-61739-6_35"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1), 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","volume":"92","author":"J.Y. Girard","year":"1989","unstructured":"J.Y. Girard. Towards a geometry of interaction. Contemporary Mathematics, 92:69\u2013108, 1989.","journal-title":"Contemporary Mathematics"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013119. ACM, January 1987.","DOI":"10.1145\/41625.41635"},{"key":"25_CR12","unstructured":"R. Jagadeesan, V. Shanbhogue, and V.A. Saraswat. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Parc, 1991."},{"key":"25_CR13","unstructured":"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."},{"issue":"3","key":"25_CR14","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J. Lambek","year":"1958","unstructured":"J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65(3):154\u2013170, 1958.","journal-title":"American Mathematical Monthly"},{"key":"25_CR15","unstructured":"P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Parc Xerox Tech. Report, 1991."},{"key":"25_CR16","unstructured":"M.J. Maher. Logic semantics for a class of committed-choice programs. In Proceedings of ICLP '87, International Conference on Logic Programming, 1987."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"N. Marti-Oliet and J. Meseguer. From petri nets to linear logic. In Proceedings of Category Theory and Computer Science, pages 313\u2013340, Springer LNCS 389, 1989.","DOI":"10.1007\/BFb0018359"},{"key":"25_CR18","unstructured":"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."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"D. Miller. The \u03c0-calculus as a theory in linear logic: preliminary results. In Proceedings Workshop on Extensions of Logic Programming, Springer LNCS 660, 1992.","DOI":"10.1007\/3-540-56454-3_13"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1), 1992.","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"R. Mohring. Computationally tractable classes of ordered sets. NATO ASI Series (I.Rival, ed), 255, 1989.","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"25_CR22","unstructured":"C. Palamidessi. Constraint programming for concurrent and distributed computing. In Proc. of the JFPLC-UNIF '97, Invited talk, pages 11\u201320, 1997."},{"key":"25_CR23","unstructured":"G. Perrier. Concurrent programming as proof net construction. Technical Report CRIN 96-R-132, INRIA-Lorraine, 1996."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.7551\/mitpress\/4298.003.0047"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Ch. Retor\u00e9. Pomset logic-A non-commutative extension of commutative linear logic. In TLCA '97, Springer LNCS 1210, 1997.","DOI":"10.1007\/3-540-62688-3_43"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-61551-2_89"},{"key":"25_CR27","first-page":"274","volume":"3-2","author":"P. Ruet","year":"1997","unstructured":"P. Ruet. Non-commutative linear logic with mobilities. Presented at the Logic Colloquium '96, San Sebastian, Spain, Bulletin of Symbolic Logic 3-2:274\u2013275, Jan. 1997.","journal-title":"Bulletin of Symbolic Logic"},{"key":"25_CR28","volume-title":"Non-commutative logic and concurrent constraint programming","author":"P. Ruet","year":"1997","unstructured":"P. Ruet. Non-commutative logic and concurrent constraint programming. PhD thesis, Universit\u00e9 Denis Diderot, Paris 7, 1997."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat. Concurrent constraint programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Parc Xerox Technical Report, 1992.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/99583.99627"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"P.J. Stuckey. Constructive negation for constraint logic programming. Information and Computation, 118(1), 1995.","DOI":"10.1006\/inco.1995.1048"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"D.N. Yetter. Quantales and (non-commutative) linear logic. J. of Symbolic Logic, 55(1), 1990.","DOI":"10.2307\/2274953"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:08:28Z","timestamp":1706746108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645702","9783540693536"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0028028","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}