{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T12:06:55Z","timestamp":1753358815241,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319479576"},{"type":"electronic","value":"9783319479583"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47958-3_10","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T09:40:52Z","timestamp":1475919652000},"page":"171-186","source":"Crossref","is-referenced-by-count":3,"title":["A Sound and Complete Bisimulation for Contextual Equivalence in $$\\lambda $$ -Calculus with Call\/cc"],"prefix":"10.1007","author":[{"given":"Taichi","family":"Yachi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eijiro","family":"Sumii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"key":"10_CR1","unstructured":"Aristiz\u00e1bal, A., Biernacki, D., Lenglet, S., Polesiuk, P.: Environmental bisimulations for delimited-control operators with dynamic prompt generation. In: Kesner, D., Pientka, B. (eds.) 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, 22\u201326 June 2016, Porto, Portugal. LIPIcs, vol. 52, pp. 9:1\u20139:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). http:\/\/dx.doi.org\/10.4230\/LIPIcs.FSCD.2016.9"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-29822-6_7","volume-title":"Functional and Logic Programming","author":"D Biernacki","year":"2012","unstructured":"Biernacki, D., Lenglet, S.: Normal form bisimulations for delimited-control operators. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol. 7294, pp. 47\u201361. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29822-6_7"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-03542-0_24","volume-title":"Programming Languages and Systems","author":"D Biernacki","year":"2013","unstructured":"Biernacki, D., Lenglet, S.: Environmental bisimulations for delimited-control operators. In: Shan, C. (ed.) APLAS 2013. LNCS, vol. 8301, pp. 333\u2013348. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-03542-0_24"},{"key":"10_CR4","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LISP and Functional Programming, pp. 151\u2013160 (1990). http:\/\/doi.acm.org\/10.1145\/91556.91622"},{"issue":"4\u20135","key":"10_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1017\/S095679681200024X","volume":"22","author":"D Dreyer","year":"2012","unstructured":"Dreyer, D., Neis, G., Birkedal, L.: The impact of higher-order state and control effects on local relational reasoning. J. Funct. Program. 22(4\u20135), 477\u2013528 (2012). http:\/\/dx.doi.org\/10.1017\/S095679681200024X","journal-title":"J. Funct. Program."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D.P., Kohlbecker, E.E., Duba, B.F.: A syntactic theory of sequential control. Theor. Comput. Sci. 52, 205\u2013237 (1987). http:\/\/dx.doi.org\/10.1016\/0304-3975(87)90109\u20135","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235\u2013271 (1992). http:\/\/dx.doi.org\/10.1016\/0304-3975(92)90014\u20137","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: Allen, F.E. (ed.) Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, USA, January 1990, pp. 47\u201358. ACM Press (1990). http:\/\/doi.acm.org\/10.1145\/96709.96714"},{"key":"10_CR9","unstructured":"Hur, C., Dreyer, D., Neis, G., Vafeiadis, V.: The marriage of bisimulations and kripke logical relations. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22\u201328 January 2012, pp. 59\u201372. ACM (2012). http:\/\/doi.acm.org\/10.1145\/2103656.2103666"},{"key":"10_CR10","unstructured":"Hur, C.K., Neis, G., Dreyer, D., Vafeiadis, V.: A logical step forward in parametric bisimulations. Technical report MPI-SWS-2014-003, Max Planck Institute for Software Systems (2014)"},{"key":"10_CR11","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Runciman, C., Shivers, O. (eds.) Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, 25\u201329 August 2003, pp. 177\u2013188. ACM (2003). http:\/\/doi.acm.org\/10.1145\/944705.944722"},{"key":"10_CR12","unstructured":"Kiselyov, O.: An argument against call\/cc. http:\/\/okmij.org\/ftp\/continuations\/against-callcc.html"},{"key":"10_CR13","unstructured":"Koutavas, V.: Reasoning about imperative and higher-order programs. Ph.D. thesis, Northeastern University (2008)"},{"key":"10_CR14","unstructured":"Morris Jr., J.H.: Lambda-calculus models of programming languages. Ph.D. thesis, Massachusetts Institute of Technology (1968)"},{"key":"10_CR15","unstructured":"Sabry, A.: Note on axiomatizing the semantics of control operators. Technical report CIS-TR-96-03, Department of Computer Science, University of Oregon (1996)"},{"issue":"3\u20134","key":"10_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A Sabry","year":"1993","unstructured":"Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. LISP Symb. Comput. 6(3\u20134), 289\u2013360 (1993)","journal-title":"LISP Symb. Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Twenty-Second Annual IEEE Symposium on Logic in Computer Science, pp. 293\u2013302 (2007)","DOI":"10.1109\/LICS.2007.17"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-04164-8_17","volume-title":"Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday","author":"K St\u00f8vring","year":"2009","unstructured":"St\u00f8vring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: Palsberg, J. (ed.) Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday. LNCS, vol. 5700, pp. 329\u2013375. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04164-8_17"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-642-04027-6_33","volume-title":"Computer Science Logic","author":"E Sumii","year":"2009","unstructured":"Sumii, E.: A complete characterization of observational equivalence in polymorphic $$\\lambda $$ -calculus with general references. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 455\u2013469. Springer, Heidelberg (2009)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for dynamic sealing. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 161\u2013172 (2004)","DOI":"10.1145\/964001.964015"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 63\u201374 (2005)","DOI":"10.1145\/1047659.1040311"},{"issue":"5\u201326","key":"10_CR22","first-page":"1","volume":"54","author":"E Sumii","year":"2007","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. J. ACM 54(5\u201326), 1\u201343 (2007). Extended abstract appeared in Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 63\u201374 (2005)","journal-title":"J. ACM"},{"key":"10_CR23","unstructured":"Thielecke, H.: Contrasting exceptions and continuations (2001). http:\/\/www.cs.bham.ac.uk\/hxt\/research\/exncontjournal.pdf"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47958-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:40:32Z","timestamp":1498336832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47958-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319479576","9783319479583"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47958-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}