{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:53Z","timestamp":1725562193450},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_21","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"289-303","source":"Crossref","is-referenced-by-count":15,"title":["A Game Semantics of Local Names and Good Variables"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., McCusker, G.: Linearity, Sharing and State: A fully abstract game semantics for Idealized Algol with active expressions. In: O\u2019Hearn, P.W., Tennent, R. (eds.) Algol-like languages, Birkhauser (1997)","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"21_CR3","first-page":"1","volume-title":"Proceedings of CSL 1997","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Neilsen, M., Thomas, W. (eds.) Proceedings of CSL 1997, pp. 1\u201317. Springer, Heidelberg (1998)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract games semantics for general references. In: Proceedings of the 13th Annual Symposium on Logic In Computer Science, LICS 1998 (1998)","DOI":"10.1109\/LICS.1998.705669"},{"key":"21_CR5","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. Information and Computation\u00a0163, 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoretical Computer Science(2003) (to appear)","DOI":"10.1016\/S0304-3975(03)00315-3"},{"key":"21_CR7","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":"21_CR8","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":"21_CR9","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: Proceedings of LICS 1999. IEEE Press, Los Alamitos (1999)","DOI":"10.1109\/LICS.1999.782586"},{"key":"21_CR10","unstructured":"Laird, J.: A Semantic Analysis of Control. PhD thesis, Department of Computer Science, University of Edinburgh (1998)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Laird, J.: A fully abstract game semantics of local exceptions. In: Proceedings of LICS 2001. IEEE Computer Society Press, Los Alamitos (2001)","DOI":"10.1109\/LICS.2001.932487"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Laird, J.: A game semantics of ICSP. In: Proceedings of MFPS XVII, in Electronic notes in Theoretical Computer Science, vol. 45, Elsevier, Amsterdam (2001)","DOI":"10.1016\/S1571-0661(04)80965-4"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Laurent, O.: Polarized games. In: Proceedings of the Seventeenth International Symposium on Logi. In: Computer Science, LICS 2002 (2002)","DOI":"10.1109\/LICS.2002.1029835"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Hankin, C.: Non-deterministic games and program analysis: An application to security. In: Proceedings of LICS 1999 (1999)","DOI":"10.1109\/LICS.1999.782639"},{"key":"21_CR15","unstructured":"McCusker, G.: Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, Published by Cambridge University Press (1996)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"McCusker, G.: On the semantics of the bad-variable constructor in Algol-like languages. In: Proceedings of MFPS XIX. ENTCS (2003) (to appear)","DOI":"10.1016\/S1571-0661(03)50009-3"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Murawski, A.: On program equivalence in languages with ground-type references. In: Proceedings of LICS 2003. IEEE Press, Los Alamitos (2003)","DOI":"10.1109\/LICS.2003.1210050"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Nickau, H.: Hereditarily sequential functionals. In: Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg. LNCS. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58140-5_25"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Ong, C.H.-L.: Observational equivalence of 3rd-order Idealized Algol is decidable. In: Proceedings of LICS 2002. IEEE Press, Los Alamitos (2002)","DOI":"10.1109\/LICS.2002.1029833"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Pitts, A., Stark, I.: Observable features of higher-order functions that dynamically create local names. In: Proceedings of MFCS 1993, pp. 122\u2013141 (1993)","DOI":"10.1007\/3-540-57182-5_8"},{"key":"21_CR21","unstructured":"Power, J., Thielecke, H.: Environments in Freyd categories and \u03ba-categories. In: Proceedings of ICALP 1999. LNCS, vol.\u00a01644. Springer, Heidelberg (1999)"},{"key":"21_CR22","unstructured":"Stark, I.: Names and higher-order functions. Technical Report 363, University of Cambridge Computer Laboratory (1995)"},{"issue":"9","key":"21_CR23","first-page":"122","volume":"1","author":"I. Stark","year":"1996","unstructured":"Stark, I.: Categorical models for local names. Lisp and Symbolic Computation\u00a01(9), 122\u2013141 (1996)","journal-title":"Lisp and Symbolic Computation"},{"key":"21_CR24","unstructured":"Sumii, E., Pierce, B.C.: Logical relations for encryption. Journal of Computer Security (2002) (to appear)"}],"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-540-24727-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:23:22Z","timestamp":1559345002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}