{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:31Z","timestamp":1761610411325,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80242-7","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"287-300","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient Compilation of Functional Languages by Program Transformation"],"prefix":"10.1016","volume":"14","author":[{"given":"Andr\u00e9","family":"Santos","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80242-7_BIB1","unstructured":"Augustsson, Lennart, \u201cCompiling Lazy Functional Languages, Part II,\u201d PhD thesis, Department of Computer Science, Chalmers University of Technology, S-412 96 G\u00f6teborg, November 1987."},{"issue":"1","key":"10.1016\/S1571-0661(05)80242-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/114005.102805","article-title":"Daniel Le Metayer. Compilation of functional languages by program transformation","volume":"13","author":"Fradet","year":"1991","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"5","key":"10.1016\/S1571-0661(05)80242-7_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/130697.130699","article-title":"Report on the functional programming language Haskell","volume":"27","author":"Hudak","year":"1992","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)80242-7_BIB4","unstructured":"Kelsey, R. A., \u201cCompilation by Program Transformation,\u201d PhD thesis, Yale University, Department of Computer Science, May 1989. YALEU\/DCS\/RR-702."},{"key":"10.1016\/S1571-0661(05)80242-7_BIB5","unstructured":"Kranz, D. A., \u201cORBIT - an optimising compiler for Scheme,\u201d PhD thesis, Yale University, Department of Computer Science, May 1988."},{"key":"10.1016\/S1571-0661(05)80242-7_BIB6","series-title":"Functional Programming, Glasgow Workshops in Computing","article-title":"The nofib benchmarking suite","author":"William","year":"1992"},{"year":"1987","series-title":"\u201cThe Implementation of Functional Programming Languages,\u201d Prentice Hall","author":"Peyton Jones","key":"10.1016\/S1571-0661(05)80242-7_BIB7"},{"key":"10.1016\/S1571-0661(05)80242-7_BIB8","series-title":"UK Joint Framework for Information Technology (JFIT) Technical Conference","article-title":"The Glasgow Haskell Compiler: a technical overview","author":"Peyton Jones","year":"1993"},{"key":"10.1016\/S1571-0661(05)80242-7_BIB9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/3540543961_30","article-title":"Unboxed values as first class citizens","author":"Peyton Jones","year":"1991","journal-title":"Functional Programming Languages and Computer Architecture"},{"key":"10.1016\/S1571-0661(05)80242-7_BIB10","series-title":"ACM International Conference on Functional Programming","article-title":"Let-floating: moving bindings to give faster programs","author":"Peyton Jones","year":"1996"},{"key":"10.1016\/S1571-0661(05)80242-7_BIB11","unstructured":"Santos, Andr\u00e9, \u201cCompilation by Transformation in Non-Strict Functional Languages,\u201d PhD thesis, University of Glasgow, July 1995."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802427?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:53Z","timestamp":1761610073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":11,"alternative-id":["S1571066105802427"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80242-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient Compilation of Functional Languages by Program Transformation","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)80242-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}