{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:04:47Z","timestamp":1765667087270},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_11","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:30:31Z","timestamp":1395394231000},"page":"164-179","source":"Crossref","is-referenced-by-count":2,"title":["Game Semantics for Nominal Exceptions"],"prefix":"10.1007","author":[{"given":"Andrzej S.","family":"Murawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Tzevelekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L., Stark, I.D.B.: Nominal games and full abstraction for the nu-calculus. In: LICS 2004 (2004)","DOI":"10.1109\/LICS.2004.1319609"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"issue":"1-2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(99)00039-0","volume":"221","author":"K. Honda","year":"1999","unstructured":"Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. Theoretical Computer Science\u00a0221(1-2), 393\u2013456 (1999)","journal-title":"Theoretical Computer Science"},{"key":"11_CR4","unstructured":"Laird, J.: A semantic analysis of control. PhD thesis, University of Edinburgh (1998)"},{"key":"11_CR5","unstructured":"Laird, J.: A fully abstract games semantics of local exceptions. In: LICS 2001 (2001)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-24727-2_21","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Laird","year":"2004","unstructured":"Laird, J.: A game semantics of local names and good variables. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 289\u2013303. Springer, Heidelberg (2004)"},{"key":"11_CR7","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. Ann. Pure Appl. Logic\u00a0151, 151\u2013169 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Laird, J.: Combining and relating control effects and their semantics. In: COS (2013)","DOI":"10.4204\/EPTCS.127.8"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. and Comput.\u00a093, 55\u201392 (1991)","journal-title":"Inf. and Comput."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Tzevelekos, N.: Game semantics for good general references. In: LICS 2011 (2011)","DOI":"10.1109\/LICS.2011.31"},{"key":"11_CR11","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.S. Murawski","year":"2012","unstructured":"Murawski, A.S., 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)"},{"issue":"11","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.apal.2013.05.007","volume":"164","author":"A.S. Murawski","year":"2013","unstructured":"Murawski, A.S., Tzevelekos, N.: Full abstraction for Reduced ML. Ann. Pure Appl. Logic\u00a0164(11), 1118\u20131143 (2013)","journal-title":"Ann. Pure Appl. Logic"},{"key":"11_CR13","unstructured":"Reynolds, J.C.: The essence of Algol. In: de Bakker, J.W., van Vliet, J.C. (eds.) Algorithmic Languages, pp. 345\u2013372. North Holland (1981)"},{"key":"11_CR14","unstructured":"Stark, I.D.B.: Names and Higher-Order Functions. PhD thesis, University of Cambridge, Technical Report No. 363 (1995)"},{"key":"11_CR15","unstructured":"Tzevelekos, N.: Nominal game semantics. D.Phil. thesis, Oxford University (2008)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Full abstraction for nominal general references. LMCS\u00a05(3) (2009)","DOI":"10.2168\/LMCS-5(3:8)2009"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:58:10Z","timestamp":1558857490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}