{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:47Z","timestamp":1780994747157,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540766360","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_16","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T07:47:52Z","timestamp":1195544872000},"page":"239-254","source":"Crossref","is-referenced-by-count":30,"title":["Polymorphic Delimited Continuations"],"prefix":"10.1007","author":[{"given":"Kenichi","family":"Asai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yukiyoshi","family":"Kameyama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"63","volume":"6","author":"K. Asai","year":"2007","unstructured":"Asai, K.: Logical Relations for Call-by-value Delimited Continuations. Trends in Functional Programming\u00a06, 63\u201378 (2007)","journal-title":"Trends in Functional Programming"},{"key":"16_CR2","unstructured":"Asai, K.: On Typing Delimited Continuations: Three New Solutions to the Printf Problem. See http:\/\/pllab.is.ocha.ac.jp\/~asai\/papers\/ (submitted, 2007)"},{"key":"16_CR3","unstructured":"Asai, K., Kameyama, Y.: Polymorphic Delimited Continuations. Technical Report CS-TR-07-10, Dept. of Computer Science, University of Tsukuba (September 2007)"},{"key":"16_CR4","unstructured":"Danvy, O.: An Analytical Approach to Program as Data Objects. DSc thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark (2006)"},{"key":"16_CR5","unstructured":"Danvy, O., Filinski, A.: A Functional Abstraction of Typed Contexts. Technical Report 89\/12, DIKU, University of Copenhagen (July 1989)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting Control. In: Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 151\u2013160 (1990)","DOI":"10.1145\/91556.91622"},{"issue":"4","key":"16_CR7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science\u00a02(4), 361\u2013391 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing Monads. In: POPL, pp. 446\u2013457 (1994)","DOI":"10.1145\/174675.178047"},{"key":"16_CR9","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol.\u00a07. Cambridge University Press, Cambridge (1989)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Gunter, C.A., Remy, D., Riecke, J.G.: A Generalization of Exceptions and Control in ML-Like Languages. In: FPCA, pp. 12\u201323 (1995)","DOI":"10.1145\/224164.224173"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1017\/S095679680000085X","volume":"3","author":"R. Harper","year":"1993","unstructured":"Harper, R., Duba, B.F., MacQueen, D.: Typing First-Class Continuations in ML. J. Funct. Program.\u00a03(4), 465\u2013484 (1993)","journal-title":"J. Funct. Program."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Harper, R., Lillibridge, M.: Explicit polymorphism and CPS conversion. In: POPL, pp. 206\u2013219 (1993)","DOI":"10.1145\/158511.158630"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hasegawa, M.: Relational parametricity and control. Logical Methods in Computer Science\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:3)2006"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., Shan, C.-c., Sabry, A.: Delimited dynamic binding. In: ICFP, pp. 26\u201337 (2006)","DOI":"10.1145\/1159803.1159808"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Polymorphism by name for references and continuations. In: POPL, pp. 220\u2013231 (1993)","DOI":"10.1145\/158511.158632"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Mogelberg, R.E., Simpson, A.: Relational parametricity for computational effects. In: LICS (2007)","DOI":"10.1109\/LICS.2007.40"},{"key":"16_CR17","unstructured":"Strachey, C.: Fundamental concepts in programming languages. International Summer School in Computer Programming, Copenhagen, Denmark (August 1967)"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/604131.604144","volume-title":"POPL","author":"H. Thielecke","year":"2003","unstructured":"Thielecke, H.: From Control Effects to Typed Continuation Passing. In: POPL, pp. 139\u2013149. ACM Press, New York (2003)"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90018-D","volume":"89","author":"M. Tofte","year":"1990","unstructured":"Tofte, M.: Type inference for polymorphic references. Inf. Comput.\u00a089(1), 1\u201334 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF01018828","volume":"8","author":"A.K. Wright","year":"1995","unstructured":"Wright, A.K.: Simple imperative polymorphism. Lisp and Symbolic Computation\u00a08(4), 343\u2013355 (1995)","journal-title":"Lisp and Symbolic Computation"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A.K. Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput.\u00a0115(1), 38\u201394 (1994)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T18:06:27Z","timestamp":1737569187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_16","relation":{},"subject":[]}}