{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:17Z","timestamp":1725487997422},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425588"},{"type":"electronic","value":"9783540448068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44806-3_6","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T14:21:36Z","timestamp":1184941296000},"page":"92-107","source":"Crossref","is-referenced-by-count":0,"title":["Static Transition Compression"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Damian","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Danvy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"key":"6_CR1","unstructured":"Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers:Principles, Techniques and Tools. Addison-Wesley, 1986."},{"key":"6_CR2","volume-title":"Modern Compiler Implementation in {C, Java, ML}","author":"A. W. Appel","year":"1998","unstructured":"Andrew W. Appel. Modern Compiler Implementation in {C, Java, ML}. Cambridge University Press, New York, 1998."},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/278283.278285","volume":"33","author":"A. W. Appel","year":"1998","unstructured":"Andrew W. Appel. SSA is functional programming. ACM SIGPLAN Notices, 33(4):17\u201320, April 1998.","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/953411.953412","volume":"13","author":"F. Baskett","year":"1978","unstructured":"Forest Baskett. The best simple code generation technique for while, for, and do loops. ACM SIGPLAN Notices, 13(4):31\u201332, April 1978.","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"6_CR5","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, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR6","volume-title":"Technical Report","author":"R. K. Dybvig","year":"1990","unstructured":"R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Computer Science Department, Indiana University, Bloomington, Indiana, February 1990."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Ana M. Erosa and Laurie J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Henri Bal, editor, Proceedings of the Fifth IEEE International Conference on Computer Languages, pages 229\u2013240, Toulouse, France, May 1994. IEEE Computer Society Press.","DOI":"10.1109\/ICCL.1994.288377"},{"issue":"6","key":"6_CR8","first-page":"30","volume":"6","author":"R. P. Gabriel","year":"1991","unstructured":"Richard P. Gabriel. LISP: Good news, bad news, how to win big. AI Expert, 6(6):30\u201339, June 1991.","journal-title":"AI Expert"},{"key":"6_CR9","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, 1993. Available online at http:\/\/www.dina.kvl.dk\/~sestoft\/pebook\/pebook.html ."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Richard A. Kelsey. A correspondence between continuation passing style and static single assignment form. In Michael Ernst, editor, ACM SIGPLAN Workshop on Intermediate Representations, SIGPLAN Notices, Vol. 30, No 3, pages 13\u201322, San Francisco, California, January 1995. ACM Press.","DOI":"10.1145\/202529.202532"},{"key":"6_CR11","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":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/1780.357262","volume":"6","author":"M. V. S. Ramanath","year":"1984","unstructured":"M. V. S. Ramanath and Marvin H. Solomon. Jump minimization in linear time. ACM Transactions on Programming Languages and Systems, 6(4):527\u2013545, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR13","volume-title":"Technical Report AI-TR-474","author":"G. L. S. Rabbit 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."},{"issue":"1\/2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1010026413531","volume":"13","author":"C. Strachey","year":"2000","unstructured":"Christopher Strachey and Christopher P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Higher-Order and Symbolic Computation, 13(1\/2):135\u2013152, 2000. Reprint of the technical monograph PRG-11, Oxford University Computing Laboratory (1974).","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"3","author":"M. N. Wegman","year":"1991","unstructured":"Mark N. Wegman and F. Ken Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 3(2):181\u2013210, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR16","unstructured":"Reinhard Wilhelm and Dieter Maurer. Compiler Design. Addison-Wesley, 1995."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Glynn Winskel. The Formal Semantics of Programming Languages. Foundation of Computing Series. The MIT Press, 1993.","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Lecture Notes in Computer Science","Semantics, Applications, and Implementation of Program Generation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44806-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T04:17:19Z","timestamp":1587788239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44806-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425588","9783540448068"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44806-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}