{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:12Z","timestamp":1761610332175,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80284-1","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"69-86","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["A Foundation for Space-Safe Transformations of Call-by-Need Programs"],"prefix":"10.1016","volume":"26","author":[{"given":"J\u00f6rgen","family":"Gustavsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80284-1_BIB1","series-title":"North Holland","article-title":"The Lambda Calculus","author":"Barendregt","year":"1981"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB2","series-title":"In Proc. PLILP'96, volume 1140 of LNCS","first-page":"393","article-title":"Modeling sharing and recursion for weak reduction strategies using explicit substitution","author":"Z.-E.-A. Benaissa","year":"1996"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/232627.232650","article-title":"A provably time and space efficient implementation of nesl","author":"Blelloch","year":"1996","journal-title":"In Proc. ICFP'96"},{"year":"1998","series-title":"Higher Order Operational Techniques in Semantics.","key":"10.1016\/S1571-0661(05)80284-1_BIB4"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/289423.289427","article-title":"A type based sharing analysis for update avoidance and optimisation","author":"Gustavsson","year":"1998","journal-title":"In Proc. ICFP'98"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB6","article-title":"A Type Based Sharing Analysis for Update Avoidance and Optimisation","author":"Gustavsson","year":"1999","journal-title":"Licentiate thesis"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB7","series-title":"Proc. POPL'93","first-page":"144","article-title":"A natural semantics for lazy evaluation","author":"Launchbury","year":"1993"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB8","doi-asserted-by":"crossref","unstructured":"S. Marlow. Update avoidance analysis by abstract interpretation. In Proc. 1993 Glasgow Functional Programming Workshop, Workshops in Computing. Springer-Verlag, August 1993.","DOI":"10.1007\/978-1-4471-3236-3_14"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB9","series-title":"PhD thesis, University of Glasgow","article-title":"Deforestation for Higher-Order Functional Programs","author":"Marlow","year":"1995"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of the typed \u2137-calculus","volume":"4","author":"Milner","year":"1977","journal-title":"Theoretical Computer\u2013Science"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB11","article-title":"Space-profiling semantics of the call-by-value lambda calculus and the cps transformation","author":"Minamide","year":"1999","journal-title":"In Proc. HOOTS III"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB12","article-title":"Types for 0, 1 or many uses","author":"Mogensen","year":"1997","journal-title":"In Proc. Workshop on Implementation of Functional Languages (Draft)"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB13","series-title":"In Proc. POPL'99","first-page":"43","article-title":"Improvement in a lazy context: An operational theory for call-by-need","author":"Moran","year":"1999"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB14","series-title":"In Proc. FPCA '95","first-page":"66","article-title":"Abstract Models of Memory Management","author":"Morrisett","year":"1995"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB15","unstructured":"Greg Morrisett and Robert Harper. Semantics of memory management for polymorphic languages. In Gordon and Pitts [4], pages 175\u2013226."},{"key":"10.1016\/S1571-0661(05)80284-1_BIB16","series-title":"In Proc. ICFP'96","first-page":"1","article-title":"Let-floating: moving bindings to give faster programs","author":"Peyton Jones","year":"1996"},{"issue":"1\u20133","key":"10.1016\/S1571-0661(05)80284-1_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","article-title":"A transformation-based optimiser for Haskell","volume":"32","author":"Peyton Jones","year":"1998","journal-title":"Science of Computer Programming"},{"year":"1987","series-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","key":"10.1016\/S1571-0661(05)80284-1_BIB18"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB19","series-title":"PhD thesis, DIKU, University of Copenhagen, Denmark","article-title":"Operational Reduction Models for Functional Programming Languages","author":"Rose","year":"1996"},{"issue":"4","key":"10.1016\/S1571-0661(05)80284-1_BIB20","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1017\/S095679680000188X","article-title":"New Dimensions in Heap Profiling","volume":"6","author":"Runciman","year":"1996","journal-title":"Journal of Functional Programming"},{"issue":"2","key":"10.1016\/S1571-0661(05)80284-1_BIB21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S0956796800000708","article-title":"Heap Profiling of Lazy Functional Programs","volume":"3","author":"Runciman","year":"1993","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB22","series-title":"In Proc. 1991 Glasgow Functional Programming Workshop, Workshops in Computing Series","first-page":"298","article-title":"Operational theories of improvement in functional languages (extended abstract)","author":"Sands","year":"1991"},{"issue":"4","key":"10.1016\/S1571-0661(05)80284-1_BIB23","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1093\/logcom\/5.4.495","article-title":"A na\u00efve time analysis and its theory of cost equivalence","volume":"5","author":"Sands","year":"1995","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"10.1016\/S1571-0661(05)80284-1_BIB24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/227699.227716","article-title":"Total correctness by local improvement in the transformation of functional program","volume":"18","author":"Sands","year":"1996","journal-title":"ACM TOPLAS"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB25","unstructured":"D. Sands. Computing with contexts: A simple approach. In A. D. Gordon, A. M. Pitts, and C. L. Talcott editors Proc. HOOTS II, volume 10 of ENTCS. Elsevier Science Publishers B.V., 1998."},{"key":"10.1016\/S1571-0661(05)80284-1_BIB26","series-title":"PhD thesis, DIKU, University of Copenhagen, Denmark","article-title":"Analysis and Efficient Implementation of Functional Programs","author":"Sestoft","year":"1991"},{"issue":"3","key":"10.1016\/S1571-0661(05)80284-1_BIB27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1017\/S0956796897002712","article-title":"Deriving a lazy abstract machine","volume":"7","author":"Sestoft","year":"1997","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB28","series-title":"In Proc. FPCA '95","first-page":"1","article-title":"Once upon a type.","author":"Turner","year":"1995"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","article-title":"Deforestation: Transforming programs to eliminate trees","volume":"73","author":"Wadler","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80284-1_BIB30","series-title":"In Proc. POPL'99","article-title":"Once upon a polymorphic type","author":"Wansbrough","year":"1999"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:27Z","timestamp":1761610047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":30,"alternative-id":["S1571066105802841"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80284-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Foundation for Space-Safe Transformations of Call-by-Need Programs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80284-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}