{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:48:23Z","timestamp":1764251303347,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_7","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"47-61","source":"Crossref","is-referenced-by-count":7,"title":["Normal Form Bisimulations for Delimited-Control Operators"],"prefix":"10.1007","author":[{"given":"Dariusz","family":"Biernacki","sequence":"first","affiliation":[]},{"given":"Sergue\u00ef","family":"Lenglet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Ong, C.-H.L.: Full abstraction in the lazy lambda calculus. Information and Computation\u00a0105, 159\u2013267 (1993)","journal-title":"Information and Computation"},{"issue":"2:5","key":"7_CR2","first-page":"1","volume":"1","author":"M. Biernacka","year":"2005","unstructured":"Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science\u00a01(2:5), 1\u201339 (2005)","journal-title":"Logical Methods in Computer Science"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Biernacki, D., Danvy, O., Millikin, K.: A dynamic continuation-passing style for dynamic delimited continuations. Technical Report BRICS RS-05-16, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark (May 2005)","DOI":"10.7146\/brics.v12i16.21882"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-28729-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Biernacki","year":"2012","unstructured":"Biernacki, D., Lenglet, S.: Applicative Bisimulations for Delimited-Control Operators. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 119\u2013134. Springer, Heidelberg (2012)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Biernacki, D., Lenglet, S.: Normal form bisimulations for delimited-control operators (February 2012), http:\/\/arxiv.org\/abs\/1202.5959","DOI":"10.1007\/978-3-642-29822-6_7"},{"key":"7_CR6","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. DIKU Rapport 89\/12, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark (July 1989)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Wand, M. (ed.) LFP 1990, Nice, France, pp. 151\u2013160. ACM Press (June 1990)","DOI":"10.1145\/91556.91622"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: Boehm, H.-J. (ed.) POPL 1994, Portland, Oregon, pp. 446\u2013457. ACM Press (January 1994)","DOI":"10.1145\/174675.178047"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Shivers, O. (ed.) ICFP 2003, Uppsala, Sweden. SIGPLAN Notices, vol.\u00a038(9), pp. 177\u2013188. ACM Press (August 2003)","DOI":"10.1145\/944746.944722"},{"key":"7_CR10","unstructured":"Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics, pp. 91\u2013135. Cambridge University Press (1998)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Bisimulation in untyped lambda calculus: B\u00f6hm trees and bisimulation up to context. In: Stephen Brookes, M.M., Jung, A., Scedrov, A. (ed.) MFPS 1999. ENTCS, New Orleans, LA, vol.\u00a020, pp. 346\u2013374. Elsevier Science (April 1999)","DOI":"10.1016\/S1571-0661(04)80083-5"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Eager normal form bisimulation. In: Panangaden, P. (ed.) LICS 2005, Chicago, IL, pp. 345\u2013354. IEEE Computer Society Press (June 2005)","DOI":"10.1109\/LICS.2005.15"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Normal form simulation for McCarthy\u2019s amb. In: Escard\u00f3, M., Jung, A., Mislove, M. (eds.) MFPS 2005, Birmingham, UK. ENTCS, vol.\u00a0155, pp. 445\u2013465. Elsevier Science Publishers (May 2005)","DOI":"10.1016\/j.entcs.2005.11.068"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Head normal form bisimulation for pairs and the \u03bb\u03bc-calculus. In: Alur, R. (ed.) LICS 2006, Seattle, WA, pp. 297\u2013306. IEEE Computer Society Press (August 2006)","DOI":"10.1109\/LICS.2006.29"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R.: Fully abstract models of typed \u03bb-calculi. Theoretical Computer Science\u00a04(1), 1\u201322 (1977)","journal-title":"Theoretical Computer Science"},{"key":"7_CR16","unstructured":"Morris, J.H.: Lambda Calculus Models of Programming Languages. PhD thesis. Massachusets Institute of Technology (1968)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: The lazy lambda calculus in a concurrency scenario. In: LICS 1992, Santa Cruz, California, pp. 102\u2013109. IEEE Computer Society (June 1992)","DOI":"10.1109\/LICS.1992.185524"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Marcinkowski, J. (ed.) LICS 2007, Wroclaw, Poland, pp. 293\u2013302. IEEE Computer Society Press (July 2007)","DOI":"10.1109\/LICS.2007.17"},{"key":"7_CR19","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"7_CR20","series-title":"SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/1190216.1190244","volume-title":"POPL 2007","author":"K. St\u00f8vring","year":"2007","unstructured":"St\u00f8vring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: Felleisen, M. (ed.) POPL 2007. SIGPLAN Notices, vol.\u00a042(1), pp. 161\u2013172. ACM Press, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:22:32Z","timestamp":1743157352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}