{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:45Z","timestamp":1759637925664},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626886"},{"type":"electronic","value":"9783540684381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62688-3_43","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:48:40Z","timestamp":1330296520000},"page":"300-318","source":"Crossref","is-referenced-by-count":29,"title":["Pomset logic: A non-commutative extension of classical linear logic"],"prefix":"10.1007","author":[{"given":"Christian","family":"Retor\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3\u201357, 1993.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR2","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.2307\/2275485","volume":"56","author":"V. M. Abrusci","year":"1991","unstructured":"V. M. Abrusci. Phase semantics and sequent calculus for pure non-commutative classical linear logic. Journal of Symbolic Logic, 56(4):1403\u20131451, December 1991.","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"V. M. Abrusci. Non-commutative proof nets. In [13], pages 271\u2013296, 1995.","DOI":"10.1017\/CBO9780511629150.014"},{"key":"19_CR4","volume-title":"Technical Report LIENS 91-15","author":"A. Asperti","year":"1991","unstructured":"A. Asperti. A linguistic approach to dead-lock. Technical Report LIENS 91-15, D\u00e9p. Maths et Info, Ecole Normale Sup\u00e9rieure, Paris, October 1991."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-58140-5_5","volume-title":"Logical Fundations of Computer Science","author":"A. Asperti","year":"1994","unstructured":"A. Asperti and G. Dore. Yet another correctness criterion for multiplicative linear logic with mix. In A. Nerode and Yu. Matiyasevich, editors, Logical Fundations of Computer Science, volume 813 of Lecture Notes in Computer Science, pages 34\u201346, St. Petersburg, July 1994. Springer Verlag."},{"key":"19_CR6","unstructured":"G. Berry. Mod\u00e8les compl\u00e8tements ad\u00e9quats et stables des lambda calculs typ\u00e9s. Th\u00e8se d'\u00e9tat, sp\u00e9cialit\u00e9 sciences math\u00e9matiques, Universit\u00e9 Paris 7, 1979."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"V. Danos and L. Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181\u2013203, 1989.","journal-title":"Archive for Mathematical Logic"},{"issue":"2","key":"19_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1017\/S0960129500000451","volume":"4","author":"A. Fleury","year":"1994","unstructured":"A. Fleury and C. Retor\u00e9. The mix rule. Mathematical Structures in Computer Science, 4(2):273\u2013285, June 1994.","journal-title":"Mathematical Structures in Computer Science"},{"key":"19_CR9","unstructured":"J.-Y. Girard. Multiplicatives. Rendiconti del Seminario dell'Universit\u00e1 \u00e9 Politecnico Torino, pages 11\u201333. October 1986. Special issue on Logic and Computer Science."},{"issue":"1","key":"19_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"19_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J.-Y. Girard","year":"1991","unstructured":"J.-Y. Girard. A new constructive logic: classical logic. Mathematical Structures in Computer Science, 1(3):255\u2013296, November 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Linear logic: its syntax and semantics. In [13], pages 1\u201342, 1995.","DOI":"10.1017\/CBO9780511629150"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard, Y. Lafont, and L. Regnier, editors. Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Notes. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511629150"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"G. Gonthier, J.-J. L\u00e9vy and M. Abadi. The geometry of optimal lambda reduction. In Principles Of Programming Languages, pages 15\u201326, 1992.","DOI":"10.1145\/143165.143172"},{"key":"19_CR15","first-page":"240","volume-title":"Concurrency and plan generation in a logic programming language with a sequential operator","author":"A. Guglielmi","year":"1994","unstructured":"A. Guglielmi. Concurrency and plan generation in a logic programming language with a sequential operator. In P. van Hentenryck, editor, International Conference on Logic Programming, pages 240\u2013254, Genova, 1994. M.I.T. Press."},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(81)90085-X","volume":"30","author":"Y. O. Hamidoune","year":"1981","unstructured":"Y. O. Hamidoune. Connexit\u00e9 dans les graphes orient\u00e9s. Journal of Combinatorial Theory (B), 30:1\u201311, 1981.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Information and computation, pages 327\u2013365, 1994.","DOI":"10.1006\/inco.1994.1036"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","volume":"67","author":"M. Kanovitch","year":"1994","unstructured":"M. Kanovitch. Linear logic as a logic of computation. Annals of pure and applied logic, 67:183\u2013212, 1994.","journal-title":"Annals of pure and applied logic"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"N. Kobayashi and A. Yonezawa. Higher-order concurrent linear logic programming. In Theory and Practice of Parallel Programming, volume 907 of LNCS, pages 137\u2013166. Springer Verlag, 1995.","DOI":"10.1007\/BFb0026568"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"J. Lambek. The mathematics of sentence structure. American mathematical monthly, pages 154\u2013170, 1958.","DOI":"10.1080\/00029890.1958.11989160"},{"key":"19_CR21","unstructured":"A. Lecomte and C. Retor\u00e9. Pomset logic as an alternative categorial grammar. In G. Morrill and R. Oehrle, editors, Formal Grammar, pages 181\u2013196, FoLLI."},{"key":"19_CR22","unstructured":"L. Lov\u00e0sz and M.D. Plummer. Matching Theory, volume 121 of Mathematics Studies. North-Holland, 1986. Annals of Discrete Mathematics 29."},{"key":"19_CR23","unstructured":"R. Milner. Communication and Concurrency. International series in computer science. Prentice Hall, 1989."},{"key":"19_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1042-6","volume-title":"Type Logical Grammar","author":"G. V. Morrill","year":"1994","unstructured":"G. V. Morrill. Type Logical Grammar. Kluwer Academic Publishers, Dordrecht and Hingham, 1994."},{"key":"19_CR25","unstructured":"G. Perrier. Concurrent Programming as Proof Net Construction. Research Report 96-R-132, CRIN-CNRS, Nancy, September 1996."},{"key":"19_CR26","unstructured":"U. S. Reddy. A linear logic model of state. Electronic manuscript, University of Illinois (anonymous FTP from cs.uiuc.edu), October 1993."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Global state considered unnecessary: An introduction to object-based semantics. Journal of Lisp and Symbolic Computation, 1996. (to appear).","DOI":"10.1007\/BF01806032"},{"key":"19_CR28","unstructured":"C. Retor\u00e9. R\u00e9seaux et S\u00e9quents Ordonn\u00e9s. Th\u00e8se de Doctorat, sp\u00e9cialit\u00e9 Math\u00e9matiques, Universit\u00e9 Paris 7, f\u00e9vrier 1993."},{"key":"19_CR29","unstructured":"C. Retor\u00e9. On the relation between coherence semantics and multiplicative proof nets. Rapport de Recherche 2430, INRIA, d\u00e9cembre 1994."},{"key":"19_CR30","unstructured":"C. Retor\u00e9. A self-dual modality for \u201cbefore\u201d in the category of coherence spaces and in the category of hypercoherences. Rapport de Recherche 2432, INRIA, d\u00e9cembre 1994."},{"key":"19_CR31","unstructured":"C. Retor\u00e9. Une modalit\u00e9 autoduale pour le connecteur \u201cpr\u00e9c\u00e8de\u201d. In Pierre Ageron, editor, Cat\u00e9gories, Alg\u00e8bres, Esquisses et N\u00e9o-Esquisses, Publications du D\u00e9partement de Math\u00e9matiques, Universit\u00e9 de Caen, pages 11\u201316, septembre 1994."},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"C. Retor\u00e9. Perfect matchings and series-parallel graphs: multiplicative proof nets as R&B-graphs. In J.-Y. Girard, M. Okada, and A. Scedrov, editors, Linear'96, volume 3 of Electronic Notes in Computer Science. Elsevier, 1996. (available from http:\/\/pigeon.elsevier.nl\/mcs\/tcs\/pc\/menu.html).","DOI":"10.1016\/S1571-0661(05)80416-5"},{"key":"19_CR33","unstructured":"C. Retor\u00e9. A semantical characterisation of the correctness of a proof net. Mathematical Structures in Computer Science. (to appear)"},{"key":"19_CR34","unstructured":"I. Schena. Pomset logic and discontinuity in natural language. In C. Retor\u00e9, editor, Logical Aspects of Computational Linguistics, pages 7\u201312. CRIN-C.N.R.S. & INRIA-Lorraine, 1996. (to appear in LNCS\/LNAI series, Springer-Verlag)."},{"key":"19_CR35","volume-title":"Semantics of programming languages","author":"R. D. Tennent","year":"1991","unstructured":"R. D. Tennent. Semantics of programming languages. Prentice-Hall International, London, 1991."},{"key":"19_CR36","unstructured":"A. S. Troelstra. Lectures on Linear Logic, volume 29 of Center for the Study of Language and Information Lecture Notes. Cambridge University Press, 1992."},{"issue":"2","key":"19_CR37","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R.E. Tarjan, and E. L. Lawler. The recognition of Series-Parallel digraphs. SIAM Journal of Computing, 11(2):298\u2013313, May 1982.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62688-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:20:42Z","timestamp":1640949642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62688-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626886","9783540684381"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-62688-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}