{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:02:28Z","timestamp":1784232148471,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662242","type":"print"},{"value":"9783540485230","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_60","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"635-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Typed Exceptions and Continuations Cannot Macro-Express Each Other"],"prefix":"10.1007","author":[{"given":"Jon G.","family":"Riecke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hayo","family":"Thielecke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"60_CR1","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland, 1981. Revised Edition, 1984."},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"O. Danvy and J.L. Lawall. Back to direct style II: First-class continuations. In Proceedings, 1992 ACM Conference on Lisp and Functional Programming, pages 299\u2013310. ACM, 1992.","DOI":"10.1145\/141478.141564"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"M. Felleisen. The theory and practice of first-class prompts. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 180\u2013190. ACM, 1988.","DOI":"10.1145\/73560.73576"},{"key":"60_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0167-6423(91)90036-W","volume":"17","author":"M. Felleisen","year":"1991","unstructured":"M. Felleisen. On the expressive power of programming languages. Science of Computer Programming, 17:35\u201375, 1991.","journal-title":"Science of Computer Programming"},{"key":"60_CR5","unstructured":"J. Gosling, B. Joy, and G. Steele. The Java(tm) Language Specification. Addison Wesley, 1996."},{"key":"60_CR6","unstructured":"G. Kahn. Natural semantics. In Proceedings Symposium on Theoretical Aspects of Computer Science, volume 247 of Lect. Notes in Computer Sci., NewYork, 1987. Springer-Verlag."},{"key":"60_CR7","unstructured":"R. Kelsey, W. Clinger, and J. Rees, editors. Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(3):7\u2013105, 1998."},{"key":"60_CR8","unstructured":"P.J. Landin. A generalization of jumps and labels. Report, UNIVAC Systems Programming Research, August 1965."},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"P.J. Landin.Ageneralization of jumps and labels. Higher-Order and Symbolic Computation, 11(2), 1998.","DOI":"10.1023\/A:1010068630801"},{"key":"60_CR10","unstructured":"X. Leroy and P. Weis. Manual de reference du language Caml. InterEditions, Paris, 1998."},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"M. Lillibridge. Exceptions are strictly more powerful than call\/cc. Technical Report CMSCS-95\u2013178, School of Computer Science, Carnegie Mellon University, 1995.","DOI":"10.21236\/ADA307740"},{"issue":"1","key":"60_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1010020917337","volume":"12","author":"M. Lillibridge","year":"1999","unstructured":"M. Lillibridge. Uncaught exceptions can be strictly more powerful than call\/cc. Higher-Order and Symbolic Computation, 12(1):275\u2013307, 1999.","journal-title":"Higher-Order and Symbolic Computation"},{"key":"60_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-15648-8_17","volume-title":"Proceedings of the Conference on Logics of Programs, 1985","author":"A.R. Meyer","year":"1985","unstructured":"A.R. Meyer and M. Wand. Continuation semantics in typed lambda-calculi (summary). In R. Parikh, editor, Proceedings of the Conference on Logics of Programs, 1985, Lecture Notes in Computer Science 193, pages 219\u2013224. Springer-Verlag, 1985."},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of StandardML (Revised). MIT Press, 1997.","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"60_CR15","first-page":"55","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Control, 93:55\u201392, 1991.","journal-title":"Information and Control"},{"key":"60_CR16","unstructured":"J. H. Morris. Lambda-calculus models of programming languages. Technical ReportMACTR-57, M.I.T. Lab. for Computer Science, 1968."},{"key":"60_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Sci., 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Sci."},{"key":"60_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D. LCF considered as a programming language. Theoretical Computer Sci., 5:223\u2013257, 1977.","journal-title":"Theoretical Computer Sci."},{"issue":"3\/4","key":"60_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"J.C. Reynolds","year":"1993","unstructured":"J.C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3\/4):233\u2013247, November 1993.","journal-title":"Lisp and Symbolic Computation"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"D. Sitaram and M. Felleisen. Reasoning with continuations II: Full abstraction for models of control. In Proceedings of the 1990 ACMConference on Lisp and Functional Programming, pages 161\u2013175. ACM, 1990.","DOI":"10.1145\/91556.91626"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"H. Thielecke. Using a continuation twice and its implications for the expressive power of call\/cc. Higher-Order and Symbolic Computation, 12(1), 1999.","DOI":"10.1023\/A:1010068800499"},{"key":"60_CR22","unstructured":"A. vanWijngaarden. Recursive definition of syntax and semantics. In T.B. Steel, Jr, editor, Formal Language Description Languages for Computer Programming, Proceedings of an IFIP Working Conference, pages 13\u201324, 1964."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:10:59Z","timestamp":1642821059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}