{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:10:01Z","timestamp":1748815801680,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_4","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"55-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Game Semantics for Bounded Polymorphism"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","first-page":"3","volume":"133","author":"S Abramsky","year":"2004","unstructured":"Abramsky, S., Jagadeesan, R.: A game semantics for generic polymorphism. Ann. Pure Appl. Logic 133(1), 3\u201337 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR2","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., Thomas, W. (eds.) CSL 1997. LNCS, vol. 1414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"key":"4_CR3","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract games semantics for general references. In: Proceedings of the 13th Annual Symposium on Logic in Computer Science, LICS 1998, IEEE Press (1998)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(90)90151-7","volume":"70","author":"ES Bainbridge","year":"1990","unstructured":"Bainbridge, E.S., Freyd, P.J., Scedrov, A., Scott, P.J.: Functorial polymorphism. Theor. Comput. Sci. 70(1), 35\u201364 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"1\/2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0890-5401(90)90062-M","volume":"87","author":"K Bruce","year":"1990","unstructured":"Bruce, K., Longo, G.: A modest model of records, inheritance and bounded quantification. Inf. Comput. 87(1\/2), 196\u2013240 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L Cardelli","year":"1985","unstructured":"Cardelli, L., Wegner, P.: On understanding types, data abstraction and polymorphism. Comput. Surv. 17(4), 471\u2013522 (1985)","journal-title":"Comput. Surv."},{"issue":"1\u20132","key":"4_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/inco.1994.1013","volume":"109","author":"L Cardelli","year":"1994","unstructured":"Cardelli, L., Mitchell, J.C., Martini, S., Scedrov, A.: An extension of System F with subtyping. Inf. Comput. 109(1\u20132), 4\u201356 (1994)","journal-title":"Inf. Comput."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chroboczek, J.: Game semantics and subtyping. In: Proceedings of the Fifteenth Annual Symposium on Logic in Computer Science, pp. 192\u2013203. IEEE press (2000)","DOI":"10.1109\/LICS.2000.855769"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0960129500001134","volume":"2","author":"P-L Curien","year":"1992","unstructured":"Curien, P.-L., Ghelli, G.: Coherence of subsumption, minimum typing and type-checking in F. Math. Struct. Comput. Sci. 2(1), 55\u201391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"de Lataillade, J.: Dinatural terms in System F. In: Proceedings of the 24th Annual Symposium on Logic in Computer Science, LICS 2009, IEEE Press (2009)","DOI":"10.1109\/LICS.2009.30"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR12","unstructured":"Hughes, D.: Games and definability for System F. In: Proceedings of the Twelfth International Syposium on Logic in Computer Science, LICS 1997, IEEE Computer Society Press (1997)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Laird, J.: Game semantics for a polymorphic programming language. In: Proceedings of LICS 2010, IEEE Press (2010)","DOI":"10.1109\/LICS.2010.32"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-14162-1_16","volume-title":"Automata, Languages and Programming","author":"J Laird","year":"2010","unstructured":"Laird, J.: Game semantics for call-by-value polymorphism. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 187\u2013198. Springer, Heidelberg (2010)"},{"issue":"4","key":"4_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2508028.2505986","volume":"60","author":"J. Laird","year":"2013","unstructured":"Laird, J.: Game semantics for a polymorphic programming language. J. ACM 60(4) (2013)","journal-title":"Journal of the ACM"},{"key":"4_CR16","unstructured":"McCusker, G.: Games and full abstraction for a functional metalanguage with recursive types. Ph.D. thesis, Imperial College London, Published by Cambridge University Press (1996)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium","author":"JC Reynolds","year":"1974","unstructured":"Reynolds, J.C.: Towards a theory of type structure. In: Robinet, B. (ed.) Programming Symposium. Lecture Notes in Computer Science, vol. 19, pp. 408\u2013425. Springer, Heidelberg (1974)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:29:58Z","timestamp":1748813398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}