{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:45:11Z","timestamp":1778215511300,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":4046,"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":[[2002,7]]},"DOI":"10.1016\/s1571-0661(05)80437-2","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"19-26","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient compilation of array iterators for Lustre"],"prefix":"10.1016","volume":"65","author":[{"given":"Lionel","family":"Morel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80437-2_BIB1","series-title":"Getting started with Alpha","author":"Equipe API-Cosi","year":"1997"},{"issue":"8","key":"10.1016\/S1571-0661(05)80437-2_BIB2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von neuman style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB3","first-page":"151","article-title":"Lectures on constructive functional programming","author":"Bird","year":"1988"},{"issue":"9","key":"10.1016\/S1571-0661(05)80437-2_BIB4","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/5.97300","article-title":"The synchronous dataflow programming language LUSTRE","volume":"79","author":"Halbwachs","year":"1991","journal-title":"Proc. of the IEEE"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB5","first-page":"195","article-title":"Implementing reactive programs on circuits: A hardware implementation of LUSTRE","author":"Halbwachs","year":"1992"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB6","article-title":"8_1\/2: Data-parallelism and dataflow","author":"Michel","year":"1992","journal-title":"Technical report, LRI-CNRS, Universit\u00e9 Paris-Sud"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB7","series-title":"ID Reference Manual","author":"Nikhil","year":"1991"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB8","series-title":"PhD thesis, Institut National Polytechnique de Grenoble","article-title":"Compilation efficace d'un langage d\u00e9claratif synchrone: le g\u00e9n\u00e9rateur de code Lustre-V3","author":"Raymond","year":"1991"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB9","first-page":"45","article-title":"Listlessness is better than laziness","author":"Wadler","year":"1984"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB10","series-title":"Proc. Workshop on Programs as Data Objects, volume 217 of LNCS.","article-title":"Listlessness is better than laziness II: composing listless functions","author":"Wadler","year":"1985"},{"key":"10.1016\/S1571-0661(05)80437-2_BIB11","first-page":"344","article-title":"Deforestation: Transforming programs to eliminate trees","author":"Wadler","year":"1988"},{"issue":"1","key":"10.1016\/S1571-0661(05)80437-2_BIB12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/114005.102806","article-title":"Automatic transformation of series expressions into loops","volume":"13","author":"Waters","year":"1991","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804372?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:05Z","timestamp":1761610025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S1571066105804372"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80437-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient compilation of array iterators for Lustre","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)80437-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}