{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:08Z","timestamp":1761610328780,"version":"build-2065373602"},"reference-count":11,"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)80441-4","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"65-78","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Type-based Initialization Analysis of a Synchronous Data-flow Language"],"prefix":"10.1016","volume":"65","author":[{"given":"Jean-Louis","family":"Cola\u00e7o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Pouzet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80441-4_BIB1","first-page":"31","article-title":"Type inclusion constraints and type inference","author":"Aiken","year":"1993"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB2","series-title":"Theoretical Aspects of Computer Software (TACS)","article-title":"Optimal Representations of Polymorphic Types with Subtyping","author":"Aiken","year":"1997"},{"year":"2000","series-title":"Lucid Synchrone, a functional extension of Lustre, submitted to publication","author":"Caspi","key":"10.1016\/S1571-0661(05)80441-4_BIB3"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB4","series-title":"ACM SIGPLAN International Conference on Functional Programming","article-title":"Synchronous Kahn Networks","author":"Caspi","year":"1996"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB5","series-title":"European Symposium on Programming (ESOP'01)","article-title":"Modular causality in a synchronous stream language","author":"Cuoq","year":"2001"},{"issue":"9","key":"10.1016\/S1571-0661(05)80441-4_BIB6","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":"Proceedings of the IEEE"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB7","series-title":"IFIP 74 Congress","article-title":"The semantics of a simple language for parallel programming","author":"Kahn","year":"1974"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB8","first-page":"122","article-title":"Simplifying subtyping constraints","author":"Pottier","year":"1996"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB9","article-title":"Simplifying subtyping constraints: a theory","author":"Pottier","year":"2000","journal-title":"To appear in Information & Computation"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB10","article-title":"Lucid Synchrone, version 2. Tutorial and reference manual","author":"Pouzet","year":"2001","journal-title":"Universit\u00e9 Pierre et Marie Curie, Distribution available at: www-spi.Iip6.fr\/lucid-synchrone, LIP6"},{"key":"10.1016\/S1571-0661(05)80441-4_BIB11","unstructured":"SCADE. http:\/\/www.esterel-technologies.com\/scade\/"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804414?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804414?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:23Z","timestamp":1761610043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S1571066105804414"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80441-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Type-based Initialization Analysis of a Synchronous Data-flow Language","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)80441-4","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"}]}}