{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:02Z","timestamp":1725664382744},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603689"},{"type":"electronic","value":"9783540455110"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60368-9_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:23:00Z","timestamp":1330280580000},"page":"119-144","source":"Crossref","is-referenced-by-count":1,"title":["Compile-time garbage collection for lazy functional languages"],"prefix":"10.1007","author":[{"given":"G. W.","family":"Hamilton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-15975-4_48","volume":"201","author":"L. Augustsson","year":"1985","unstructured":"Augustsson, L.: Compiling Pattern Matching. Lecture Notes in Computer Science 201 (1985) 368\u2013381","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR2","unstructured":"Baker-Finch, C.A.: Relevance and Contraction: A Logical Basis for Strictness and Sharing Analysis. Submitted to the Journal of Functional Programming (1992)"},{"issue":"7","key":"3_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/359636.359713","volume":"20","author":"J.M. Barth","year":"1977","unstructured":"Barth, J.M.: Shifting Garbage Collection Overhead to Compile Time. Communications of the ACM 20(7) (1977) 513\u2013518","journal-title":"Communications of the ACM"},{"issue":"9","key":"3_CR4","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/360336.360345","volume":"19","author":"L.P. Deutsch","year":"1976","unstructured":"Deutsch, L.P., Bobrow, D.G.: An Efficient, Incremental, Automatic Garbage Collector. Communications of the ACM 19(9) (1976) 522\u2013526","journal-title":"Communications of the ACM"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Guzm\u00e1n, J.C., Hudak, P.: Single Threaded Polymorphic Lambda Calculus. Fifth IEEE Symposium on Logic in Computer Science (1990)","DOI":"10.1109\/LICS.1990.113759"},{"key":"3_CR6","unstructured":"Hamilton, G.W.: Compile-Time Optimisation of Store Usage in Lazy Functional Programs. PhD Thesis, University of Stirling (1993)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Hamilton, G.W., Jones, S.B.: Compile-Time Garbage Collection by Necessity Analysis. Technical Report TR 67, Dept. of Computing Science and Mathematics, University of Stirling (1990)","DOI":"10.1007\/978-1-4471-3810-5_6"},{"key":"3_CR8","unstructured":"Hudak, P.: A Semantic Model of Reference Counting and its Abstraction. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages (1987) 45\u201362"},{"key":"3_CR9","unstructured":"Hughes, S.: Static Analysis of Store Use in Functional Programs. PhD Thesis, Imperial College, University of London (1991)"},{"issue":"4","key":"3_CR10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/48022.48025","volume":"10","author":"K. Inoue","year":"1988","unstructured":"Inoue, K., Seki, H., Yagi, H.: Analysis of Functional Programs to Detect Run-Time Garbage Cells. ACM Transactions on Programming Languages and Systems 10(4) (1988) 555\u2013578","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-52592-0_66","volume":"432","author":"T.P. Jensen","year":"1990","unstructured":"Jensen, T.P., Mogensen, T.\u00c6.: A Backwards Analysis for Compile-Time Garbage Collection. Lecture Notes in Computer Science 432 (1990) 227\u2013239","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR12","unstructured":"Jensen, T.P.: Context Analysis of Functional Programs. Master's Thesis, University of Copenhagen (1990)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Johnsson, T.: Lambda Lifting: Transforming Programs to Recursive Equations. Proceedings of the Workshop on Implementation of Functional Languages (1985) 165\u2013180","DOI":"10.1007\/3-540-15975-4_37"},{"key":"3_CR14","unstructured":"Jones, S.B., Le M\u00e9tayer, D.: Compile-Time Garbage Collection by Sharing Analysis. Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture (1989) 54\u201374"},{"key":"3_CR15","unstructured":"Launchbury, J., Gill, A., Hughes, J., Marlow, S., Peyton Jones, S.L., Wadler, P.: Avoiding Unnecessary Updates. Proceedings of the Fifth Annual Glasgow Workshop on Functional Programming (1992) 144\u2013153"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Marlow, S.: Update Avoidance Analysis by Abstract Interpretation. Draft Proceedings of the Sixth Annual Glasgow Workshop on Functional Programming (1993)","DOI":"10.1007\/978-1-4471-3236-3_14"},{"key":"3_CR17","unstructured":"Mycroft, A.: Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD Thesis, University of Edinburgh (1981)"},{"key":"3_CR18","unstructured":"Schwarz, J.: Verifying the Safe Use of Destructive Operations in Applicative Programs. Proceedings of the Third International Symposium on Programming (1978) 395\u2013411"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Smetsers, S., Barendsen, E., van Eekelen, M., Plasmeijer, R.: Guaranteeing Safe Destructive Updates through a Type System with Uniqueness Information for Graphs. Technical Report 93-4, University of Nijmegen (1993)","DOI":"10.1007\/3-540-57787-4_23"},{"key":"3_CR20","unstructured":"Wadler, P.: Efficient Compilation of Pattern Matching. In S. L. Peyton Jones, editor, The Implementation of Functional Programming Languages (1987) 78\u2013103"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: Transforming Programs to Eliminate Trees. Theoretical Computer Science 73 (1990) 231\u2013248","journal-title":"Theoretical Computer Science"},{"key":"3_CR22","unstructured":"Wadler, P.: Linear Types Can Change the World!. In M. Broy and C. Jones, editors, IFIP Working Conference on Programming Concepts and Methods (1990)"},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3540543961_11","volume":"523","author":"D. Wakeling","year":"1991","unstructured":"Wakeling, D., Runciman, C: Linearity and Laziness. Lecture Notes in Computer Science 523 (1991) 215\u2013240","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Wright, D.A., Baker-Finch, C.A.: Usage Analysis With Natural Reduction Types. Third International Workshop on Static Analysis (1993)","DOI":"10.1007\/3-540-57264-3_46"}],"container-title":["Lecture Notes in Computer Science","Memory Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60368-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:41Z","timestamp":1605646721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60368-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603689","9783540455110"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60368-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}