{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:09:07Z","timestamp":1760044147643,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44716-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"78-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Higher-Order Colon Translation"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[]},{"given":"Lasse R.","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"5_CR1","volume-title":"Compiling with Continuations","author":"A. W. Appel","year":"1992","unstructured":"Andrew W. Appel. Compiling with Continuations. Cambridge University Press, New York, 1992."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Olivier Danvy, Belmina Dzac, and Frank Pfenning. On proving syntactic properties of CPS programs. In Third International Workshop on Higher-Order Operational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science, pages 19\u201331, Paris, France, September 1999. Also available as the technical report BRICS RS-99-23.","DOI":"10.7146\/brics.v6i23.20092"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O. Danvy","year":"1992","unstructured":"Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361\u2013391, December 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Rewriting Techniques and Applications","author":"O. Danvy","year":"1998","unstructured":"Olivier Danvy and Kristoffer H\u2205gsbro Rose. Higher-order rewriting and partial evaluation. In Tobias Nipkow, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science, Kyoto, Japan, March 1998. Springer-Verlag. Extended version available as the technical report BRICS-RS-97-46."},{"key":"5_CR5","series-title":"PhD thesis","volume-title":"The Calculi of \u03bb-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages","author":"M. Felleisen","year":"1987","unstructured":"Matthias Felleisen. The Calculi of \u03bb-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, August 1987."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In Hans-J. Boehm, editor, Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 458\u2013471, Portland, Oregon, January 1994. ACM Press.","DOI":"10.1145\/174675.178053"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S0956796897002748","volume":"7","author":"J. Hatcliff","year":"1997","unstructured":"John Hatcliff and Olivier Danvy. Thunks and the \u03bb-calculus. Journal of Functional Programming, 7(2):303\u2013319, 1997. Extended version available as the technical report BRICS RS-97-7.","journal-title":"Journal of Functional Programming"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ulrik J\u2205rring and William L. Scherlis. Compilers and staging transformations. In Mark Scott Johnson and Ravi Sethi, editors, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 86\u201396, St. Petersburg, Florida, January 1986. ACM Press.","DOI":"10.1145\/512644.512652"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"Gordon D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"issue":"3\/4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"J. C. Reynolds","year":"1993","unstructured":"John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3\/4):233\u2013247, December 1993.","journal-title":"Lisp and Symbolic Computation"},{"key":"5_CR11","series-title":"Technical Report AI-TR-474","volume-title":"Rabbit: A compiler for Scheme","author":"G. L. Steele Jr","year":"1978","unstructured":"Guy L. Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978."},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-55511-0_15","volume-title":"Correctness of procedure representations in higher-order assembly language","author":"M. Wand","year":"1992","unstructured":"Mitchell Wand. Correctness of procedure representations in higher-order assembly language. In Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, and David Schmidt, editors, Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics, number 598 in Lecture Notes in Computer Science, pages 294\u2013311, Pittsburgh, Pennsylvania, March 1991. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:13:55Z","timestamp":1612822435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}