{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:24:48Z","timestamp":1794515088531,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496299","type":"print"},{"value":"9783662496305","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_10","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T05:04:32Z","timestamp":1458536672000},"page":"162-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Contextual Approximation and Higher-Order Procedures"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej S.","family":"Murawski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","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, 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, Boston (1997)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., McCusker, G.: Game semantics. In: Schwichtenberg, H., Berger, U. (eds.) Logic and Computation, Proceedings of the 1997 Marktoberdorf Summer School. Springer-Verlag (1998)","DOI":"10.1007\/978-3-642-58622-4_1"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence.In: Proceedings of POPL, pp. 340\u2013353. ACM (2009)","DOI":"10.1145\/1594834.1480925"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC 2004, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"01","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068407003043","volume":"8","author":"R Colvin","year":"2008","unstructured":"Colvin, R., Hayes, I.J., Strooper, P.A.: Calculating modules in contextual logic program refinement. Theory Pract. Logic Program. 8(01), 1\u201331 (2008)","journal-title":"Theory Pract. Logic Program."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45022-X_10","volume-title":"Automata, Languages and Programming","author":"DR Ghica","year":"2000","unstructured":"Ghica, D.R., McCusker, G.: Reasoning about idealized ALGOL using regular languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 103. Springer, Heidelberg (2000)"},{"key":"10_CR7","unstructured":"Harmer, R.: Games and full abstraction for non-deterministic languages. Ph.D. thesis, University of London (2000)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-22012-8_11","volume-title":"Automata, Languages and Programming","author":"D Hopkins","year":"2011","unstructured":"Hopkins, D., Murawski, A.S., Ong, C.-H.L.: A fragment of ML decidable by visibly pushdown automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 149\u2013161. Springer, Heidelberg (2011)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Murawski, A.S.: On program equivalence in languages with ground-type references. In: Proceedings of IEEE Symposium on Logic in Computer Science, pp. 108\u2013117. Computer Society Press (2003)","DOI":"10.1109\/LICS.2003.1210050"},{"issue":"1\/2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.05.013","volume":"343","author":"AS Murawski","year":"2005","unstructured":"Murawski, A.S.: Games for complexity of second-order call-by-name programs. Theor. Comput. Sci. 343(1\/2), 207\u2013236 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-31982-5_13","volume-title":"Foundations of Software Science and Computational Structures","author":"AS Murawski","year":"2005","unstructured":"Murawski, A.S., Walukiewicz, I.: Third-order idealized algol with iteration is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 202\u2013218. Springer, Heidelberg (2005)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-45699-6_8","volume-title":"Applied Semantics","author":"AM Pitts","year":"2002","unstructured":"Pitts, A.M.: Operational semantics and program equivalence. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 378\u2013412. Springer, Heidelberg (2002)"},{"key":"10_CR13","first-page":"345","volume-title":"Algorithmic Languages","author":"JC Reynolds","year":"1978","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 (1978)"},{"issue":"9","key":"10_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/2544174.2500600","volume":"48","author":"Aaron Turon","year":"2013","unstructured":"Turon, A., Dreyer, D., Birkedal, L.: Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In: Proceedings of ICFP 2013, pp. 377\u2013390 (2013)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T17:29:59Z","timestamp":1748798999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}