{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:35:46Z","timestamp":1743136546734,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421962"},{"type":"electronic","value":"9783540453321"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45332-6_2","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T15:56:22Z","timestamp":1183478182000},"page":"27-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Program Representation Size in an Intermediate Language with Intersection and Union Types"],"prefix":"10.1007","author":[{"given":"Allyn","family":"Dimock","sequence":"first","affiliation":[]},{"given":"Ian","family":"Westmacott","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Muller","sequence":"additional","affiliation":[]},{"given":"Franklyn","family":"Turbak","sequence":"additional","affiliation":[]},{"given":"J. B.","family":"Wells","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Considine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-49538-X_2","volume":"952","author":"O. Agesen","year":"1995","unstructured":"O. Agesen. The Cartesian product algorithm. In Proceedings of ECOOP\u201995, Seventh European Conference on Object-Oriented Programming, vol. 952, pp. 2\u201326. Springer-Verlag, 1995.","journal-title":"Proceedings of ECOOP\u201995, Seventh European Conference on Object-Oriented Programming"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"T. Amtoft and F. Turbak. Faithful translations between polyvariant flows and polymorphic types. In ESOP\u2019 00 [ESOP00], pp. 26\u201340.","DOI":"10.1007\/3-540-46425-5_2"},{"key":"2_CR3","unstructured":"A. Banerjee. A modular, polyvariant, and type-based closure analysis. In ICFP\u2019 97 [ICFP97]."},{"key":"2_CR4","unstructured":"N. Benton, A. Kennedy, and G. Russell. Compiling Standard ML to Java bytecodes. In ICFP\u2019 98 [ICFP98]"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"H.-J. Boehm. Space efficient conservative garbage collection. In Proc. ACM SIGPLAN\u2019 93 Conf. Prog. Lang. Design & Impl., pp. 197\u2013206, 1993.","DOI":"10.1145\/173262.155109"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"H. Cejtin, S. Jagannathan, and S. Weeks. Flow-directed closure conversion for typed languages. In ESOP\u2019 00 [ESOP00], pp. 56\u201371.","DOI":"10.1007\/3-540-46425-5_4"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"K. Crary, S. Weirich, and G. Morrisett. Intensional polymorphism in type erasure semantics. In ICFP\u2019 98 [ICFP98], pp. 301\u2013312.","DOI":"10.1145\/291251.289459"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed representation transformations. In ICFP\u2019 97 [ICFP97], pp. 11\u201324.","DOI":"10.1145\/258949.258952"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"A. Dimock, I. Westmacott, R. Muller, F. Turbak, J. B. Wells, and J. Considine. Program representation size in an intermediate language with intersection and union types. Technical Report BUCS-TR-2001-02, Comp. Sci. Dept., Boston Univ., Mar. 2001.","DOI":"10.1007\/3-540-45332-6_2"},{"key":"2_CR10","unstructured":"K.-F. Fax\u00e9en. The costs and bene ts of cloning in a lazy functional language. In Trends in Functional Programming, Volume 2. Intellect, 2001."},{"key":"2_CR11","unstructured":"R. Fitzgerald, T. Knoblock, E. Ruf, B. Steensgaard, and D. Tarditi. Marmot: An optimizing compiler for Java. Technical Report 99-33, Microsoft Research, 1999."},{"key":"2_CR12","unstructured":"L. George. MLRISC: Customizable and reusable code generators. Technical report, Bell Labs, 1997."},{"key":"2_CR13","unstructured":"F. Henglein. Simple closure analysis. Technical Report D-193, DIKU, Mar. 1992."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"J. Hannan and P. Hicks. Higher-order uncurrying. In POPL\u2019 98 [POPL98], pp. 1\u201311.","DOI":"10.1145\/268946.268947"},{"key":"2_CR15","unstructured":"Proc. 1997 Int\u2019l Conf. Functional Programming. ACM Press, 1997."},{"key":"2_CR16","unstructured":"Proc. 1998 Int\u2019l Conf. Functional Programming. ACM Press, 1998."},{"issue":"1-3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","volume":"32","author":"S. L. P. Jones","year":"1998","unstructured":"S. L. P. Jones and A. L. M. Santos. A transformation-based optimiser for Haskell. Sci. Comput. Programming, 32(1-3):3\u201347, Sept. 1998.","journal-title":"Sci. Comput. Programming"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"S. Jagannathan and S. Weeks. A unified treatment of flow analysis in higher-order languages. In Conf. Rec. 22nd Ann. ACM Symp. Princ. of Prog. Langs., pp. 393\u2013407, 1995.","DOI":"10.1145\/199448.199536"},{"key":"2_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032745","volume-title":"Proc. 4th Int\u2019l Static Analysis Symp","author":"S. Jagannathan","year":"1997","unstructured":"S. Jagannathan, S. Weeks, and A. Wright. Type-directed flow analysis for typed intermediate languages. In Proc. 4th Int\u2019l Static Analysis Symp., vol. 1302 of LNCS. Springer-Verlag, 1997."},{"key":"2_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BFb0026813","volume-title":"7th Int\u2019l Symp. Prog. Lang.: Implem., Logics & Programs, PLILP\u2019 95","author":"F. Kamareddine","year":"1995","unstructured":"F. Kamareddine and A. R\u00edos. A \u03bb-calculus \u00e0a la de Bruijn with explicit substitution. In 7th Int\u2019l Symp. Prog. Lang.: Implem., Logics & Programs, PLILP\u2019 95, vol. 982 of LNCS, pp. 45\u201362. Springer-Verlag, 1995."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury and J. B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL\u2019 99: 26th ACM Symp. Princ. of Prog. Langs., pp. 161\u2013174, 1999.","DOI":"10.1145\/292540.292556"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"L. Mauborgne. Improving the representation of in nite trees to deal with sets of trees. In ESOP\u2019 00 [ESOP00], pp. 275\u2013289.","DOI":"10.1007\/3-540-46425-5_18"},{"key":"2_CR23","unstructured":"J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In Conf. Rec. POPL\u2019 96: 23rd ACM Symp. Princ. of Prog. Langs., 1996.","DOI":"10.1145\/237721.237791"},{"key":"2_CR25","unstructured":"G. Morrisett. Compiling with Types. Ph.D. thesis, Carnegie Mellon University, 1995."},{"issue":"3","key":"2_CR26","first-page":"528","volume":"21","author":"G. Morrisett","year":"1999","unstructured":"G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. ACM Trans. on Prog. Langs. & Systs., 21(3):528\u2013569, May 1999.","journal-title":"ACM Trans. on Prog. Langs. & Systs"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"G. C. Necula. Proof-carrying code. In POPL\u2019 97 [POPL97], pp. 106\u2013119.","DOI":"10.1145\/263699.263712"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. In nitary control flow analysis: A collecting semantics for closure analysis. In POPL\u2019 97 [POPL97], pp. 332\u2013345.","DOI":"10.1145\/263699.263745"},{"key":"2_CR29","unstructured":"B. C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, Feb. 1991."},{"key":"2_CR30","unstructured":"S. L. Peyton Jones. Compiling Haskell by program transformation: A report from the trenches. In Proc. European Symp. on Programming, 1996."},{"key":"2_CR31","unstructured":"S. L. Peyton Jones and E. Meijer. Henk: A typed intermediate language. In TIC\u2019 97 [TIC97]."},{"key":"2_CR32","unstructured":"Conf. Rec. POPL\u2019 97: 24th ACM Symp. Princ. of Prog. Langs., 1997."},{"key":"2_CR33","unstructured":"Conf. Rec. POPL\u2019 98: 25th ACM Symp. Princ. of Prog. Langs., 1998."},{"key":"2_CR34","unstructured":"J. Palsberg and C. Pavlopoulou. From polyvariant flow information to intersection and union types. J. Funct. Programming, 200X. To appear."},{"key":"2_CR35","unstructured":"O. Shivers. Control Flow Analysis of Higher Order Languages. Ph.D. thesis, Carnegie Mellon University, 1991."},{"key":"2_CR36","unstructured":"J. M. Siskind. Flow-directed lightweight closure conversion. Technical Report 99-190R, NEC Research Institute, Inc., Dec. 1999."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Z. Shao, C. League, and S. Monnier. Implementing typed intermediate languages. In ICFP\u2019 98 [ICFP98], pp. 313\u2013323.","DOI":"10.1145\/291251.289460"},{"issue":"1","key":"2_CR38","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/239912.239915","volume":"19","author":"P. Steckler","year":"1997","unstructured":"P. Steckler and M. Wand. Lightweight closure conversion. ACM Trans. on Prog. Langs. & Systs., 19(1):48\u201386, Jan. 1997.","journal-title":"ACM Trans. on Prog. Langs. & Systs"},{"key":"2_CR39","unstructured":"D. Tarditi. Design and Implementation of Code Optimizations for a Type-Directed Compiler for Standard ML. Ph.D. thesis, Carnegie Mellon University, Dec. 1996."},{"key":"2_CR40","unstructured":"Proc. First Int\u2019l Workshop on Types in Compilation June 1997. The printed TIC\u2019 97 proceedings is Boston Coll. Comp. Sci. Dept. Tech. Rep. BCCS-97-03. The individual papers are available at http:\/\/www.cs.bc.edu\/~muller\/TIC97\/ or http:\/\/oak.bc.edu\/~muller\/TIC97\/."},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: A type-directed optimizing compiler for ML. In Proc. ACM SIGPLAN\u2019 96 Conf. Prog. Lang. Design & Impl., 1996.","DOI":"10.21236\/ADA306265"},{"issue":"4","key":"2_CR42","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0956796898003086","volume":"8","author":"A. P. Tolmach","year":"1998","unstructured":"A. P. Tolmach and D. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. J. Funct. Programming, 8(4):367\u2013412, 1998.","journal-title":"J. Funct. Programming"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"A. Tolmach. Tag-free garbage collection using explict type parameters. In Proc. 1994 ACM Conf. LISP Funct. Program., pp. 1\u201311, 1994.","DOI":"10.1145\/182590.182411"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"J. B. Wells, A. Dimock, R. Muller, and F. Turbak. A typed intermediate language for flow-directed compilation. In Proc. 7th Int\u2019l Joint Conf. Theory & Practice of Software Development, pp.757\u2013771, 1997. Superseded by [WDMT0X].","DOI":"10.1007\/BFb0030639"},{"key":"2_CR45","unstructured":"J. B. Wells, A. Dimock, R. Muller, and F. Turbak. A calculus with polymorphic and polyvariant flow types. J. Funct. Programming, 200X. To appear. Supersedes [WDMT97]."},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"M. Wand and P. Steckler. Selective and lightweight closure conversion. In Conf. Rec. 21st Ann. ACM Symp. Princ. of Prog. Langs., pp. 435\u2013445, 1994.","DOI":"10.1145\/174675.178044"}],"container-title":["Lecture Notes in Computer Science","Types in Compilation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45332-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:03:12Z","timestamp":1737172992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45332-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421962","9783540453321"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/3-540-45332-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"13 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}