{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:09Z","timestamp":1725489489284},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_35","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"429-441","source":"Crossref","is-referenced-by-count":2,"title":["The Fine Structure of Game Lambda Models"],"prefix":"10.1007","author":[{"given":"Pietro Di","family":"Gianantonio","sequence":"first","affiliation":[]},{"given":"Gianluca","family":"Franco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"35_CR1","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF.Accepted for pubblication, Information and Computation, 1996."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Games and Full Abstraction for the LazyLambda-Calculus. In D. Kozen, editor, Proceedings of the Tenth AnnualSymposium on Logic in Computer Science, pages 234\u2013243. IEEE ComputerSociety Press, June 1995.","DOI":"10.1109\/LICS.1995.523259"},{"key":"35_CR3","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984. Revised edition."},{"key":"35_CR4","unstructured":"C. Berline. From Computation to Foundations via Functions and Application:the \u03b1-calculus and its Webbed Models. To appear in TheoreticalComputer Science."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio and G. Franco. The Fine Structure of Game LambdaModels. Technical report, Department of Mathematics and ComputerScience, University of Udine, 2000Electronically available: http:\/\/www.dimi.uniud.it\/~pietro\/Papers .","DOI":"10.1007\/3-540-44450-5_35"},{"key":"35_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48959-2_10","volume-title":"Game semantics for the untyped \u03b1 \u03b2\u0107c-calculus","author":"P. D. Gianantonio","year":"1999","unstructured":"P. Di Gianantonio, G. Franco, and F. Honsell. Game semantics for the untyped \u03b1 \u03b2\u0107c-calculus. In Proceedings of the International Conference onTyped Lambda Calculi and Applications 1999, volume 1591 of Lecture Notes in Computer Science, pages 114\u2013128. Springer-Verlag, 1999."},{"key":"35_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0014057","volume-title":"Final semantics for untyped \u03b1-calculus","author":"F. Honsell","year":"1995","unstructured":"F. Honsell and M. Lenisa. Final semantics for untyped \u03b1-calculus. InM. Dezani, editor, Proceedings of the International Conference on TypedLambda Calculi and Applications 1995, volume 902 of Lecture Notes in Computer Science, pages 249\u2013265. Springer-Verlag, 1995."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"J. M. E. Hyland and C. H. L. Ong. On full abstraction for PCF:I. Models,observables and the full abstraction problem, II. Dialogue games andinnocent strategies, III. A fully abstract and universal game model. Toappear in Information and Computation, 2000.","DOI":"10.1006\/inco.2000.2917"},{"key":"35_CR9","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 Theoremfor Topological Lambda Models and the Topological Incompleteness ofLambda Calculus. Journal of Computer and System Sciences, 45:49\u201375,1992.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"35_CR10","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 modelsof the \u03b1-calculus. Journal of London Mathematical Society, 12(2):361\u2013370,1976.","journal-title":"Journal of London Mathematical Society"},{"key":"35_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-48168-0_29","volume-title":"A universal innocent game modelfor the B\u00f6hm tree lambda theory","author":"A. D. Ker","year":"1999","unstructured":"A. D. Ker, H. Nickau, and C. H. L. Ong. A universal innocent game modelfor the B\u00f6hm tree lambda theory. In Computer Science Logic: Proceedingsof the 8th Annual Conference of the EACSL Madrid, Spain, volume 1683of Lecture Notes in Computer Science, pages 405\u2013419. Springer-Verlag,September 1999."},{"key":"35_CR12","unstructured":"A. D. Ker, H. Nickau, and C. H. L. Ong. Innocent game models of untypedlambda calculus. To appear in Theoretical Computer Science, 2000."},{"key":"35_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029523","volume-title":"Lambda Calculus and Computer Science","author":"J.J. L\u00e9vy","year":"1975","unstructured":"J.J. L\u00e9vy. An algebraic interpretation of \u03b1-calculus and a labelled \u03b1-calculus. In C. B\u00f6hm, editor, Lambda Calculus and Computer Science,volume 37 of Lecture Notes in Computer Science, pages 147\u2013165. Springer-Verlag, 1975."},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","volume":"24","author":"G. Longo","year":"1983","unstructured":"G. Longo. Set-theoretical models of \u03b1-calculus: theories, expansions andisomorphisms. Annals of Pure and Applied Logic, 24:153\u2013188, 1983.","journal-title":"Annals of Pure and Applied Logic"},{"key":"35_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Hereditarily sequential functionals","author":"H. Nickau","year":"1994","unstructured":"H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposiumon Logical Foundations of Computer Science: Logic at St. Petersburg,Lecture Notes in Computer Science. Springer-Verlag, 1994."},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"D. Scott. Continuous lattices. In Toposes, Algebraic Geometry and Logic,volume 274 of Lecture Notes in Mathematics. Springer-Verlag, 1972.","DOI":"10.1007\/BFb0073967"},{"issue":"3","key":"35_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/0207028","volume":"7","author":"C. P. Wadsworth","year":"1978","unstructured":"C. P. Wadsworth. Approximate Reduction and Lambda Calculus Models.SIAM Journal of Computing, 7(3):337\u2013356, August 1978.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:17:11Z","timestamp":1556756231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}