{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:25:05Z","timestamp":1742930705937,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319309354"},{"type":"electronic","value":"9783319309361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30936-1_10","type":"book-chapter","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T20:27:44Z","timestamp":1459283264000},"page":"187-200","source":"Crossref","is-referenced-by-count":3,"title":["Cutting Out Continuations"],"prefix":"10.1007","author":[{"given":"Graham","family":"Hutton","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Bahr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declaritive Programming (2003)","DOI":"10.1145\/888251.888254"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: From interpreter to compiler and virtual machine: a functional derivation. Technical report RS-03-14, BRICS, Department of Computer Science, University of Aarhus (2003)","DOI":"10.7146\/brics.v10i14.21784"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ipl.2004.02.012","volume":"90","author":"MS Ager","year":"2004","unstructured":"Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between call-by-need evaluators and lazy abstract machines. Inf. Process. Lett. 90(5), 223\u2013232 (2004)","journal-title":"Inf. Process. Lett."},{"key":"10_CR4","volume-title":"Program Construction: Calculating Implementations from Specifications","author":"R Backhouse","year":"2003","unstructured":"Backhouse, R.: Program Construction: Calculating Implementations from Specifications. Wiley, New York (2003)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1017\/S0956796815000180","volume":"25","author":"P Bahr","year":"2015","unstructured":"Bahr, P., Hutton, G.: Calculating correct compilers. J. Funct. Program. 25, 47 (2015)","journal-title":"J. Funct. Program."},{"key":"10_CR6","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M Felleisen","year":"1986","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD machine, and the $$\\lambda $$ \u03bb -calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts III, pp. 193\u2013217. Elsevier Science Publishers B.V., Amsterdam (1986)"},{"key":"10_CR7","unstructured":"Hutton, G., Bahr, P.: Associated Coq proofs. http:\/\/github.com\/pa-ba\/cps-defun"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Hutton, G., Wright, J.: Calculating an exceptional machine. In: Loidl, H.W. (ed.) Trends in Functional Programming. Intellect, February 2006","DOI":"10.2307\/j.ctv36xw0k5.7"},{"key":"10_CR9","unstructured":"Krivine, J.L.: Un Interpr\u00e9teur du Lambda-calcul (1985). Unpublished manuscript"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"PJ Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308\u2013320 (1964)","journal-title":"Comput. J."},{"key":"10_CR11","unstructured":"Meijer, E.: Calculating compilers. Ph.D. thesis, Katholieke Universiteit Nijmegen (1992)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of the ACM Annual Conference, pp. 717\u2013740 (1972)","DOI":"10.1145\/800194.805852"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/357172.357179","volume":"4","author":"M Wand","year":"1982","unstructured":"Wand, M.: Deriving target code as a representation of continuation semantics. ACM Trans. Program. Lang. Syst. 4(3), 496\u2013517 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR14","series-title":"Foundation of Computing Series","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages - An Introduction","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages - An Introduction. Foundation of Computing Series. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","A List of Successes That Can Change the World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30936-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T11:26:09Z","timestamp":1692271569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30936-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319309354","9783319309361"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30936-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}