{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T10:29:13Z","timestamp":1789986553906,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540657637","type":"print"},{"value":"9783540489597","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48959-2_10","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:52:16Z","timestamp":1178196736000},"page":"114-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Game Semantics for Untyped \u03bb\u03b2\u03b7-Calculus"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Di Gianantonio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianluca","family":"Franco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Furio","family":"Honsell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. Domain theory in logical form. In Annals of Pure and Applied Logic, volume 51, pages 1\u201377, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543\u2013574, June 1994.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR3","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Ftp-available at \n                    http:\/\/www.dcs.ed.ac.uk\/home\/samson\n                    \n                  , 1994."},{"key":"10_CR4","unstructured":"S. Abramsky and G. McCusker. Games for recursive types. In Theory and Formal Methods of Computing 1994. Imperial College Press, October 1995."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and C.H.L. Ong. Full abstraction in the lazy \u03bb-calculus. Information and Computation, 105:159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"10_CR6","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984. revised edition."},{"key":"10_CR7","unstructured":"C. Berline. From Computation to Foundations via Functions and Application: the \u03bb-calculus and its Webbed Models. To appear."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"M. Coppo, M. Dezani-Ciancaglini, F. Honsell, and G. Longo. Extended type structures and filter \u03bb-models. In G. Lolli G. Longo and A. Marcja, editors, Logic Colloquium\u2019 82. Elsevier Science Publishers, 1984.","DOI":"10.1016\/S0049-237X(08)71819-6"},{"key":"10_CR9","unstructured":"P. Di Gianantonio and G. Franco. A type assignment system for the game semantics. In ICTCS Proceedings, Prato, 1998. 115"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","volume":"45","author":"J.Y. Girard","year":"1986","unstructured":"J.Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159\u2013192, 1986.","journal-title":"Theoretical Computer Science"},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0014057","volume-title":"Final semantics for untyped \u03bb-calculus","author":"F. Honsell","year":"1995","unstructured":"F. Honsell and M. Lenisa. Final semantics for untyped \u03bb-calculus. In LNCS, volume 902, pages 249\u2013265. Springer-Verlag, 1995."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"F. Honsell and S. Ronchi Della Rocca. An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. Journal of Computer and System Sciences, 45:49\u201375, 1992.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"J.M.E. Hyland","year":"1976","unstructured":"J.M.E. Hyland. A syntatic characterization of the equality in some models of the \u03bb-calculus. Journal of London Mathematical Society, 122):361\u2013370, 1976.","journal-title":"Journal of London Mathematical Society"},{"key":"10_CR14","unstructured":"J.M.H. Hyland and C.H.L. Ong. On full abstraction for PCF:I, II, III. ftp-available at \n                    http:\/\/theory.doc.ic.ac.uk\n                    \n                   in directory papers\/Ong."},{"key":"10_CR15","unstructured":"G. A. McCusker. Games and full abstraction for a functional language with recursive types. PhD thesis, Imperial College, 1996."},{"key":"10_CR16","volume-title":"Toposes, Algebraic Geometry and Logic-Lecture Notes in Mathematics","author":"D. Scott","year":"1972","unstructured":"D. Scott. Continuous lattices. In Toposes, Algebraic Geometry and Logic-Lecture Notes in Mathematics, volume 274. Springer-Verlag, Berlin, New York, 1972."},{"key":"10_CR17","unstructured":"D. Scott and C. Gunter. Semantic domains. In Handbook of Theorical Computer Science. North Holland, 1990."},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C. P. Wadsworth","year":"1976","unstructured":"C. P. Wadsworth. The Relation between computational and Denotational Properties for Scott\u2019s D\n                           \u221e-models of the \u03bb-calculus. SIAM, 5(3):488\u2013521, 1976.","journal-title":"SIAM"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48959-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:07:51Z","timestamp":1558256871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48959-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657637","9783540489597"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48959-2_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}