{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:08Z","timestamp":1725562568727},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221647"},{"type":"electronic","value":"9783540248491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24849-1_16","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:34:24Z","timestamp":1281299664000},"page":"242-258","source":"Crossref","is-referenced-by-count":1,"title":["\u201cWave-Style\u201d Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[]},{"given":"Marina","family":"Lenisa","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","unstructured":"Abramsky, S.: Interaction, Combinators, and Complexity, lecture notes, Siena, Italy (1997)"},{"issue":"5","key":"16_CR3","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":"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. Inf. and Comp.\u00a0111(1), 53\u2013119 (1994)","journal-title":"Inf. and Comp."},{"key":"16_CR5","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":"16_CR6","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":"16_CR7","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 \u03bb-calculus. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 443\u2013457. Springer, Heidelberg (2001)"},{"key":"16_CR8","unstructured":"Abramsky, S., Longley, J.: Realizability models based on history-free strategies, draft (2000)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Mellies, P.: Concurrent Games and Full Completeness. In: LICS 1999, pp. 431\u2013442 (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"16_CR10","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":"16_CR11","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":"16_CR12","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. Symbolic Logic\u00a048, 931\u2013940 (1983)","journal-title":"Symbolic Logic"},{"key":"16_CR13","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":"16_CR14","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.D.. Gianantonio","year":"1999","unstructured":"Gianantonio, P.D., 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":"16_CR15","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.D.. Gianantonio","year":"1993","unstructured":"Gianantonio, P.D., Honsell, F.: In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 124\u2013138. Springer, Heidelberg (1993)"},{"key":"16_CR16","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":"16_CR17","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Proof-nets and the Hilbert space, in J.-Y.Girard et al. eds. In: Girard, J.-Y., et al. (eds.) Advances in linear Logic, pp. 307\u2013328. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511629150.016"},{"key":"16_CR18","first-page":"221","volume-title":"Logic Colloquium 1988","author":"J.-Y. Girard","year":"1988","unstructured":"Girard, J.-Y.: Geometry of Interaction I: Interpretation of System F. In: Ferro, R., et al. (eds.) Logic Colloquium 1988, pp. 221\u2013260. North Holland, Amsterdam (1988)"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","volume":"212","author":"F. Honsell","year":"1999","unstructured":"Honsell, F., Lenisa, M.: Semantical Analysis of Perpetual Strategies in lambdacalculus. TCS\u00a0212, 183\u2013209 (1999)","journal-title":"TCS"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-540-39813-4_29","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Honsell","year":"2003","unstructured":"Honsell, F., Lenisa, M.: Strict Geometry of Interaction Graph Models. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 403\u2013417. Springer, Heidelberg (2003)"},{"key":"16_CR21","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":"16_CR22","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":"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. Comb. Phil. Soc.\u00a0119, 447\u2013468 (1996)","journal-title":"Math. Proc. Comb. Phil. Soc."},{"key":"16_CR24","doi-asserted-by":"crossref","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","DOI":"10.1016\/0304-3975(93)90094-A"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BFb0029537","volume-title":"Lambda-Calculus and Computer Science Theory","author":"D. Scott","year":"1975","unstructured":"Scott, D.: Some physical issues concerning theories of combinators. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 346\u2013366. Springer, Heidelberg (1975)"},{"key":"16_CR26","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)"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24849-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:38Z","timestamp":1605761858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24849-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221647","9783540248491"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24849-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}