{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:10:05Z","timestamp":1751983805536,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order and Symbolic Computation"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1010012532463","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T00:56:42Z","timestamp":1040605002000},"page":"145-175","source":"Crossref","is-referenced-by-count":3,"title":["Retraction Approach to CPS Transform"],"prefix":"10.1007","volume":"11","author":[{"given":"Jakov","family":"Ku\u010dan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"187567_CR1","doi-asserted-by":"crossref","unstructured":"Andrew W. Appel. Compiling with Continuations. Cambridge Universisty Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"187567_CR2","volume-title":"The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic","author":"H. P. Barendregt","year":"1984","unstructured":"Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland Publishing Co., Amsterdam, second edition, 1984.","edition":"second edition"},{"issue":"2","key":"187567_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(92)90018-B","volume":"98","author":"R. L. Crole","year":"1992","unstructured":"Roy L. Crole and Andrew M. Pitts. New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98(2):171\u2013210, June 1992.","journal-title":"Information and Computation"},{"key":"187567_CR4","doi-asserted-by":"crossref","unstructured":"Andrzej Filinski. Representing monads. In Symposium on Principles of Programming Languages, pages 446\u2013457, Portland, Oregon, January 1994.","DOI":"10.1145\/174675.178047"},{"issue":"6","key":"187567_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/173262.155113","volume":"28","author":"C. Flanagan","year":"1993","unstructured":"Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. SIGPLAN Notices, 28(6):237\u2013247, June 1993. Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation.","journal-title":"SIGPLAN Notices"},{"key":"187567_CR6","first-page":"458","volume-title":"Proceedings of the 21st Symposium on Principles of Programming Languages","author":"J. Hatcliff","year":"1994","unstructured":"John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In Proceedings of the 21st Symposium on Principles of Programming Languages, pages 458\u2013471, Portland, Oregon, January 1994. ACM."},{"key":"187567_CR7","volume-title":"Metatheorems about Convertibility in Typed Lambda Calculi: Applications to CPS Transform and \u201cFree Theorems\u201d","author":"J. Ku\u010dan","year":"1997","unstructured":"Jakov Ku\u010dan. Metatheorems about Convertibility in Typed Lambda Calculi: Applications to CPS Transform and \u201cFree Theorems\u201d. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, February 1997."},{"key":"187567_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","volume":"76","author":"J. C. Mitchell","year":"1988","unstructured":"John C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76:211\u2013249, 1988.","journal-title":"Information and Computation"},{"key":"187567_CR9","unstructured":"Eugenio Moggi. Computational lambda-caluclus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh, October 1988."},{"key":"187567_CR10","unstructured":"Eugenio Moggi. Computational lambda-caluclus and monads. In LICS, 1989."},{"issue":"1","key":"187567_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55\u201392, July 1991.","journal-title":"Information and Computation"},{"issue":"1\/2","key":"187567_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","volume":"71","author":"D. MacQueen","year":"1986","unstructured":"David MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1\/2):95\u2013130, October\/November 1986.","journal-title":"Information and Control"},{"key":"187567_CR13","doi-asserted-by":"crossref","unstructured":"Albert R. Meyer and Jon G. Riecke. Continuations may be unreasonable. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 63\u201371, 1988.","DOI":"10.1145\/62678.62685"},{"key":"187567_CR14","doi-asserted-by":"crossref","unstructured":"Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambda-calculi (summary). In Rohit Parikh, editor, Logics of Programs: Proceedings, volume 193 of Lecture Notes in Computer Science, pages 219\u2013224. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15648-8_17"},{"issue":"2","key":"187567_CR15","doi-asserted-by":"crossref","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 Science, 1(2):125\u2013159, December 1975.","journal-title":"Theoretical Computer Science"},{"key":"187567_CR16","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium, volume 19 of LNCS","author":"J. Reynolds","year":"1974","unstructured":"John Reynolds. Toward a theory of type structure. In B. Robinet, editor, Programming Symposium, volume 19 of LNCS, pages 408\u2013425. Springer-Verlag, Berlin, 1974."},{"key":"187567_CR17","doi-asserted-by":"crossref","unstructured":"John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3\/4), November 1993.","DOI":"10.1007\/BF01019459"},{"key":"187567_CR18","doi-asserted-by":"crossref","unstructured":"Jon G. Riecke. Delimiting scope of side effects. In Proceedings of the 1993 Conference on Functional Programming and Computer Architecture, pages 146\u2013158. ACM, 1993.","DOI":"10.1145\/165180.165200"},{"key":"187567_CR19","doi-asserted-by":"crossref","unstructured":"Jon G. Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In Proceedings of Symposium on Principles of Programming Languages, 1995.","DOI":"10.1145\/199448.199450"},{"issue":"3\/4","key":"187567_CR20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01019462","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Amr Sabry and Matthias Felleisen. Reasoning about programs in continuation passing style. Lisp and Symbolic Computation, 6(3\/4):289\u2013360, 1993.","journal-title":"Lisp and Symbolic Computation"},{"key":"187567_CR21","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1145\/322203.322216","volume":"27","author":"R. Sethi","year":"1980","unstructured":"Ravi Sethi and A. Tang. Constructing call-by-value continuation semantics. Journal of the ACM, 27:580\u2013597, 1980.","journal-title":"Journal of the ACM"},{"key":"187567_CR22","unstructured":"Guy L. Steele. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, MIT Artificial Intelligence Laboratory, 1978."},{"key":"187567_CR23","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"J. E. Stoy","year":"1977","unstructured":"Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, 1977."},{"issue":"2","key":"187567_CR24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(81)90037-2","volume":"13","author":"J. E. Stoy","year":"1981","unstructured":"Joseph E. Stoy. The congruence of two programming language definitions. Theoretical Computer Science, 13(2):151\u2013174, February 1981.","journal-title":"Theoretical Computer Science"},{"key":"187567_CR25","unstructured":"C. Strachey and C. P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Report PRG-11, Oxford University Computing Laboratory, 1974."},{"key":"187567_CR26","volume-title":"International Conference on Functional Programing","author":"A. Sabry","year":"1996","unstructured":"Amr Sabry and Philip Wadler. A reflection on call-by-value. In International Conference on Functional Programing, Philadelphia, May 1996. ACM Press."},{"issue":"4","key":"187567_CR27","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P. Wadler","year":"1990","unstructured":"Philip Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2(4):461\u2013493, December 1990.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010012532463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010012532463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010012532463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:49:32Z","timestamp":1751982572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010012532463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["187567"],"URL":"https:\/\/doi.org\/10.1023\/a:1010012532463","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"type":"print","value":"1388-3690"},{"type":"electronic","value":"1573-0557"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}