{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:39Z","timestamp":1725474639509},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_38","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"417-428","source":"Crossref","is-referenced-by-count":8,"title":["Game Semantics for Higher-Order Concurrency"],"prefix":"10.1007","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"38_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0956796898003165","volume":"8","author":"W. Ferreira","year":"1998","unstructured":"Ferreira, W., Hennessy, M., Jeffrey, A.S.A.: A theory of weak bisimulation for core CML. J. Functional Programming\u00a08(5), 447\u2013491 (1998)","journal-title":"J. Functional Programming"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"D. Ghica","year":"2003","unstructured":"Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoretical Computer Science\u00a0309, 469\u2013502 (2003)","journal-title":"Theoretical Computer Science"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-24727-2_16","volume-title":"Foundations of Software Science and Computation Structures","author":"D.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"38_CR4","volume-title":"Proceedings of LICS 1999","author":"R. Harmer","year":"1998","unstructured":"Harmer, R., McCusker, G.: A fully abstract games semantics for finite non-determinism. In: Proceedings of LICS 1999. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"K. Honda","year":"1997","unstructured":"Honda, K., Yoshida, N.: Game theoretic analysis of call-by-value computation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256. Springer, Heidelberg (1997)"},{"key":"38_CR6","volume-title":"Proceedings of LICS 1997","author":"D. Hughes","year":"1997","unstructured":"Hughes, D.: Games and definability for System F. In: Proceedings of LICS 1997. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163, 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science\u00a01(1:4) (2002)","DOI":"10.2168\/LMCS-1(1:4)2005"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A., Rathke, J.: A fully abstract testing semantics for concurrent objects. In: Proceedings of LICS 2002, pp. 101\u2013112 (2002)","DOI":"10.1109\/LICS.2002.1029820"},{"key":"38_CR10","series-title":"Electronic notes in Theoretical Computer Science","volume-title":"Proceedings of MFPS XVII","author":"J. Laird","year":"2001","unstructured":"Laird, J.: A game semantics of ICSP. In: Proceedings of MFPS XVII. Electronic notes in Theoretical Computer Science, vol.\u00a045. Elsevier, Amsterdam (2001)"},{"key":"38_CR11","unstructured":"Laird, J.: A game semantics of names and pointers. Annals of Pure and Applied Logic (to appear, 2005), Available from: http:\/\/www.cogs.susx.ac.uk\/users\/jiml"},{"key":"38_CR12","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":"38_CR13","doi-asserted-by":"crossref","unstructured":"Laurent, O.: Polarized games. In: Proceedings of LICS 2002 (2002)","DOI":"10.1109\/LICS.2002.1029835"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BFb0055067","volume-title":"Automata, Languages and Programming","author":"P. Malacaria","year":"1998","unstructured":"Malacaria, P., Hankin, C.: Generalised flowcharts and games. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, p. 363. Springer, Heidelberg (1998)"},{"key":"38_CR15","unstructured":"McCusker, G.: Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London (1996)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Power, J., Robinson, E.: Premonoidal categories and notions of computation. Mathematical Structures in Computer Science (1997)","DOI":"10.1017\/S0960129597002375"},{"key":"38_CR17","first-page":"293","volume-title":"Proceedings of PLDI 1991","author":"J. Reppy","year":"1991","unstructured":"Reppy, J.: CML: A higher-order concurrent language. In: Proceedings of PLDI 1991, pp. 293\u2013305. ACM Press, New York (1991)"},{"key":"38_CR18","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1993)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:51Z","timestamp":1619507871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11944836_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}