{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:49:29Z","timestamp":1764251369094,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_17","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"264-278","source":"Crossref","is-referenced-by-count":11,"title":["Operational Nominal Game Semantics"],"prefix":"10.1007","author":[{"given":"Guilhem","family":"Jaber","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Ghica, D., Murawski, A., Ong, L., Stark, I.: Nominal games and full abstraction for the nu-calculus. In: Proceedings of LICS 2004, pp. 150\u2013159. IEEE (2004)","DOI":"10.1109\/LICS.2004.1319609"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: Proceedings of LICS 1998, pp. 334\u2013344. IEEE (1998)","DOI":"10.1109\/LICS.1998.705669"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163(2), 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Gabbay, M., Ghica, D.: Game semantics in the nominal model. In: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2012). Electronic Notes in Theoretical Computer Science, vol.\u00a0286, pp. 173\u2013189. Elsevier (2012)","DOI":"10.1016\/j.entcs.2012.08.012"},{"issue":"3-5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.: A new approach to abstract syntax with variable binding. Formal Aspects of computing\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Aspects of computing"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"17_CR7","unstructured":"Jaber, G.: A Logical Study of Program Equivalence. PhD thesis, \u00c9cole des Mines de Nantes (2014)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J. Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous p-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-73420-8_58","volume-title":"Automata, Languages and Programming","author":"J. Laird","year":"2007","unstructured":"Laird, J.: A fully abstract trace semantics for general references. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 667\u2013679. Springer, Heidelberg (2007)"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.apal.2007.10.006","volume":"151","author":"J. Laird","year":"2008","unstructured":"Laird, J.: A game semantics of names and pointers. Annals of Pure and Applied Logic\u00a0151(2), 151\u2013169 (2008)","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR11","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.\u00a06199, pp. 187\u2013198. Springer, Heidelberg (2010)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Levy, P., Staton, S.: Transition systems over games. In: Proceedings of LICS 2014, pp. 64:1\u201364:10 (2014)","DOI":"10.1145\/2603088.2603150"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Murawski, A., Tzevelekos, N.: Game semantics for good general references. In: Proceedings of LICS 2011, pp. 75\u201384. IEEE (2011)","DOI":"10.1109\/LICS.2011.31"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-31585-5_30","volume-title":"Automata, Languages, and Programming","author":"A. Murawski","year":"2012","unstructured":"Murawski, A., Tzevelekos, N.: Algorithmic games for full ground references. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 312\u2013324. Springer, Heidelberg (2012)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Murawski, A., Tzevelekos, N.: Full abstraction for reduced ml. Annals of Pure and Applied Logic (2013)","DOI":"10.1016\/j.apal.2013.05.007"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Automata, Languages and Programming","author":"J. Power","year":"1999","unstructured":"Power, J., Thielecke, H.: Closed freyd- and \u03ba-categories. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 625\u2013634. Springer, Heidelberg (1999)"}],"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-46678-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:42Z","timestamp":1747857462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}