{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:53Z","timestamp":1776316913377,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603150","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Transition systems over games"],"prefix":"10.1145","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[{"name":"University of Birmingham"}]},{"given":"Sam","family":"Staton","sequence":"additional","affiliation":[{"name":"Radboud University Nijmegen"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"65","volume-title":"Research topics in Functional Programming","author":"Abramsky S.","year":"1990","unstructured":"Abramsky , S. : The lazy \u03bb-calculus . In: Research topics in Functional Programming , pp. 65 -- 117 . Addison Wesley ( 1990 ) Abramsky, S.: The lazy \u03bb-calculus. In: Research topics in Functional Programming, pp. 65--117. Addison Wesley (1990)"},{"key":"e_1_3_2_1_2_1","volume-title":"Semantics of interaction: an introduction to game semantics. In: 1996 CLiCS Summer School","author":"Abramsky S.","year":"1997","unstructured":"Abramsky , S. : Semantics of interaction: an introduction to game semantics. In: 1996 CLiCS Summer School . Cambridge University Press ( 1997 ) Abramsky, S.: Semantics of interaction: an introduction to game semantics. In: 1996 CLiCS Summer School. Cambridge University Press (1997)"},{"key":"e_1_3_2_1_3_1","volume-title":"G.: A fully abstract game semantics for general references. In: 13th LICS (1998)","author":"Abramsky S.","unstructured":"Abramsky , S. , Honda , K. , McCusker , G.: A fully abstract game semantics for general references. In: 13th LICS (1998) Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: 13th LICS (1998)"},{"key":"e_1_3_2_1_4_1","volume-title":"Ong","author":"Blum W.","year":"2009","unstructured":"Blum , W. , Ong , C. H. L. : The safe lambda calculus. Logical Methods in Computer Science 5(1) ( 2009 ) Blum, W., Ong, C. H. L.: The safe lambda calculus. Logical Methods in Computer Science 5(1) (2009)"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129598002631"},{"key":"e_1_3_2_1_6_1","volume-title":"Regnier","author":"Danos V.","year":"1996","unstructured":"Danos , V. , Herbelin , H. , Regnier , L. : Game semantics and abstract machines. In: 11th LICS ( 1996 ) Danos, V., Herbelin, H., Regnier, L.: Game semantics and abstract machines. In: 11th LICS (1996)"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2012.08.013"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_1_11_1","volume-title":"Semantics and Logics of Computation","author":"Hyland J. M. E.","year":"1997","unstructured":"Hyland , J. M. E. : Game semantics . In: Semantics and Logics of Computation . Cambridge University Press ( 1997 ) Hyland, J. M. E.: Game semantics. In: Semantics and Logics of Computation. Cambridge University Press (1997)"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Hyvernat P.: A linear category of polynomial diagrams. Mathematical Structures in Computer Science 24 (2013)  Hyvernat P.: A linear category of polynomial diagrams. Mathematical Structures in Computer Science 24 (2013)","DOI":"10.1017\/S0960129512001016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218563.1218577"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2011.18"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_29"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.012"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.024"},{"key":"e_1_3_2_1_18_1","volume":"175","author":"Lack S.","year":"2002","unstructured":"Lack , S. , Street , R. : The formal theory of monads II. Journal of Pure and Applied Algebra 175 ( 2002 ) Lack, S., Street, R.: The formal theory of monads II. Journal of Pure and Applied Algebra 175 (2002)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"e_1_3_2_1_19_1","volume-title":"12th LICS (1997)","author":"Laird J.","unstructured":"Laird , J. : Full abstraction for functional languages with control . In: 12th LICS (1997) Laird, J.: Full abstraction for functional languages with control. In: 12th LICS (1997)"},{"key":"e_1_3_2_1_20_1","volume-title":"16th LICS (2001)","author":"Laird J.","unstructured":"Laird , J. : A fully abstract game semantics of local exceptions . In: 16th LICS (2001) Laird, J.: A fully abstract game semantics of local exceptions. In: 16th LICS (2001)"},{"key":"e_1_3_2_1_21_1","volume-title":"34th International Colloquium on Automata, Languages and Programming, LNCS 4596 (2007)","author":"Laird J.","unstructured":"Laird , J. : A fully abstract trace semantics for general references. In : 34th International Colloquium on Automata, Languages and Programming, LNCS 4596 (2007) Laird, J.: A fully abstract trace semantics for general references. In: 34th International Colloquium on Automata, Languages and Programming, LNCS 4596 (2007)"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.32"},{"key":"e_1_3_2_1_23_1","volume-title":"37th International Colloquium on Automata, Languages and Programming, LNCS 6199 (2010)","author":"Laird J.","unstructured":"Laird , J. : Game semantics for call-by-value polymorphism. In : 37th International Colloquium on Automata, Languages and Programming, LNCS 6199 (2010) Laird, J.: Game semantics for call-by-value polymorphism. In: 37th International Colloquium on Automata, Languages and Programming, LNCS 6199 (2010)"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.15"},{"key":"e_1_3_2_1_25_1","volume-title":"Levy","author":"Lassen S. B.","year":"2007","unstructured":"Lassen , S. B. , Levy , P. B. : Typed normal form bisimulation. In: 23rd CSL, LNCS , 4646 ( 2007 ) Lassen, S. B., Levy, P. B.: Typed normal form bisimulation. In: 23rd CSL, LNCS, 4646 (2007)"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.26"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.31"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1042"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"St\u00f8vring K. Lassen S.: A complete co-inductive syntactic theory of sequential control and state. In: Semantics and Algebraic Specification Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday LNCS 5700 (2009)   St\u00f8vring K. Lassen S.: A complete co-inductive syntactic theory of sequential control and state. In: Semantics and Algebraic Specification Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday LNCS 5700 (2009)","DOI":"10.1007\/978-3-642-04164-8_17"},{"key":"e_1_3_2_1_30_1","volume-title":"LICS: IEEE Symposium on Logic in Computer Science (1997)","author":"Turi","unstructured":"Turi , Plotkin : Towards a mathematical operational semantics . In: LICS: IEEE Symposium on Logic in Computer Science (1997) Turi, Plotkin: Towards a mathematical operational semantics. In: LICS: IEEE Symposium on Logic in Computer Science (1997)"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37075-5_27"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","location":"Vienna Austria","acronym":"CSL-LICS '14","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603150","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:41Z","timestamp":1750230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":31,"alternative-id":["10.1145\/2603088.2603150","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603150","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}