{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:32Z","timestamp":1725663032498},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540183174"},{"type":"electronic","value":"9783540478799"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:32:18Z","timestamp":1330198338000},"page":"408-425","source":"Crossref","is-referenced-by-count":12,"title":["Detecting sharing of partial applications in functional programs"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"22_CR1","first-page":"132","volume-title":"Variations on strictness analysis","author":"A. Bloss","year":"1986","unstructured":"Adrienne Bloss and Paul Hudak. Variations on strictness analysis. In Proc. 1986 ACM Conference on Lisp and Functional Programming, pages 132\u2013142, ACM SIGPLAN\/SIGACT\/SIGART, Cambridge, Massachusetts, August 1986."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"G.L. Burn, C.L. Hankin, and S. Abramsky. The theory of strictness analysis for higher order functions. In LNCS 217: Programs as Data Objects, pages 42\u201362, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-16446-4_3"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"C. Clack and S.L. Peyton Jones. Strictness analysis \u2014 a practical approach. In Functional Programming Languages and Computer Architecture, pages 35\u201349, Springer-Verlag LNCS 201, September 1985.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"22_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 4th ACM Sym. on Prin. of Prog. Lang., pages 238\u2013252, ACM, 1977.","DOI":"10.1145\/512950.512973"},{"key":"22_CR5","volume-title":"Combinatory Logic","author":"H. K. Curry","year":"1958","unstructured":"H.K. Curry and R. Feys. Combinatory Logic. Noth-Holland Pub. Co., Amsterdam, 1958."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-order strictness analysis for untyped lambda calculus. In 12th ACM Sym. on Prin. of Prog. Lang., pages 97\u2013109, January 1986.","DOI":"10.1145\/512644.512653"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes. Super-combinators: a new implementation method for applicative languages. In Proc. 1982 ACM Conf. on LISP and Functional Prog., pages 1\u201310, ACM, August 1982.","DOI":"10.1145\/800068.802129"},{"key":"22_CR8","unstructured":"T. Johnsson. The G-machine: an abstract machine for graph reduction. Technical Report, PMG, Dept. of Computer Science, Chalmers Univ. of Tech., February 1985."},{"key":"22_CR9","unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, Univ. of Edinburgh, 1981."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Schonfinkel","year":"1924","unstructured":"M. Schonfinkel. Uber die bausteine der mathematischen logik. Mathematische Annalen, 92:305, 1924.","journal-title":"Mathematische Annalen"},{"key":"22_CR11","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"J. E. Stoy","year":"1977","unstructured":"J.E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, Cambridge, Mass., 1977."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D.A. Turner. A new implementation technique for applicative languages. Software \u2014 Practice and Experience, 9:31\u201349, 1979.","journal-title":"Software \u2014 Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:39Z","timestamp":1605644079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}