{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:32:30Z","timestamp":1759177950336},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_16","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"216-231","source":"Crossref","is-referenced-by-count":9,"title":["Towards a Typed Geometry of Interaction"],"prefix":"10.1007","author":[{"given":"Esfandiar","family":"Haghverdi","sequence":"first","affiliation":[]},{"given":"Philip J.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_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":"16_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0022-4049(98)00106-6","volume":"143","author":"S. Abramsky","year":"1999","unstructured":"Abramsky, S., Blute, R., Panangaden, P.: Nuclear and trace ideals in tensored *-categories. J. Pure and Applied Algebra\u00a0143, 3\u201347 (1999)","journal-title":"J. Pure and Applied Algebra"},{"issue":"5","key":"16_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":"16_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":"16_CR5","unstructured":"Baillot, P.: Abramsky-Jagadeesan-Malacaria strategies and the geometry of interaction, m\u00e9moire de DEA, Universite Paris 7 (1995)"},{"key":"16_CR6","unstructured":"Baillot, P., Pedicini, M.: Elementary complexity and geometry of interaction. Fundamenta Informaticae\u00a045(1-2) (2001)"},{"key":"16_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":"16_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, CUP, pp. 307\u2013328 (1995)","DOI":"10.1017\/CBO9780511629150.016"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: Proceedings of Logic in Computer Science, vol. 9 pp. 15\u201326 (1992)","DOI":"10.1145\/143165.143172"},{"issue":"1","key":"16_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":"Girard, J.-Y.: Linear Logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"16_CR11","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":"16_CR12","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":"16_CR13","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Geometry of Interaction III: Accommodating the Additives. In: Advances in Linear Logic. LNS, vol.\u00a0222, CUP, pp. 329\u2013389 (1995)","DOI":"10.1017\/CBO9780511629150.017"},{"key":"16_CR14","unstructured":"Girard, J.-Y.: Cours de Logique, Rome (2004) (forthcoming)"},{"key":"16_CR15","unstructured":"Haghverdi, E.: A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, PhD Thesis, University of Ottawa, Canada (2000)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1017\/S0960129599003035","volume":"10","author":"E. Haghverdi","year":"2000","unstructured":"Haghverdi, E.: Unique Decomposition Categories, Geometry of Interaction and combinatory logic. Math. Struct. in Comp. Science\u00a010, 205\u2013231 (2000)","journal-title":"Math. Struct. in Comp. Science"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/978-3-540-27836-8_60","volume-title":"Automata, Languages and Programming","author":"E. Haghverdi","year":"2004","unstructured":"Haghverdi, E., Scott, P.J.: A categorical model for the Geometry of Interaction. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 708\u2013720. Springer, Heidelberg (2004)"},{"key":"16_CR18","series-title":"ENTCS","first-page":"67","volume-title":"Proceedings of CTCS 2004","author":"E. Haghverdi","year":"2004","unstructured":"Haghverdi, E., Scott, P.J.: From Geometry of Interaction to Denotational Semantics. In: Proceedings of CTCS 2004. ENTCS, vol.\u00a0122, pp. 67\u201387. Elsevier, Amsterdam (2004)"},{"key":"16_CR19","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":"16_CR20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1017\/S0960129503003931","volume":"13","author":"P. Hines","year":"2003","unstructured":"Hines, P.: A categorical framework for finite state machines. Math. Struct. in Comp. Science\u00a013, 451\u2013480 (2003)","journal-title":"Math. Struct. in Comp. Science"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(01)00241-9","volume":"294","author":"M. Hyland","year":"2003","unstructured":"Hyland, M., Schalk, A.: Glueing and Orthogonality for Models of Linear Logic. Theoretical Computer Science\u00a0294, 183\u2013231 (2003)","journal-title":"Theoretical Computer Science"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A.: Premonoidal categories and a graphical view of programs (1998), See the webpage http:\/\/klee.cs.depaul.edu\/premon\/ Also: Electr. Notes Theor. Comput. Sci.\u00a010 (1997)","DOI":"10.1016\/S1571-0661(05)80688-7"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced Monoidal Categories. Math. Proc. Camb. Phil. Soc.\u00a0119, 447\u2013468 (1996)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-45413-6_23","volume-title":"Typed Lambda Calculi and Applications","author":"O. Laurent","year":"2001","unstructured":"Laurent, O.: A Token Machine for Full Geometry of Interaction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 283\u2013297. Springer, Heidelberg (2001)"},{"key":"16_CR25","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"16_CR26","first-page":"63","volume-title":"Proc. LICS","author":"P. Malacaria","year":"1991","unstructured":"Malacaria, P., Regnier, L.: Some Results on the Interpretation of \u03bb- calculus in Operator Algebras. In: Proc. LICS, pp. 63\u201372. IEEE Press, Los Alamitos (1991)"},{"key":"16_CR27","unstructured":"Plotkin, G.: Trace Ideals, MFPS, invited lecture, Montreal (2003)"},{"key":"16_CR28","unstructured":"Regnier, L.: Lambda-calcul et R\u00e9seaux, PhD Thesis, Universit\u00e9 Paris VII (1992)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:38Z","timestamp":1605644018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11538363_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}