{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:57Z","timestamp":1751983677731},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525929"},{"type":"electronic","value":"9783540470458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52592-0_61","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:40:11Z","timestamp":1330206011000},"page":"152-160","source":"Crossref","is-referenced-by-count":10,"title":["Higher order escape analysis: Optimizing stack allocation in functional program implementations"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young","family":"Gil Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"A. Appel and D.B. MacQueen. A standard ML compiler. In Proceedings of the 1987 Conference on Functional Programming and Computer Architecture. September, 1987.","DOI":"10.1007\/3-540-18317-5_17"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"J.M. Barth. Shifting garbage collection overhead to compile time. Communications of the ACM, 20(7), July 1977.","DOI":"10.1145\/359636.359713"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"G.L. Burn, C.L. Hankin, and S. Abramsky. The theory of strictness analysis for higher order functions. In Programs as Data Objects, LNCS 217. Springer-Verlag. 1985","DOI":"10.1007\/3-540-16446-4_3"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Annual ACM Symposium on Principles of Programming Languages. January 1977.","DOI":"10.1145\/512950.512973"},{"key":"9_CR5","unstructured":"D.R. Chase. Garbage Collection and Other Optimizations. Ph.D. Thesis, Rice University. 1987"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"D.R. Chase. Safety considerations for storage allocation optimizations. In Proceedings of the 1987 Conference on Functional Programming and Computer Architecture. September, 1987.","DOI":"10.1145\/53990.53991"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"B. Goldberg. Detecting sharing of partial applications in functional programs. In Proceedings of the 1987 Conference on Functional Programming and Computer Architecture. September, 1987.","DOI":"10.1007\/3-540-18317-5_22"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-order strictness analysis for the untyped lambda calculus. In Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages. January, 1986.","DOI":"10.1145\/512644.512653"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"N. Jones and S. Muchnick. Binding time optimization in programming languages: An approach to the design of an ideal language. In Proceedings of the 3rd Annual ACM Symposium on Principles of Programming Languages. January 1976.","DOI":"10.1145\/800168.811542"},{"key":"9_CR10","unstructured":"D. Kranz. ORBIT: An Optimizing Compiler for Scheme. Ph.D. Thesis, Yale University, Department of Computer Science. May 1988."},{"key":"9_CR11","unstructured":"S. Muchnick and N. Jones, editors. Flow Analysis and Optimization of LISP-like Structures. Prentice-Hall, 1981."},{"key":"9_CR12","unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. Ph.D. Thesis, University of Edinburgh. 1981."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"C. Ruggieri and T.P. Murtagh. Lifetime analysis of dynamically allocated objects. Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages. January, 1988.","DOI":"10.1145\/73560.73585"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0096-0551(75)90015-6","volume":"1","author":"J.T. Schwartz","year":"1975","unstructured":"J.T. Schwartz. Optimization of very high level languages \u2014 I. Value transmission and its corollaries. Journal of Computer Languages, 1:161\u2013194, 1975.","journal-title":"Journal of Computer Languages"},{"key":"9_CR15","unstructured":"P. Wadler, Strictness analysis on non-flat domains. In Abstract Interpretation of Declarative Languages. C. L. Hankin and S. Abramsky, editors. Ellis Horwood, 1987."}],"container-title":["Lecture Notes in Computer Science","ESOP '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52592-0_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T13:35:12Z","timestamp":1713620112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52592-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525929","9783540470458"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-52592-0_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}