{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:46Z","timestamp":1773479026585,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10990-009-9049-5","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T11:20:14Z","timestamp":1260962414000},"page":"275-291","source":"Crossref","is-referenced-by-count":19,"title":["On typing delimited continuations: three new solutions to\u00a0the printf problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Kenichi","family":"Asai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,17]]},"reference":[{"key":"9049_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-76637-7_16","volume-title":"5th Asian Symposium on Programming Languages and Systems, APLAS 2007","author":"K. Asai","year":"2007","unstructured":"Asai, K., Kameyama, Y.: Polymorphic delimited continuations. In: 5th Asian Symposium on Programming Languages and Systems, APLAS 2007. Lecture Notes in Computer Science, vol. 4807, pp. 239\u2013254. Springer, Berlin (2007)"},{"issue":"3","key":"9049_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-6423(94)00003-4","volume":"22","author":"O. Danvy","year":"1994","unstructured":"Danvy, O.: Back to direct style. Sci. Comput. Program. 22(3), 183\u2013195 (1994)","journal-title":"Sci. Comput. Program."},{"issue":"6","key":"9049_CR3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1017\/S0956796898003104","volume":"8","author":"O. Danvy","year":"1998","unstructured":"Danvy, O.: Functional unparsing. J. Funct. Program. 8(6), 621\u2013625 (1998)","journal-title":"J. Funct. Program."},{"key":"9049_CR4","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Tech. Rep. 89\/12, DIKU, University of Copenhagen (1989)"},{"key":"9049_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/91556.91622","volume-title":"LFP \u201990: Proceedings of the 1990 ACM Conference on LISP and Functional Programming","author":"O. Danvy","year":"1990","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LFP \u201990: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp.\u00a0151\u2013160. ACM Press, New York (1990)"},{"issue":"4","key":"9049_CR6","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. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9049_CR7","series-title":"Lecture Notes in Computer Science","first-page":"627","volume-title":"Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics","author":"O. Danvy","year":"1993","unstructured":"Danvy, O., Hatcliff, J.: On the transformation between direct and continuation semantics. In: Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science, vol. 802, pp. 627\u2013648. Springer, Berlin (1993)"},{"key":"9049_CR8","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/174675.178047","volume-title":"POPL \u201994: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"A. Filinski","year":"1994","unstructured":"Filinski, A.: Representing monads. In: POPL \u201994: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 446\u2013457. ACM Press, New York (1994)"},{"issue":"5","key":"9049_CR9","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1017\/S0956796802004367","volume":"13","author":"R. Hinze","year":"2003","unstructured":"Hinze, R.: Formatting: A class act. J. Funct. Program. 13(5), 935\u2013944 (2003)","journal-title":"J. Funct. Program."},{"key":"9049_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/944705.944722","volume-title":"ICFP \u201903: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming","author":"Y. Kameyama","year":"2003","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: ICFP \u201903: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pp. 177\u2013188. ACM Press, New York (2003)"},{"issue":"2","key":"9049_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value, and the \u03bb-calculus. Theor. Comput. Sci. 1(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"9049_CR12","unstructured":"Steele, G.L.: RABBIT: A compiler for SCHEME. Tech. Rep. AI-TR-474, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA (1978)"},{"key":"9049_CR13","unstructured":"Strachey, C., Wadsworth, C.P.: Continuations: A Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England (1974). Reprinted in Higher-Order Symb. Comput. 13(1\/2), 135\u2013152 (2000)"},{"key":"9049_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/604131.604144","volume-title":"POPL \u201903: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"H. Thielecke","year":"2003","unstructured":"Thielecke, H.: From control effects to typed continuation passing. In: POPL \u201903: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 139\u2013149. ACM Press, New York (2003)"},{"key":"9049_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-540-24725-8_20","volume-title":"13th European Symposium on Programming, ESOP 2004","author":"H. Thielecke","year":"2004","unstructured":"Thielecke, H.: Answer type polymorphism in call-by-name continuation passing. In: 13th European Symposium on Programming, ESOP 2004. Lecture Notes in Computer Science, vol. 2986, pp. 279\u2013293. Springer, Berlin (2004)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9049-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-009-9049-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-009-9049-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:41Z","timestamp":1559338181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-009-9049-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9049"],"URL":"https:\/\/doi.org\/10.1007\/s10990-009-9049-5","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}