{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:01Z","timestamp":1725549181819},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_4","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"33-47","source":"Crossref","is-referenced-by-count":2,"title":["Block Structure vs. Scope Extrusion: Between Innocence and Omniscience"],"prefix":"10.1007","author":[{"given":"Andrzej S.","family":"Murawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Tzevelekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","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":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028004","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-1-4757-3851-3_10","volume-title":"Algol-like languages","author":"S. Abramsky","year":"1997","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.D. (eds.) Algol-like languages, pp. 297\u2013329. Birkha\u00fcser, Basel (1997)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"4_CR5","series-title":"Electronic Notes in Computer Science","volume-title":"Proceedings of MFPS","author":"D.R. Ghica","year":"2001","unstructured":"Ghica, D.R.: Regular-language semantics for a call-by-value programming language. In: Proceedings of MFPS. Electronic Notes in Computer Science, vol.\u00a045. Elsevier, Amsterdam (2001)"},{"issue":"1-2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(99)00039-0","volume":"221","author":"K. Honda","year":"1999","unstructured":"Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. Theoretical Computer Science\u00a0221(1-2), 393\u2013456 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_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. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804175","volume-title":"Concepts in programming languages","author":"J.C. Mitchell","year":"2002","unstructured":"Mitchell, J.C.: Concepts in programming languages. Cambridge University Press, Cambridge (2002)"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/1094622.1094626","volume":"6","author":"A.S. Murawski","year":"2005","unstructured":"Murawski, A.S.: About the undecidability of program equivalence in finitary languages with state. ACM Transactions on Computational Logic\u00a06(4), 701\u2013726 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1\/3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.12.036","volume":"338","author":"A.S. Murawski","year":"2005","unstructured":"Murawski, A.S.: Functions with local state: regularity and undecidability. Theoretical Computer Science\u00a0338(1\/3), 315\u2013349 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","first-page":"543","volume-title":"Algebraic Methods in Semantics","author":"F. Oles","year":"1985","unstructured":"Oles, F.: Type algebras, functor categories and block structure. In: Nivat, M., Reynolds, J.C. (eds.) Algebraic Methods in Semantics, pp. 543\u2013573. Cambridge University Press, Cambridge (1985)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: Observational equivalence of 3rd-order Idealized Algol is decidable. In: Proceedings of IEEE Symposium on Logic in Computer Science, pp. 245\u2013256. Computer Society Press (2002)","DOI":"10.1109\/LICS.2002.1029833"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A.M. Pitts","year":"1993","unstructured":"Pitts, A.M., Stark, I.: On the observable properties of higher order functions that dynamically create local names, or: What\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 122\u2013141. Springer, Heidelberg (1993)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science\u00a05, 223\u2013255 (1977)","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.entcs.2006.04.018","volume":"158","author":"J. Power","year":"2006","unstructured":"Power, J.: Semantics for local computational effects. Electr. Notes Theor. Comput. Sci.\u00a0158, 355\u2013371 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR16","first-page":"345","volume-title":"Algorithmic Languages","author":"J.C. Reynolds","year":"1981","unstructured":"Reynolds, J.C.: The essence of Algol. In: de Bakker, J.W., van Vliet, J.C. (eds.) Algorithmic Languages, pp. 345\u2013372. North Holland, Amsterdam (1981)"},{"key":"4_CR17","unstructured":"Stark, I.D.B.: Names and Higher-Order Functions. PhD thesis, University of Cambridge Computing Laboratory, Technical Report No. 363 (1995)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Full abstraction for nominal general references. Logical Methods in Computer Science\u00a05(3) (2009)","DOI":"10.2168\/LMCS-5(3:8)2009"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:03Z","timestamp":1606186023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}