{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:52:49Z","timestamp":1648839169572},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1016\/0096-0551(93)90029-z","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"31-55","source":"Crossref","is-referenced-by-count":0,"title":["A proposal for a genuinely-lazy streams facility for Ada"],"prefix":"10.1016","volume":"18","author":[{"given":"Paul A","family":"Bailes","sequence":"first","affiliation":[]},{"given":"Dan B","family":"Johnston","sequence":"additional","affiliation":[]},{"given":"Eric J","family":"Salzman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(93)90029-Z_BIB1","series-title":"Mathematical Logic and Programming Languages","first-page":"29","article-title":"Functional programs as executable specifications","author":"Turner","year":"1985"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB2","series-title":"Mathematical Logic and Programming Languages","first-page":"11","article-title":"The relation between logic programming and logic specification","author":"Kowalski","year":"1985"},{"issue":"2","key":"10.1016\/0096-0551(93)90029-Z_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TSE.1986.6312939","article-title":"Functional programming, formal specification and rapid prototyping","volume":"SE-12","author":"Henderson","year":"1986","journal-title":"IEEE Trans. Softw. Engng"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB4","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/366663.366704","article-title":"The design of a separable transition-diagram compiler","volume":"6","author":"Conway","year":"1963","journal-title":"CACM"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB5","series-title":"SIMULA Begin","author":"Birtwistle","year":"1973"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB6","series-title":"Programming in Modula-2","author":"Wirth","year":"1985"},{"issue":"9","key":"10.1016\/0096-0551(93)90029-Z_BIB7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/987649.987656","article-title":"Coroutines in FORTRAN","volume":"13","author":"Skordalakis","year":"1978","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB8","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1002\/spe.4380101003","article-title":"Extension of Pascal by coroutines and its application to quasi-parallel programming and simulation","volume":"10","author":"Kriz","year":"1980","journal-title":"Softw. Pract. Exper."},{"key":"10.1016\/0096-0551(93)90029-Z_BIB9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/spe.4380150407","article-title":"A low-cost implementation of coroutines for C","volume":"15","author":"Bailes","year":"1985","journal-title":"Softw. Pract. Exper."},{"key":"10.1016\/0096-0551(93)90029-Z_BIB10","article-title":"A review of Ada tasking","volume":"Vol. 262","author":"Burns","year":"1987"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB11","series-title":"Proceedings of the 3rd ACM Symposium on Principles of Programming Languages","first-page":"95","article-title":"A lazy evaluator","author":"Henderson","year":"1976"},{"issue":"1","key":"10.1016\/0096-0551(93)90029-Z_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/366193.366201","article-title":"Revised report on the algorithmic language ALGOL 60","volume":"6","author":"Naur","year":"1963","journal-title":"CACM"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB13","series-title":"Conference of Functional Programming Languages and Computer Architecture","first-page":"1","article-title":"Miranda\u2014a non-strict functional language with polymorphic types","volume":"Vol. 201","author":"Turner","year":"1985"},{"issue":"2","key":"10.1016\/0096-0551(93)90029-Z_BIB14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","article-title":"A correspondence between ALGOL 60 and Church's lambda-notation: Part 1","volume":"8","author":"Landin","year":"1965","journal-title":"CACM"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB15","series-title":"The implementation of functional programming languages","author":"Peyton Jones","year":"1987"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB16","series-title":"Reference Manual for the Ada Programming Language","year":"1983"},{"key":"10.1016\/0096-0551(93)90029-Z_BIB17","series-title":"Proceedings ACM 1990 TRI-Ada Conference","first-page":"114","article-title":"DAda\u2014an Ada preprocessor for functional programming","author":"Bailes","year":"1990"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519390029Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519390029Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:25:49Z","timestamp":1552634749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519390029Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["009605519390029Z"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(93)90029-z","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}