{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:10:49Z","timestamp":1725563449112},"publisher-location":"London","reference-count":33,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848829114"},{"type":"electronic","value":"9781848829121"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-84882-912-1_2","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T12:27:13Z","timestamp":1282307233000},"page":"33-45","source":"Crossref","is-referenced-by-count":3,"title":["From CSP to Game Semantics"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,21]]},"reference":[{"key":"2_CR1","first-page":"1","volume-title":"Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute","author":"S Abramsky","year":"1997","unstructured":"Abramsky, S.: Semantics of interaction: an introduction to game semantics. In: Dybjer, P., Pitts, A. (eds.), Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute, pp. 1\u201331. Cambridge University Press (1997)."},{"key":"2_CR2","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. Inform. Comput. 163, 409\u2013470 (2000).","journal-title":"Inform. Comput."},{"key":"2_CR3","volume-title":"Algorithmic game semantics: a tutorial introduction","author":"S Abramsky","year":"2002","unstructured":"Abramsky, S.: Algorithmic game semantics: a tutorial introduction. In: Proof System-Reliability. Kluwer (2002)."},{"key":"2_CR4","first-page":"37","volume-title":"What are the fundamental structures of concurrency?: We still don\u2019t know! Electr. Notes Theor. Comput. Sci. (ENTCS) 162","author":"S Abramsky","year":"2006","unstructured":"Abramsky, S.: What are the fundamental structures of concurrency?: We still don\u2019t know! Electr. Notes Theor. Comput. Sci. (ENTCS) 162, 37\u201341 (2006)."},{"key":"2_CR5","first-page":"415","volume-title":"Mathematics of Quantum Computation and Quantum Technology","author":"S Abramsky","year":"2007","unstructured":"Abramsky, S.: Temperley-Lieb algebra: from knot theory to logic and computation via quantum mechanics. In: Chen, G., Kauffman, L., Lomonaco, S., (eds.), Mathematics of Quantum Computation and Quantum Technology, Taylor & Francis. pp. 415\u2013458 (2007)."},{"key":"2_CR6","first-page":"150","volume-title":"Nominal games and full abstraction for the nu-calculus","author":"S Abramsky","year":"2004","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Stark, I.D.B., Ong. C.-H.L.: Nominal games and full abstraction for the nu-calculus. In: Proceedings LICS 150\u2013159 (2004)."},{"key":"2_CR7","first-page":"334","volume-title":"A fully abstract game semantics for general references","author":"S Abramsky","year":"1998","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: Proceedings LiCS 334\u2013344 (1998)."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. J. Symbolic Logic 59, 543\u2013574 (1994).","journal-title":"J. Symbolic Logic"},{"key":"2_CR9","first-page":"317","volume-title":"Algol-Like Languages","author":"S Abramsky","year":"1997","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state. In: O\u2019Hearn, P., Tennent, R.D. (eds.) Algol-Like Languages, pp. 317\u2013348. Birkhauser (1997)."},{"key":"2_CR10","first-page":"431","volume-title":"Concurrent games and full completeness","author":"S Abramsky","year":"1999","unstructured":"Abramsky, S., Mellies, P.-A.: Concurrent games and full completeness. In: Proceedings LiCS 431\u2013442 (1999)."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V Danos","year":"2002","unstructured":"Danos, V., Harmer, R.: Probabilistic game semantics. ACM Trans. Comput. Log. 3(3), 359\u2013382 (2002).","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20133","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2004.05.002","volume":"131","author":"R Blute","year":"2005","unstructured":"Blute, R., Hamano, M., Scott, P.J.: Softness of hypercoherences and MALL full completeness. Ann. Pure Appl. Logic 131(1\u20133), 1\u201363 (2005).","journal-title":"Ann. Pure Appl. Logic"},{"key":"2_CR13","first-page":"234","volume-title":"Full completeness of the multiplicative linear logic of Chu spaces","author":"H Devarajan","year":"1999","unstructured":"Devarajan, H., Hughes, D., Plotkin, G., Pratt, V.: Full completeness of the multiplicative linear logic of Chu spaces. In: Proceedings LiCS 234\u2013242 (1999)."},{"key":"2_CR14","first-page":"103","volume-title":"Reasoning about idealized algol using regular languages","author":"DR Ghica","year":"2000","unstructured":"Ghica, D.R., McCusker, G.: Reasoning about idealized algol using regular languages. In: Proccedings ICALP\u201900, pp. 103\u2013116 (2000). LNCS 1853."},{"key":"2_CR15","first-page":"211","volume-title":"Angelic semantics of fine-grained concurrency","author":"DR Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. In: Proccedings FOSSACS\u201904, pp. 211\u2013225 (2004). LNCS 2987."},{"key":"2_CR16","volume-title":"A fully abstract game semantics for finite nondeterminism","author":"R Harmer","year":"1999","unstructured":"Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings LiCS (1999)."},{"key":"2_CR17","volume-title":"Game-theoretical semantics, in van Benthem and ter Meulen. Handbook of Logic and Language","author":"J Hintikka","year":"1996","unstructured":"Hintikka, J., Sandu, G.: Game-theoretical semantics, in van Benthem and ter Meulen. Handbook of Logic and Language. Elsevier (1996)."},{"key":"2_CR18","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF. Inform. Comput. 163, 285\u2013408, (2000).","journal-title":"Inform. Comput."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"PJ Landin","year":"1966","unstructured":"Landin, P.J.: The next 700 programming languages. Commun. ACM (CACM) 9(3), 157\u2013166 (1966).","journal-title":"Commun. ACM (CACM)"},{"key":"2_CR21","volume-title":"Full abstraction for functional languages with control","author":"J Laird","year":"1997","unstructured":"Laird, J.: Full abstraction for functional languages with control. Extended abstract. In: Proceedings LICS (1997)."},{"key":"2_CR22","volume-title":"A fully abstract games semantics of local exceptions","author":"J Laird","year":"2001","unstructured":"Laird, J.: A fully abstract games semantics of local exceptions. Extended abstract. In: Proceedings LICS (2001)."},{"key":"2_CR23","first-page":"417","volume-title":"Game semantics for higher-order concurrency","author":"J Laird","year":"2006","unstructured":"Laird, J.: Game semantics for higher-order concurrency. In: Proceedings FSTTCS 2006, Springer LNCS Vol. 4337 pp. 417\u2013428 (2006)."},{"key":"2_CR24","first-page":"173","volume-title":"On automated verification of probabilistic programs","author":"A Legay","year":"2008","unstructured":"Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.: On automated verification of probabilistic programs. TACAS 173\u2013187 (2008)."},{"key":"2_CR25","volume-title":"Models of lambda calculi and linear logic","author":"R Loader","year":"1994","unstructured":"Loader, R.: Models of lambda calculi and linear logic. D.Phil. thesis, Oxford University (1994)."},{"key":"2_CR26","first-page":"193","volume-title":"Ein dialogisches Konstruktivit\u00e4tskriterium","author":"P Lorenzen","year":"1961","unstructured":"Lorenzen, P.: Ein dialogisches Konstruktivit\u00e4tskriterium. In: Infinitistic Methods, 193\u2013200 (1961)."},{"key":"2_CR27","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I Inf. Comput. 100(1), 1\u201340 (1992).","journal-title":"I Inf. Comput."},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, II Inf. Comput. 100(1), 41\u201377 (1992).","journal-title":"II Inf. Comput."},{"key":"2_CR30","volume-title":"Communicating and Mobile Systems: The Pi Calculus","author":"R Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: The Pi Calculus. Cambridge University Press (1999)."},{"key":"2_CR31","first-page":"176","volume-title":"The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes LICS","author":"J Parrow","year":"1998","unstructured":"Parrow, J., Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes LICS 1998: 176\u2013185."},{"key":"2_CR32","volume-title":"The Theory and Practice of Concurrency","author":"AW Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1997)."},{"key":"2_CR33","first-page":"399","volume-title":"Full abstraction for nominal general references","author":"N Tzevelekos","year":"2007","unstructured":"Tzevelekos, N.: Full abstraction for nominal general references. In: Proceedings LICS pp. 399\u2013410 (2007)."}],"container-title":["Reflections on the Work of C.A.R. Hoare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84882-912-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T04:10:48Z","timestamp":1558843848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84882-912-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781848829114","9781848829121"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-1-84882-912-1_2","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}