{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:46:21Z","timestamp":1743093981630,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_1","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Game Semantics for Generic Polymorphism"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radha","family":"Jagadeesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"issue":"1-2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(93)90082-5","volume":"121","author":"M. Abadi","year":"1993","unstructured":"M. Abadi, L. Cardelli and P.-L. Curien.Formal Parametric Polymorphism.In Proc. 20th ACM Symposium on Principles of Programming Languages 1993.","journal-title":"Theoretical Computer Science"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky.Semantics of Interaction.In Semantics and Logics of Computation edited by A. Pitts and P. Dybjer,Cambridge University Press 1997,1\u201332.","DOI":"10.1017\/CBO9780511526619.002"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"Samson Abramsky","year":"1994","unstructured":"S. Abramsky, R. Jagadeesan.Games and Full Completeness for Multiplicative Linear Logic,J. of Symbolic Logic59(2),1994,543\u2013574.","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR4","unstructured":"S. Abramsky, R. Jagadeesan.A Game Semantics for Generic Polymorphism.Oxford University Computing Laboratory Programming Research Group,Research Report RR-03-02,2003.Available on-line at http:\/\/web.comlab.ox.ac.uk\/oucl\/publications\/tr\/rr-03-02"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"Samson Abramsky","year":"2000","unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria.Full Abstraction for PCF,Inf. and Comp.163, 2000,409\u2013470.","journal-title":"Information and Computation"},{"key":"1_CR6","series-title":"Lect Notes Comput Sci","first-page":"140","volume-title":"A Fully-complete PER Model for ML Polymorphic Types","year":"2000","unstructured":"S. Abramsky, M. Lenisa.A Fully-complete PER Model for ML Polymorphic Types, CSL\u201900 Conf.Proc.,P. Clote, H. Schwichtenberg eds. ,LNCS 1862, 2000,140\u2013155."},{"key":"1_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44802-0_31","volume-title":"A Fully Complete Minimal PER Model for the Simply Typed \u03bb-calculus","author":"S. Abramsky","year":"2001","unstructured":"S. Abramsky, M. Lenisa.A Fully Complete Minimal PER Model for the Simply Typed \u03bb-calculus,CSL\u201901 Conf.Proc.,LNCS 2001."},{"key":"1_CR8","unstructured":"S. Abramsky and G. McCusker.Games for Recursive Types.In C. Hankin, I. Mackie and R. Nagarajan,eds.Theory and Formal Methods of Computing 1994. Imperial College Press,1995."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"G. Berry.The Foundations of Esterel.In Proof, Language and Interaction: Essays in honour of Robin Milner eds.G. Plotkin, C. Stirling and M. Tofte.MIT Press 2000,425\u2013454.","DOI":"10.7551\/mitpress\/5641.003.0021"},{"key":"1_CR10","unstructured":"J.Y. Girard.Interpr\u00e9tation functionelle et \u00e9limunation des coupures de l 'arithm\u00e8tique d 'ordre sup\u00e9rieur,Th\u00e9se d 'Etat,Universit\u00e9 Paris VII,1972."},{"key":"1_CR11","unstructured":"J.-Y. Girard, Y. Lafont and P. Taylor.Proofs and Types. Cambridge University Press 1989."},{"key":"1_CR12","unstructured":"D.J.D. Hughes.Hypergame Semantics: Full Completeness for System F. D.Phil. thesis,University of Oxford,1999."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland.A small complete category.Annals of Pure and Applied Logic, 40,1988.","DOI":"10.1016\/0168-0072(88)90018-8"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"F.W. Lawvere.Equality in hyperdoctrines and the comprehension schema as an adjoint functor,Proc.Symp.on Applications of Categorical Logic,1970.","DOI":"10.1090\/pspum\/017\/0257175"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"G. Longo, K. Milsted, S. Soloviev.The Genericity Theorem and Parametricity in the Polymorphic \u03bb-Calculus,TCS 121(1&2):323\u2013349,1993.","DOI":"10.1016\/0304-3975(93)90093-9"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"G. Longo.Parametric and Type-Dependent Polymorphism.Fundamenta Informat-icae 22(1\/2):69\u201392.","DOI":"10.3233\/FI-1995-22124"},{"key":"1_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Mathematical Foundations of Programming Language Semantics","author":"Q.-Q. Ma","year":"1992","unstructured":"Q.-Q. Ma and J.C. Reynolds.Types,Abstraction and Parametric Polymorphism, Part 2.In S. Brookes et al.editors,Mathematical Foundations of Programming Language Semantics, LNCS 598 1992."},{"key":"1_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Polymorphism is set-theoretic constructively","year":"1987","unstructured":"A. Pitts.Polymorphism is set-theoretic constructively,CTCS\u201988 Conf.Proc., D. Pitt ed.,LNCS 283, 1988."},{"key":"1_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0037118","volume-title":"A Logic for Parametric Polymorphism","author":"G. Plotkin","year":"1993","unstructured":"G. Plotkin, M. Abadi.A Logic for Parametric Polymorphism,TLCA\u201993 Conf. Proc.,LNCS,1993."},{"key":"1_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Towards a Theory of Type Structure","author":"J.C. Reynolds","year":"1974","unstructured":"J.C. Reynolds.Towards a Theory of Type Structure.Programming Symposium, Proceedings,Paris 1974.LNCS 19, 1974."},{"key":"1_CR21","unstructured":"J.C. Reynolds.Types,Abstraction and Parametric Polymorphism. Information Processing 83, pp.513\u2013523,Elsevier (North-Holland),1983."},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"969","DOI":"10.2307\/2273831","volume":"52","author":"R. A. G. Seely","year":"1987","unstructured":"R.A.G. Seeley.Categorical semantics for higher-order polymorphic lambda calculus.Journal of Symbolic Logic 52(4):969\u2013989,1987.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T01:39:35Z","timestamp":1707961175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36576-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}