{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:13:38Z","timestamp":1740287618005,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201014"},{"type":"electronic","value":"9783540398134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39813-4_29","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:27:49Z","timestamp":1277839669000},"page":"407-421","source":"Crossref","is-referenced-by-count":1,"title":["Strict Geometry of Interaction Graph Models"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rekha","family":"Redamalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_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)"},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.: Geometry of Interaction and Linear Combinatory Algebras. Math. Struct. in Comp. Science\u00a012(5), 625\u2013665 (2002)","journal-title":"Math. Struct. in Comp. Science"},{"issue":"1","key":"29_CR3","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. Inf. and Comp.\u00a0111(1), 53\u2013119 (1994)","journal-title":"Inf. and Comp."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Inf. and Comp.\u00a0163, 409\u2013470 (2000)","journal-title":"Inf. and Comp."},{"key":"29_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":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-44802-0_31","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"2001","unstructured":"Abramsky, S., Lenisa, M.: Fully Complete Minimal PER Models for the Simply Typed. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 443\u2013457. Springer, Heidelberg (2001)"},{"key":"29_CR7","unstructured":"Abramsky, S., Longley, J.: Realizability models based on history-free strategies, draft (2000)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Mellies, P.: Concurrent Games and Full Completeness. In: LICS 1999 (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028007","volume-title":"Computer Science Logic","author":"P. Baillot","year":"1998","unstructured":"Baillot, P., Danos, V., Ehrard, T., Regnier, L.: Timeless games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414. Springer, Heidelberg (1998)"},{"key":"29_CR10","volume-title":"The Lambda Calculus, its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus, its Syntax and Semantics. North Holland, Amsterdam (1984)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani, M.: A filter lambda model and the completeness of type assignment system. J. Symbolic Logic\u00a048, 931\u2013940 (1983)","journal-title":"J. Symbolic Logic"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Benton, P., Bierman, G., de Paiva, V., Hyland, M.: Term assignment for intuitionistic linear logic. TR 262, Computer Laboratory, Cambridge (1992)","DOI":"10.1007\/BFb0037099"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48959-2_10","volume-title":"Typed Lambda Calculi and Applications","author":"P. Gianantonio Di","year":"1999","unstructured":"Di Gianantonio, P., Franco, G., Honsell, F.: Game Semantics for Untyped \u03bb- calculus. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 114\u2013128. Springer, Heidelberg (1999)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/BFb0037102","volume-title":"Typed Lambda Calculi and Applications","author":"P. Gianantonio Di","year":"1993","unstructured":"Di Gianantonio, P., Honsell, F.: An abstract notion of application. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 124\u2013138. Springer, Heidelberg (1993)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Local and Asynchronous beta-reduction (An analysis of Girard\u2019s Execution Formula). In: LICS 1993, pp. 296\u2013306 (1993)","DOI":"10.1109\/LICS.1993.287578"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Proof-nets and the Hilbert space. In: Girard, J.-Y., et al. (eds.) Advances in linear Logic. London Math. Soc. Series, vol.\u00a0222, pp. 307\u2013328. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511629150.016"},{"key":"29_CR17","first-page":"221","volume-title":"Colloquium 1988","author":"J.-Y. Girard","year":"1988","unstructured":"Girard, J.-Y.: Geometry of Interaction I: Interpretation of System F, Logic. In: Ferro, R., et al. (eds.) Colloquium 1988, pp. 221\u2013260. North Holland, Amsterdam (1988)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Honsell, F., Lenisa, M.: Semantical Analysis of Perpetual Strategies in lambda-calculus. In: TCS, vol.\u00a0212, pp. 183\u2013209 (1999)","DOI":"10.1016\/S0304-3975(98)00140-6"},{"key":"29_CR19","unstructured":"Honsell, F., Lenisa, M.: \u201dWave-style\u201d Geometry of Interaction Models are Graph-like \u03bb-models, Available at: http:\/\/www.dimi.uniud.it\/~lenisa\/Papers\/Soft-copy-pdf\/pointed.pdf"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"Honsell, F., Ronchi Della Rocca, S.: An approximation theorem for topological lambda models and the topological incompleteness of lambda models. J. Comp. System Sci.\u00a045, 49\u201375 (1992)","journal-title":"J. Comp. System Sci."},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF. Inf. and Comp. 163 (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"29_CR22","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. Comb. Phil. Soc.\u00a0119, 447\u2013468 (1996)","journal-title":"Math. Proc. Comb. Phil. Soc."},{"key":"29_CR23","unstructured":"Plotkin, G.: Set-theoretical and other elementary models of the \u03bb-calculus. In: Dezani, M., et al. (eds.) Honour of Corrado B\u00f6hm, pp. 351\u2013410. Elsevier, Amsterdam"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Scott, D.: Combinators and classes. In: \u03bb-calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 1\u201326","DOI":"10.1007\/BFb0029517"},{"key":"29_CR25","volume-title":"Proc. The Kleene Symp.","author":"D. Scott","year":"1980","unstructured":"Scott, D.: Lambda calculus: some models, some philosophy. In: Barwise, J. (ed.) Proc. The Kleene Symp.. North Holland, Amsterdam (1980)"},{"issue":"5","key":"29_CR26","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. Smith","year":"1982","unstructured":"Smith, M., Plotkin, G.: The category-theoretic solution of recursive domain equations. SIAM J. of Computing\u00a011(5), 761\u2013783 (1982)","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39813-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:57:56Z","timestamp":1740218276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39813-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201014","9783540398134"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39813-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}