{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:18Z","timestamp":1759638618366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":78,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319060248"},{"type":"electronic","value":"9783319060255"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06025-5_5","type":"book-chapter","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T12:47:27Z","timestamp":1409057247000},"page":"121-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Intensionality, Definability and Computation"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky S (1997) Semantics of interaction: an introduction to game semantics. In: Dybjer P, Pitts A (eds) Semantics and logics of computation. Publications of the Newton Institute, Cambridge University Press, pp 1\u201331","DOI":"10.1017\/CBO9780511526619.002"},{"key":"5_CR2","unstructured":"Abramsky S (1999) Axioms for definability and full completeness. In: Plotkin G, Tofte M, Stirling C (eds) Proof, language and interaction: essays in honour of Robin Milner. MIT Press, Cambridge, pp 55\u201375"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky S (2001) Algorithmic game semantics. In: Schwichtenberg H, Steinbr\u00fcggen R (eds) Proof and system-reliability: proceedings of the NATO advanced study institute. Kluwer Academic Publishers, Marktoberdorf, pp 21\u201347 (24 July\u20135 Aug 2001)","DOI":"10.1007\/978-94-010-0413-8_2"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2005.12.075","volume":"162","author":"S Abramsky","year":"2006","unstructured":"Abramsky S (2006) What are the fundamental structures of concurrency?: we still don\u2019t know!. Electron Notes Theoret Comput Sci 162:37\u201341","journal-title":"Electron Notes Theoret Comput Sci"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Abramsky S (2007) Temperley-Lieb algebra: from knot theory to logic and computation via quantum mechanics. In: Chen G, Kauffman L, Lomonaco S (eds) Mathematics of quantum computing and technology, Taylor and Francis, New York, pp 415\u2013458","DOI":"10.1201\/9781584889007.ch15"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Abramsky S, Ghica DR, Murawski AS, Ong CHL, Stark IDB (2004) Nominal games and full abstraction for the nu-calculus. In: Proceedings of the 19th annual IEEE symposium on logic in computer science, pp 150\u2013159","DOI":"10.1109\/LICS.2004.1319609"},{"key":"5_CR7","unstructured":"Abramsky S, Ghica DR, Murawski AS, Ong CHL (2003) Algorithmic game semantics and component-based verification. In: SAVCBS 2003, specification and verification of component-based systems, p 66"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Abramsky S, Ghica D, Murawski A, Ong CHL (2004) Applying game semantics to compositional software modeling and verification. In: Conference on tools and algorithms for the construction and analysis of systems. Lecture Notes in Computer Science, vol 2988. Springer, pp 421\u2013435","DOI":"10.1007\/978-3-540-24730-2_32"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Abramsky S, Honda K, McCusker G (1998) A fully abstract game semantics for general references. In: Proceedings of 13th annual IEEE symposium on logic in computer science, pp 334\u2013344","DOI":"10.1109\/LICS.1998.705669"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S Abramsky","year":"1994","unstructured":"Abramsky S, Jagadeesan R (1994) Games and full completeness for multiplicative linear logic. J Symb Log 59(2):543\u2013574","journal-title":"J Symb Log"},{"issue":"2","key":"5_CR11","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 (2000) Full abstraction for PCF. Inf Comput 163(2):409\u2013470","journal-title":"Inf Comput"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Abramsky S, McCusker G (1997) Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. In: O\u2019Hearn P, Tennent RD (eds) Algol-like languages, Birkhauser, pp 317\u2013348","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Abramsky S, McCusker G (1998) Call-by-value games. In: Proceedings of computer science logic, Springer, pp 1\u201317","DOI":"10.1007\/BFb0028004"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Abramsky S, McCusker G (1999) Game semantics. In: Schwichtenberg H, Berger U (eds) Computational logic: proceedings of the 1997 Marktoberdorf summer school, Springer, pp 1\u201355","DOI":"10.1007\/978-3-642-58622-4_1"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Abramsky S, Mellies PA (1999) Concurrent games and full completeness. In: Proceedings of 14th symposium on logic in computer science, pp 431\u2013442","DOI":"10.1109\/LICS.1999.782638"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0305004108001783","volume":"146","author":"S Awodey","year":"2009","unstructured":"Awodey S, Warren MA (2009) Homotopy theoretic models of identity types. Math Proc Camb Phil Soc 146(1):45\u201355","journal-title":"Math Proc Camb Phil Soc"},{"key":"5_CR17","unstructured":"Barendregt HP (1984) The lambda calculus: its syntax and semantics, vol 103. Studies in Logic and the Foundations of Mathematics, North Holland"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G Berry","year":"1982","unstructured":"Berry G, Curien PL (1982) Sequential algorithms on concrete data structures. Theoret Comput Sci 20(3):265\u2013321","journal-title":"Theoret Comput Sci"},{"key":"5_CR19","unstructured":"Church A (1941) The calculi of lambda-conversion, vol 6. Princeton University Press, Princeton"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ic.2011.12.006","volume":"214","author":"PL Curien","year":"2012","unstructured":"Curien PL, Faggian C (2012) An approach to innocent strategies as graphs. Inf Comput 214:119\u2013155","journal-title":"Inf Comput"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Cutland N (1980) Computability: an introduction to recursive function theory. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9781139171496"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V Danos","year":"2002","unstructured":"Danos V, Harmer RS (2002) Probabilistic game semantics. ACM Trans Comput Log 3(3):359\u2013382","journal-title":"ACM Trans Comput Log"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Gandy R (1980) Church\u2019s thesis and principles for mechanisms. In: Barwise J, Keisler HJ, Kunen K (eds) The kleene symposium of studies in logic and the foundations of mathematics, vol 101. Elsevier, Amsterdam, pp 123\u2013148","DOI":"10.1016\/S0049-237X(08)71257-6"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Ghica DR (2009) Applications of game semantics: from program analysis to hardware synthesis. In: Proceedings of 24th Annual IEEE Symposium on logic in computer science, pp 17\u201326","DOI":"10.1109\/LICS.2009.26"},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"DR Ghica","year":"2003","unstructured":"Ghica DR, McCusker G (2003) The regular-language semantics of second-order idealized ALGOL. Theoret Comput Sci 309(1):469\u2013502","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.apal.2007.10.005","volume":"151","author":"DR Ghica","year":"2008","unstructured":"Ghica DR, Murawski AS (2008) Angelic semantics of fine-grained concurrency. Ann Pure Appl Log 151(2):89\u2013114","journal-title":"Ann Pure Appl Log"},{"key":"5_CR27","unstructured":"Gunter CA (1992) Semantics of programming languages: structures and techniques. MIT press, Cambridge"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Harmer R, Hyland H, Mellies PA (2007) Categorical combinatorics for innocent strategies. In: 22nd annual IEEE symposium on logic in computer science, pp 379\u2013388","DOI":"10.1109\/LICS.2007.14"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Harmer R, McCusker G (1999) A fully abstract game semantics for finite nondeterminism. In: 14th annual IEEE symposium on logic in computer science, pp 422\u2013430","DOI":"10.1109\/LICS.1999.782637"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Hintikka J, Sandu G (1997) Game-theoretical semantics. In: van Benthem J, ter Meulen A (eds) Handbook of logic and language, Elsevier, Amsterdam, pp 361\u2013410","DOI":"10.1016\/B978-044481714-3\/50009-6"},{"issue":"8","key":"5_CR31","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare CAR (1978) Communicating sequential processes. Commun ACM 21(8):666\u2013677","journal-title":"Commun ACM"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Honda K, Yoshida N (1997) Game theoretic analysis of call-by-value computation: automata, languages and programming, Springer, Berlin, pp 225\u2013236","DOI":"10.1007\/3-540-63165-8_180"},{"key":"5_CR33","unstructured":"Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages, and computation. Addison-Wesley, Cambridge"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J Hughes","year":"1989","unstructured":"Hughes J (1989) Why functional programming matters. Comput J 32(2):98\u2013107","journal-title":"Comput J"},{"issue":"2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland JME, Ong CHL (2000) On full abstraction for PCF: I, II, and III. Inf Comput 163(2):285\u2013408","journal-title":"Inf Comput"},{"issue":"4","key":"5_CR36","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene SC (1938) On notation for ordinal numbers. J Symb Log 3(4):150\u2013155","journal-title":"J Symb Log"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Kleene SC (1978) Recursive functionals and quantifiers of finite types revisited I. In: Fenstad JE, Gandy RO, Sacks GE (eds) Generalized recursion theory II: proceedings of the 1977 Oslo symposium of studies in logic and the foundations of mathematics, vol 94. Amsterdam, pp 185\u2013222","DOI":"10.1016\/S0049-237X(08)70933-9"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Kleene SC (1980) Recursive functionals and quantifiers of finite types revisited II. In: Barwise J, Keisler HJ, Kunen K (eds) The Kleene symposium of studies in logic and the foundations of mathematics, vol 101. Elsevier, pp 1\u201329","DOI":"10.1016\/S0049-237X(08)71251-5"},{"key":"#cr-split#-5_CR39.1","doi-asserted-by":"crossref","unstructured":"Kleene SC (1982) Recursive functionals and quantifiers of finite types revisited III. In: Metakides G","DOI":"10.1016\/S0049-237X(08)71355-7"},{"key":"#cr-split#-5_CR39.2","unstructured":"(ed) Patras logic symposion: proceedings of studies in logic and the foundations of mathematics, logic symposion held at Patras, Greece, vol 109. Elsevier, pp 1-40, Aug 18-22 1982"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1090\/pspum\/042\/791054","volume":"42","author":"SC Kleene","year":"1985","unstructured":"Kleene SC (1985) Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV). Recur Theory 42:119\u2013138","journal-title":"Recur Theory"},{"key":"5_CR41","first-page":"593","volume":"325","author":"SC Kleene","year":"1991","unstructured":"Kleene SC (1991) Recursive functionals and quantifiers of finite types revisited V. Trans Am Math Soc 325:593\u2013630","journal-title":"Trans Am Math Soc"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Kripke S (1965) Semantical analysis of intuitionistic logic I. In: Formal systems and recursive functions, studies in logic and foundations of mathematics, North Holland, pp 92\u2013130","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S1571-0661(04)80965-4","volume":"45","author":"J Laird","year":"2001","unstructured":"Laird J (2001) A game semantics of idealized CSP. Electron Notes Theor Comput Sci 45:232\u2013257","journal-title":"Electron Notes Theor Comput Sci"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Laird J (2001) A fully abstract game semantics of local exceptions. In: 16th annual IEEE symposium on logic in computer science, pp 105\u2013114","DOI":"10.1109\/LICS.2001.932487"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Laird J (2003) A game semantics of linearly used continuations. In: Foundations of software science and computation structures, Springer, pp 313\u2013327","DOI":"10.1007\/3-540-36576-1_20"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Laird J (2005) A game semantics of the asynchronous $$\\pi $$-calculus. CONCUR 2005-concurrency theory, pp 51\u201365","DOI":"10.1007\/11539452_8"},{"issue":"3","key":"5_CR47","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"PJ Landin","year":"1966","unstructured":"Landin PJ (1966) The next 700 programming languages. Commun ACM 9(3):157\u2013166","journal-title":"Commun ACM"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Legay A, Murawski A, Ouaknine J, Worrell J (2008) On automated verification of probabilistic programs: tools and algorithms for the construction and analysis of Systems, pp 173\u2013187","DOI":"10.1007\/978-3-540-78800-3_13"},{"issue":"3","key":"5_CR49","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","volume":"14","author":"JL Lassez","year":"1982","unstructured":"Lassez JL, Nguyen VL, Sonenberg E (1982) Fixed point theorems and semantics: a folk tale. Inf Process Lett 14(3):112\u2013116","journal-title":"Inf Process Lett"},{"issue":"1","key":"5_CR50","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(00)00194-8","volume":"266","author":"R Loader","year":"2001","unstructured":"Loader R (2001) Finitary PCF is not decidable. Theor Comput Sci 266(1):341\u2013364","journal-title":"Theor Comput Sci"},{"key":"5_CR51","first-page":"187","volume":"4","author":"P Lorenzen","year":"1960","unstructured":"Lorenzen P (1960) Logik und agon. Atti Congr Int di Filosofia 4:187\u2013194","journal-title":"Atti Congr Int di Filosofia"},{"issue":"2","key":"5_CR52","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"PA Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s PA (2006) Asynchronous games 2: the true concurrency of innocence. Theor Comput Sci 358(2):200\u2013228","journal-title":"Theor Comput Sci"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Mellies PA (2012) Game semantics in string diagrams. In: 27th annual IEEE symposium on logic in computer science, pp 481\u2013490","DOI":"10.1109\/LICS.2012.58"},{"issue":"1","key":"5_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R Milner","year":"1977","unstructured":"Milner R (1977) Fully abstract models of typed $$\\lambda $$-calculi. Theor Comput Sci 4(1):1\u201322","journal-title":"Theor Comput Sci"},{"key":"5_CR55","unstructured":"Milner R (1989) Communication and concurrency. Prentice-Hall, Upper Saddle River"},{"key":"5_CR56","unstructured":"Milner R (1999) Communicating and mobile systems: the pi calculus. Cambridge University Press, Cambridge"},{"issue":"2","key":"5_CR57","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2178\/bsl\/1286889124","volume":"16","author":"YN Moschovakis","year":"2010","unstructured":"Moschovakis YN (2010) Kleene\u2019s amazing second recursion theorem. Bull Symb Log 16(2):189\u2013239","journal-title":"Bull Symb Log"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"Murawski A, Tzevelekos T (2009) Full abstraction for reduced ML: foundations of software science and computational structures, pp 32\u201347","DOI":"10.1007\/978-3-642-00596-1_4"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Murawski A, Tzevelekos T (2011) Algorithmic nominal game semantics. In: Proceedings of the 20th European symposium on programming, Lecture Notes in Computer Science, vol 6602. Springer, pp 419\u2013438","DOI":"10.1007\/978-3-642-19718-5_22"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Murawski AS, Tzevelekos N (2011) Game semantics for good general references. In: 26th annual IEEE symposium on logic in computer science, pp 75\u201384","DOI":"10.1109\/LICS.2011.31"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"Murawski AS, Tzevelekos N (2012) Algorithmic games for full ground references. In: Proceedings of the 39th international colloquium on automata, languages and programming, Lecture Notes in Computer Science, vol 7392. pp 312\u2013324","DOI":"10.1007\/978-3-642-31585-5_30"},{"issue":"4","key":"5_CR62","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1002\/malq.19550010407","volume":"1","author":"J Myhill","year":"1955","unstructured":"Myhill J, Shepherdson JC (1955) Effective operations on partial recursive functions. Math Log Quart 1(4):310\u2013317","journal-title":"Math Log Quart"},{"key":"5_CR63","unstructured":"Myhill JR (1957) Finite automata and the representation of events. Technical Report WADD TR-57-624, Wright Patterson AFB"},{"issue":"4","key":"5_CR64","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode A (1958) Linear automaton transformations. Proc Am Math Soc 9(4):541\u2013544","journal-title":"Proc Am Math Soc"},{"key":"5_CR65","unstructured":"Petri CA (1962) Fundamentals of a theory of asynchronous information flow. In: IFIP Congress 1962, Amsterdam, pp 386\u2013390"},{"key":"5_CR66","unstructured":"Petri CA (1966) Communication with automata, New York: Griffiss Air Force Base. vol. 1, suppl. no. 1. Tech Rep RADC-TR-65-377"},{"issue":"3","key":"5_CR67","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin GD (1977) LCF considered as a programming language. Theor Comput Sci 5(3):223\u2013255","journal-title":"Theor Comput Sci"},{"key":"5_CR68","unstructured":"Rogers H (1967) Theory of recursive functions and effective computability. McGraw Hill, New York"},{"key":"5_CR69","unstructured":"Sieg W (2002) Calculations by man and machine: mathematical presentation. In: G\u00e4rdenfors P, Wolenski J, Kijania-Placek K (eds) Proceedings of the 11th international conference on logic, methodology and philsophy of science, Vol 1. Kluwer Academic Publishers, pp 247\u2013262"},{"issue":"2","key":"5_CR70","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"AM Turing","year":"1937","unstructured":"Turing AM (1937) On computable numbers, with an application to the entscheidungs problem. Proc Lond Math Soc 42(2):230\u2013265","journal-title":"Proc Lond Math Soc"},{"key":"5_CR71","doi-asserted-by":"crossref","unstructured":"Turner D (1995) Elementary strong functional programming. In: Functional programming languages in education, Springer, pp 1\u201313","DOI":"10.1007\/3-540-60675-0_35"},{"key":"5_CR72","doi-asserted-by":"crossref","unstructured":"Tzevelekos N (2007) Full abstraction for nominal general references. In: 22nd annual IEEE symposium on logic in computer science, pp 399\u2013410","DOI":"10.1109\/LICS.2007.21"},{"key":"5_CR73","doi-asserted-by":"crossref","unstructured":"Voevodsky V (2010) Univalent foundations project, NSF grant application","DOI":"10.1007\/978-3-642-20920-8_4"},{"key":"5_CR74","doi-asserted-by":"crossref","unstructured":"Wadler P (1992) The essence of functional programming. In: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on principles of programming languages, pp 1\u201314","DOI":"10.1145\/143165.143169"},{"key":"5_CR75","doi-asserted-by":"crossref","unstructured":"Winskel G (1987) Event structures. In: Brauer W, Reisig W, Rozenberg G (eds) Proceedings of an advanced course on Petri nets: Applications and relationships to other models of concurrency, advances in Petri nets 1986, Part II, LNCS, Bad Honnef, September 1986, vol 255. Springer, pp 325\u2013392","DOI":"10.1007\/3-540-17906-2_31"},{"key":"5_CR76","doi-asserted-by":"crossref","unstructured":"Winskel G (1993) The formal semantics of programming languages: an introduction. MIT press, Cambridge","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"5_CR77","doi-asserted-by":"crossref","unstructured":"Winskel G (2012) Bicategories of concurrent games. In Foundations of Software Science and Computational Structures, Springer Berlin Heidelberg, pp 26\u201341","DOI":"10.1007\/978-3-642-28729-9_2"}],"container-title":["Outstanding Contributions to Logic","Johan van Benthem on Logic and Information Dynamics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06025-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T20:39:57Z","timestamp":1676579997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06025-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319060248","9783319060255"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06025-5_5","relation":{},"ISSN":["2211-2758","2211-2766"],"issn-type":[{"type":"print","value":"2211-2758"},{"type":"electronic","value":"2211-2766"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}