{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081511,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_60","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"708-720","source":"Crossref","is-referenced-by-count":3,"title":["A Categorical Model for the Geometry of Interaction"],"prefix":"10.1007","author":[{"given":"Esfandiar","family":"Haghverdi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Scott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"60_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S. Abramsky","year":"1996","unstructured":"Abramsky, S.: Retracing Some Paths in Process Algebra. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 1\u201317. Springer, Heidelberg (1996)"},{"key":"60_CR2","unstructured":"Abramsky, S.: Interaction, Combinators and Complexity. Lecture Notes, Siena, Italy (1997)"},{"issue":"5","key":"60_CR3","first-page":"625","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of Interaction and Linear Combinatory Algebras. MSCS\u00a012(5), 625\u2013665 (2002)","journal-title":"MSCS"},{"issue":"1","key":"60_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: New Foundations for the Geometry of Interaction. Information and Computation\u00a0111(1), 53\u2013119 (1994)","journal-title":"Information and Computation"},{"key":"60_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-44622-2_9","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Lenisa, M.: A Fully-complete PER Model for ML Polymorphic Types. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 140\u2013155. Springer, Heidelberg (2000)"},{"key":"60_CR6","first-page":"211","volume":"82","author":"M. Barr","year":"1992","unstructured":"Barr, M.: Algebraically Compact Functors. JPAA\u00a082, 211\u2013231 (1992)","journal-title":"JPAA"},{"key":"60_CR7","unstructured":"Danos, V.: La logique lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers processus de normalisation et principalement du \u03bb-calcul. PhD thesis, Universit\u00e9 Paris VII (1990)"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Proof-nets and the Hilbert Space. In: Advances in Linear Logic. London Math. Soc. Notes, vol.\u00a0222, pp. 307\u2013328. CUP (1995)","DOI":"10.1017\/CBO9780511629150.016"},{"key":"60_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-52335-9_49","volume-title":"COLOG-88","author":"J.-Y. Girard","year":"1990","unstructured":"Girard, J.-Y.: Geometry of Interaction II: Deadlock-free Algorithms. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG 1988. LNCS, vol.\u00a0417, pp. 76\u201393. Springer, Heidelberg (1990)"},{"key":"60_CR10","first-page":"221","volume-title":"Proc. Logic Colloquium 1988","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y.: Geometry of Interaction I: Interpretation of System F. In: Proc. Logic Colloquium 1988, pp. 221\u2013260. North Holland, Amsterdam (1989a)"},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Geometry of Interaction III: Accommodating the Additives. In: Advances in Linear Logic. LNS, vol.\u00a0222, pp. 329\u2013389. CUP (1995)","DOI":"10.1017\/CBO9780511629150.017"},{"key":"60_CR12","unstructured":"Haghverdi, E.: A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, PhD Thesis, University of Ottawa, Canada (2000)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Haghverdi, E.: Unique Decomposition Categories, Geometry of Interaction and combinatory logic. Math. Struct. in Comp. Science, vol.\u00a010, pp. 205\u2013231 (2000)","DOI":"10.1017\/S0960129599003035"},{"key":"60_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume-title":"Typed Lambda Calculi and Applications","author":"M. Hasegawa","year":"1997","unstructured":"Hasegawa, M.: Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculus. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 196\u2013213. Springer, Heidelberg (1997)"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T., Panangaden, P., Winskel, G.: A Relational Model of Nondeterministic Dataflow. To appear in Math. Struct. in Comp. Science (2004)","DOI":"10.1017\/S0960129504004293"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Hines, P.: A categorical framework for finite state machines. Math. Struct Comp. Science, vol.\u00a013, pp. 451\u2013480 (2003)","DOI":"10.1017\/S0960129503003931"},{"key":"60_CR17","doi-asserted-by":"crossref","unstructured":"Joyal, A., Street, R., Verity, D.: Traced Monoidal Categories. Math. Proc. Camb. Phil. Soc., vol.\u00a0119, pp. 447\u2013468 (1996)","DOI":"10.1017\/S0305004100074338"},{"key":"60_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4962-7","volume-title":"Algebraic Approaches to Program Semantics","author":"E.G. Manes","year":"1986","unstructured":"Manes, E.G., Arbib, M.A.: Algebraic Approaches to Program Semantics. Springer, Heidelberg (1986)"},{"key":"60_CR19","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Categorical Structure of Asynchrony","author":"P. Selinger","year":"1999","unstructured":"Selinger, P.: Categorical Structure of Asynchrony. Electronic Notes in Theoretical Computer Science, vol.\u00a020. Elsevier Science B.V., Amsterdam (1999)"},{"key":"60_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0479-7","volume-title":"Network Algebra","author":"G. Stefanescu","year":"2000","unstructured":"Stefanescu, G.: Network Algebra. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:01Z","timestamp":1605741841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_60","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}