{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:35Z","timestamp":1780994615389,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10990-008-9035-3","type":"journal-article","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T18:50:57Z","timestamp":1222714257000},"page":"333-358","source":"Crossref","is-referenced-by-count":9,"title":["Flattening tuples in an SSA intermediate representation"],"prefix":"10.1007","volume":"21","author":[{"given":"Lukasz","family":"Ziarek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Weeks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suresh","family":"Jagannathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,9,30]]},"reference":[{"key":"9035_CR1","doi-asserted-by":"crossref","unstructured":"Cejtin, H., Jagannathan, S., Weeks, S.: Flow-directed closure conversion for typed languages. In: ESOP\u00a0\u201900: Proceedings of the 9th European Symposium on Programming Languages and Systems, London, UK, pp.\u00a056\u201371 (2000)","DOI":"10.1007\/3-540-46425-5_4"},{"key":"9035_CR2","unstructured":"Davis, M.K.: Deforestation: Transformation of functional program to eliminate intermediate trees (1987)"},{"key":"9035_CR3","unstructured":"Elsman, M.: Program modules, separate compilation, and intermodule optimization (1999)"},{"key":"9035_CR4","doi-asserted-by":"crossref","unstructured":"Hall, C.V., Peyton Jones, S.L., Sansom, P.M.: Unboxing using specialisation. In: GLA (1994)","DOI":"10.1007\/978-1-4471-3573-9_7"},{"key":"9035_CR5","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., Thiemann, P., Weeks, S., Wright, A.: Single and loving it: must-alias analysis for higher-order languages. In: POPL \u201998: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, NY, USA, pp.\u00a0329\u2013341 (1998)","DOI":"10.1145\/268946.268973"},{"issue":"3","key":"9035_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/202530.202532","volume":"30","author":"R.A. Kelsey","year":"1993","unstructured":"Kelsey, R.A.: A correspondence between continuation passing style and static single assignment form. SIGPLAN Not. 30(3), 13\u201322 (1993)","journal-title":"SIGPLAN Not."},{"key":"9035_CR7","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Unboxed objects and polymorphic typing. In: POPL \u201992: Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, NY, USA, pp.\u00a0177\u2013188 (1992)","DOI":"10.1145\/143165.143205"},{"key":"9035_CR8","unstructured":"Leroy, X.: The effectiveness of type-based unboxing (1997)"},{"key":"9035_CR9","doi-asserted-by":"crossref","unstructured":"Minamide, Y., Garrigue, J.: On the runtime complexity of type-directed unboxing. In: ICFP \u201998: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, New York, NY, USA, pp.\u00a01\u201312 (1998)","DOI":"10.1145\/289423.289424"},{"issue":"4","key":"9035_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1023\/A:1026551132647","volume":"13","author":"T.A. Mogensen","year":"2000","unstructured":"Mogensen, T.A.: Glossary for partial evaluation and related topics. High.-Order Symb. Comput. 13(4), 355\u2013368 (2000)","journal-title":"High.-Order Symb. Comput."},{"key":"9035_CR11","unstructured":"Morrissett, G.: Compiling with types (1995)"},{"key":"9035_CR12","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, Boston, Massachusetts, pp.\u00a0717\u2013740. Reprinted in High.-Order Symb. Comput. 11(4), 363\u2013397 (1998)"},{"key":"9035_CR13","unstructured":"Shao, Z.: Compiling standard ML for efficient execution on modern machines (1994)"},{"key":"9035_CR14","doi-asserted-by":"crossref","unstructured":"Shao, Z., Appel, A.W.: A type-based compiler for standard ML. In: PLDI \u201995: Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, New York, NY, USA, pp.\u00a0116\u2013129 (1995)","DOI":"10.1145\/207110.207123"},{"issue":"1","key":"9035_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/345099.345125","volume":"22","author":"Z. Shao","year":"2000","unstructured":"Shao, Z., Appel, A.W.: Efficient and safe-for-space closure conversion. ACM Trans. Program. Lang. Syst. 22(1), 129\u2013161 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9035_CR16","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control flow analysis in scheme. In: PLDI \u201988: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, New York, NY, USA, pp.\u00a0164\u2013174 (1988)","DOI":"10.1145\/53990.54007"},{"key":"9035_CR17","unstructured":"Shivers, O.: Control-flow analysis of higher-order languages or taming lambda. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania. Technical Report CMU-CS-91-145 (1991)"},{"issue":"1","key":"9035_CR18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/239912.239915","volume":"19","author":"P.A. Steckler","year":"1997","unstructured":"Steckler, P.A., Wand, M.: Lightweight closure conversion. ACM Trans. Program. Lang. Syst. 19(1), 48\u201386 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"9035_CR19","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1145\/989393.989449","volume":"39","author":"D. Tarditi","year":"2004","unstructured":"Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., Lee, P.: TIL: a type-directed, optimizing compiler for ML. SIGPLAN Not. 39(4), 554\u2013567 (2004)","journal-title":"SIGPLAN Not."},{"key":"9035_CR20","doi-asserted-by":"crossref","unstructured":"Tofte, M.: A brief introduction to regions. In: ISMM \u201998: Proceedings of the 1st International Symposium on Memory Management, New York, NY, USA, pp.\u00a0186\u2013195 (1998)","DOI":"10.1145\/286860.286882"},{"issue":"3","key":"9035_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/B:LISP.0000029446.78563.a4","volume":"17","author":"M. Tofte","year":"2004","unstructured":"Tofte, M., Birkedal, L., Elsman, M., Hallenberg, N.: A retrospective on region-based memory management. High.-Order Symb. Comput. 17(3), 245\u2013265 (2004)","journal-title":"High.-Order Symb. Comput."},{"issue":"4","key":"9035_CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0956796898003086","volume":"8","author":"A. Tolmach","year":"1998","unstructured":"Tolmach, A., Oliva, D.P.: From ML to Ada: Strongly-typed language interoperability via source translation. J. Funct. Program. 8(4), 367\u2013412 (1998)","journal-title":"J. Funct. Program."},{"key":"9035_CR23","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time. In: LFP \u201984: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, New York, NY, USA, pp.\u00a045\u201352 (1984)","DOI":"10.1145\/800055.802020"},{"key":"9035_CR24","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Listlessness is better than laziness II: composing listless functions In: On Programs as Data Objects, New York, NY, USA, pp.\u00a0282\u2013305 (1985)","DOI":"10.1007\/3-540-16446-4_16"},{"issue":"2","key":"9035_CR25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231\u2013248 (1989). Special issue on ESOP\u201988, the Second European Symposium on Programming, Nancy, France, March 21\u201324, 1988","journal-title":"Theor. Comput. Sci."},{"key":"9035_CR26","doi-asserted-by":"crossref","unstructured":"Wand, M., Siveroni, I.: Constraint systems for useless variable elimination. In: POPL \u201999: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, NY, USA, pp.\u00a0291\u2013302 (1999)","DOI":"10.1145\/292540.292567"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-008-9035-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-008-9035-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-008-9035-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T08:24:26Z","timestamp":1738398266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-008-9035-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9035"],"URL":"https:\/\/doi.org\/10.1007\/s10990-008-9035-3","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}