{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:47:32Z","timestamp":1649209652118},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1016\/0096-0551(84)90017-1","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:11:16Z","timestamp":1060283476000},"page":"97-106","source":"Crossref","is-referenced-by-count":3,"title":["DFL: A Data Flow Language"],"prefix":"10.1016","volume":"9","author":[{"given":"L.M.","family":"Patnaik","sequence":"first","affiliation":[]},{"given":"Prabal","family":"Bhattacharya","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ganesh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0096-0551(84)90017-1_BIB1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MC.1982.1653937","article-title":"Data flow systems","volume":"15","author":"Agerwala","year":"1982","journal-title":"Computer"},{"issue":"8","key":"10.1016\/0096-0551(84)90017-1_BIB2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from von Neumann style? A functional style and its algebra of program","volume":"21","author":"Backus","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(84)90017-1_BIB3","series-title":"Proceedings of the 1st European Conference on Parallel and Distributed Processing","first-page":"8","article-title":"LAU multiprocessor: Microfunctional description and technological choices","author":"Comte","year":"1979"},{"key":"10.1016\/0096-0551(84)90017-1_BIB4","article-title":"A single assignment language for data flow computing","author":"Glouret","year":"1978"},{"key":"10.1016\/0096-0551(84)90017-1_BIB5","article-title":"VAL\u2014A Value oriented Algorithmic Language: Preliminary reference manual","author":"Ackerman","year":"1979"},{"key":"10.1016\/0096-0551(84)90017-1_BIB6","article-title":"An asynchronous programming language and computing machine","author":"Arvind","year":"1978"},{"key":"10.1016\/0096-0551(84)90017-1_BIB7","series-title":"M.E. Report","article-title":"A compiler for DFL: A Data Flow Language","author":"Bhattacharya","year":"1982"},{"key":"10.1016\/0096-0551(84)90017-1_BIB8","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055184900171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055184900171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:25:34Z","timestamp":1552627534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055184900171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0096055184900171"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(84)90017-1","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}