{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299899,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562870"},{"type":"electronic","value":"9783540475071"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56287-7_113","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:01:46Z","timestamp":1330254106000},"page":"291-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Games and full Completeness for multiplicative Linear Logic"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radha","family":"Jagadeesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Proofs as processes. Unpublished Lecture, 1991.","DOI":"10.1016\/0165-5728(91)90204-K"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Technical Report DoC 92\/24, Imperial College Department of Computing, September 1992.","DOI":"10.1007\/3-540-56287-7_113"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proceedings of the Seventh Symposium on Logic In Computer Science, pages 211\u2013222. Computer Society Press of the IEEE, June 1992.","DOI":"10.1109\/LICS.1992.185534"},{"issue":"2","key":"22_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0960129500001274","volume":"1","author":"M. Barr","year":"1991","unstructured":"M. Barr. *-autonomous categories and linear logic. Mathematical Structures in Computer Science, 1(2):159\u2013178, July 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"S. Bainbridge","year":"1990","unstructured":"S. Bainbridge, P. J. Freyd, A. Scedrov, and P. Scott. Functorial polymorphism. Theoretical Computer Science, 70:35\u201364, 1990.","journal-title":"Theoretical Computer Science"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A. Blass","year":"1992","unstructured":"A. Blass. A game semantics for linear logic. Annals of Pure and Applied Logic, 56:183\u2013220, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR7","unstructured":"J. H. Conway. On Numbers and Games, volume 6 of London Mathematical Society Monographs. Academic Press, 1976."},{"key":"22_CR8","unstructured":"B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990."},{"key":"22_CR9","unstructured":"P. J. Freyd and A. Scedrov. Categories, Allegories, volume 39 of North-Holland Mathematical Library. Elsevier Science Publishers, 1991."},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","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"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction 2: Deadlock-free algorithms. In P. Martin-L\u00f6f and G. Mints, editors, International Conference on Computer Logic, COLOG 88, pages 76\u201393. Springer-Verlag, 1988. Lecture Notes in Computer Science 417.","DOI":"10.1007\/3-540-52335-9_49"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro et al., editor, Logic Colloquium 88. North Holland, 1989.","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Towards a geometry of interaction. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, pages 69\u2013108. American Mathematical Society, 1989.","DOI":"10.1090\/conm\/092\/1003197"},{"key":"22_CR14","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:255\u2013296, 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"J. M. E. Hyland, E. P. Robinson, and G. Rosolini. Algebraic types in per models. In Fifth Conference on Mathematical Foundations in Programming Semantics, pages 333\u2013350. Springer-Verlag, 1989. Lecture Notes in Computer Science 442.","DOI":"10.1007\/BFb0040266"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Y. Lafont and T. Streicher. Games semantics for linear logic. In Proc. Sixth Annual Symposium on Logic in Computer Science, pages 43\u201351. Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151629"},{"key":"22_CR18","first-page":"157","volume-title":"Logic Colloquium, Bristol 1973","author":"R. Milner","year":"1975","unstructured":"R. Milner. Processes, a mathematical model of computing agents. In Logic Colloquium, Bristol 1973, pages 157\u2013174. North Holland, Amsterdam, 1975."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223\u2013255, 1977.","journal-title":"Theoretical Computer Science"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"R. Seeley. *-autonomous categories, cofree coalgebras and linear logic. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, pages 371\u2013382. American Mathematical Society, 1989.","DOI":"10.1090\/conm\/092\/1003210"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56287-7_113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:47:02Z","timestamp":1742593622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56287-7_113"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562870","9783540475071"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-56287-7_113","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}