{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:46Z","timestamp":1751660506885,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_22","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"320-334","source":"Crossref","is-referenced-by-count":4,"title":["A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy"],"prefix":"10.1007","author":[{"given":"Naohiko","family":"Hoshino","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"22_CR1","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.J.: Geometry of interaction and linear combinatory algebras. Math. Struct. in Comput. Sci.\u00a012(5), 625\u2013665 (2002)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"22_CR2","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., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 140\u2013155. Springer, Heidelberg (2000)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028004","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"22_CR4","first-page":"1","volume":"45","author":"P. Baillot","year":"2001","unstructured":"Baillot, P., Pedicini, M.: Elementary complexity and geometry of interaction. Fundam. Inf.\u00a045(1-2), 1\u201331 (2001)","journal-title":"Fundam. Inf."},{"key":"22_CR5","unstructured":"Barber, A., Plotkin, G.: Dual intuitionistic linear logic, Technical Reprot ECS-LFCS-96-347, LFCS, Universit of Edinburgh (1997)"},{"key":"22_CR6","unstructured":"Barber, A.G.: Linear Type Theories, Semantics and Action Calculi. PhD thesis, University of Edinburgh (1997)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0014046","volume-title":"Typed Lambda Calculi and Applications","author":"G.M. Bierman","year":"1995","unstructured":"Bierman, G.M.: What is a categorical model of intuitionistic linear logic? In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 78\u201393. Springer, Heidelberg (1995)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S1571-0661(04)80874-0","volume":"41","author":"G.M. Bierman","year":"2001","unstructured":"Bierman, G.M., Pitts, A.M., Russo, C.V.: Operational properties of lily, a polymorphic linear lambda calculus with recursion. Electr. Notes Theor. Comput. Sci.\u00a041(3) (2000)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1-3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.tcs.2007.06.016","volume":"388","author":"L. Birkedal","year":"2007","unstructured":"Birkedal, L., M\u00f8gelberg, R.E., Petersen, R.L.: Domain-theoretical models of parametric polymorphism. Theor. Comput. Sci.\u00a0388(1-3), 152\u2013172 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Reversible, irreversible and optimal lambda-machines. Electr. Notes Theor. Comput. Sci.\u00a03 (1996)","DOI":"10.1016\/S1571-0661(05)80402-5"},{"key":"22_CR11","volume-title":"Logic Colloquium 1988","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y.: Geometry of Interaction I: Interpretation of System F. In: Ferro, R., et al. (eds.) Logic Colloquium 1988. North-Holland, Amsterdam (1989)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"22_CR13","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: POPL, pp. 15\u201326 (1992)","DOI":"10.1145\/143165.143172"},{"key":"22_CR15","unstructured":"Haghverdi, E.: A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness. PhD thesis, University of Ottawa (2000)"},{"issue":"2-3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.tcs.2005.10.028","volume":"350","author":"E. Haghverdi","year":"2006","unstructured":"Haghverdi, E., Scott, P.J.: A categorical model for the geometry of interaction. Theor. Comput. Sci.\u00a0350(2-3), 252\u2013274 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0960129508007184","volume":"19","author":"M. Hasegawa","year":"2009","unstructured":"Hasegawa, M.: On traced monoidal closed categories. Mathematical Structures in Computer Science\u00a019(2), 217\u2013244 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR18","volume-title":"The Implementation of Functional Programming Languages","author":"S.P. Jones","year":"1987","unstructured":"Jones, S.P.: The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs (1987)"},{"issue":"3","key":"22_CR19","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. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0119(3), 447\u2013468 (1996)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Mackie, I.: The geometry of interaction machine. In: POPL, pp. 198\u2013208 (1995)","DOI":"10.1145\/199448.199483"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11874683_1","volume-title":"Computer Science Logic","author":"P.-A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.-A.: Functorial Boxes in String Diagrams. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 1\u201330. Springer, Heidelberg (2006)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-32033-3_17","volume-title":"Term Rewriting and Applications","author":"A.K. Simpson","year":"2005","unstructured":"Simpson, A.K.: Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"22_CR23","volume-title":"Models and Computatbility","author":"J. Oosten van","year":"1999","unstructured":"van Oosten, J.: A combinatory algebra for sequential functionals of finite type. In: Cooper, S.B., Truss, J.K. (eds.) Models and Computatbility. Cambridge University Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:31:17Z","timestamp":1558420277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}