{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:14Z","timestamp":1742598614758,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:28:15Z","timestamp":1330273695000},"page":"147-161","source":"Crossref","is-referenced-by-count":7,"title":["Generalized boxings, congruences and partial inlining"],"prefix":"10.1007","author":[{"given":"Jean","family":"Goubault","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"9_CR1","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In 15th PoPL, pages 1\u201311, 1988.","DOI":"10.1145\/73560.73561"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"A. Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"9_CR4","volume-title":"Technical report","author":"J. Cocke","year":"1970","unstructured":"J. Cocke, and J. Schwartz. Programming languages and their compilers: preliminary notes. Technical report, Courant Institute of Mathematical Sciences, New York, 1970. second, revised version."},{"issue":"1","key":"9_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P. Cousot","year":"1979","unstructured":"P. Cousot, and R. Cousot. A constructive version of Tarski's fixpoint theorems. Pacific J. Math., 82(1):43\u201357, 1979.","journal-title":"Pacific J. Math."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method for computing static single assignment form. In 16th PoPL, pages 25\u201335, 1989.","DOI":"10.1145\/75277.75280"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"K. De Bosschere, S. Debray, D. Gudeman, and S. Kannan. Call forwarding: A simple interprocedural optimization technique for dynamically typed languages. In 21st PoPL, pages 409\u2013420, 1994.","DOI":"10.1145\/174675.178041"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In ICCL'92, 1992.","DOI":"10.1109\/ICCL.1992.185463"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P. K. Downey","year":"1980","unstructured":"P. K. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758\u2013771, 1980.","journal-title":"Journal of the ACM"},{"key":"9_CR10","unstructured":"J. H. Gallier. Logic for Computer Science \u2014 Foundations of Automatic Theorem Proving. John Wiley and Sons, 1987."},{"key":"9_CR11","unstructured":"J. Goubault. Une impl\u00e9mentation efficace de structures de donn\u00e9es ensemblistes, fond\u00e9e sur le hash-consing. In JFLA '93, 1993."},{"key":"9_CR12","unstructured":"J. Goubault. HimML: Standard ML with fast sets and maps. In ACM Workshop on ML, 1994."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"F. Henglein and J. J\u00f8rgensen. Formally optimal boxing. In 21st PoPL, pages 213\u2013226, 1994.","DOI":"10.1145\/174675.177874"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"R. Johnson and K. Pingali. Dependence-based program analysis. In PLDI'93, pages 78\u201389, 1993.","DOI":"10.1145\/155090.155098"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"K. W. Kennedy. Node listings applied to data flow analysis. In 3rd PoPL, pages 10\u201321, 1976.","DOI":"10.1145\/512976.512978"},{"issue":"4","key":"9_CR16","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308\u2013320, 1964.","journal-title":"Computer Journal"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"X. Leroy. Unboxed objects and polymorphic typing. In 19th PoPL, pages 177\u2013188, 1992.","DOI":"10.1145\/143165.143205"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"G. Nelson, and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356\u2013364, April 1980.","journal-title":"Journal of the ACM"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"J. Peterson. Untagged data in tagged environments: Choosing optimal representations at compile time. In FPCA '89, pages 89\u201399, 1989.","DOI":"10.1145\/99370.99377"},{"key":"9_CR20","unstructured":"S. L. Peyton-Jones. Unboxed values as first-class citizens. In FPLCA'91. LNCS 523, Springer-Verlag, 1991."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In 15th PoPL, pages 12\u201327, 1988.","DOI":"10.1145\/73560.73562"},{"key":"9_CR22","unstructured":"G. L. Steele. Rabbit: A compiler for Scheme. Technical Report MIT AI TR 474, MIT, May 1978."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"J.-P. Talpin and P. Jouvelot. The type and effect discipline. In LICS'92, 1992.","DOI":"10.1109\/LICS.1992.185530"},{"key":"9_CR24","unstructured":"L. Trabb Pardo. Set representation and set intersection. Technical report, Stanford University, 1978. PhD thesis."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"J. Vitter and P. Flajolet. Average-case analysis of algorithms and data structures. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 9. Elsevier Science Publishers b.v., 1990.","DOI":"10.1016\/B978-0-444-88071-0.50014-X"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"P. Wadler. Deforestation: Transforming programs to eliminate trees. TCS, 73:231\u2013248, 1990.","journal-title":"TCS"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"D. Weise, R. F. Crew, M. Ernst, and B. Steensgard. Value dependence graphs: Representation without taxation. In 21th PoPL, pages 297\u2013310, 1994.","DOI":"10.1145\/174675.177907"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:33:16Z","timestamp":1742596396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}