{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:21:02Z","timestamp":1648765262991},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8751,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0890-5401(89)90052-7","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"151-184","source":"Crossref","is-referenced-by-count":2,"title":["Incorporating static analysis in a combinator-based compiler"],"prefix":"10.1016","volume":"82","author":[{"given":"Margaret","family":"Montenyohl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0890-5401(89)90052-7_BIB1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6423(83)90022-9","article-title":"A structured approach to static semantics correctness","volume":"3","author":"Barbuti","year":"1983","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0890-5401(89)90052-7_BIB2","series-title":"Towards a Formal Description of Ada","volume":"Vol. 98","year":"1980"},{"key":"10.1016\/0890-5401(89)90052-7_BIB3","series-title":"Program Flow Analysis: Theory and Applications","article-title":"Denotational definition of properties of program computations","author":"Donzeau-Gouge","year":"1980"},{"key":"10.1016\/0890-5401(89)90052-7_BIB4","author":"Gordon","year":"1979"},{"key":"10.1016\/0890-5401(89)90052-7_BIB5","series-title":"Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages","first-page":"122","article-title":"A combinator-based compiler for a functional language","author":"Hudak","year":"1983"},{"key":"10.1016\/0890-5401(89)90052-7_BIB6","series-title":"Proceedings, 1982 ACM Symposium on Lisp and Functional Programming","first-page":"11","article-title":"A fixed program machine for combinator expression evaluation","author":"Jones","year":"1982"},{"key":"10.1016\/0890-5401(89)90052-7_BIB7","series-title":"Conference Records of the 13th Annual ACM Symposium on Principles of Programming Languages","first-page":"86","article-title":"Compilers and staging transformations","author":"Jorring","year":"1986"},{"key":"10.1016\/0890-5401(89)90052-7_BIB8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0890-5401(89)90052-7_BIB9","author":"Milne","year":"1976"},{"key":"10.1016\/0890-5401(89)90052-7_BIB10","article-title":"Static Analysis Based on Denotational Transformations","author":"Montenyohl","year":"1986"},{"key":"10.1016\/0890-5401(89)90052-7_BIB11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","article-title":"A denotational framework for data flow analysis","volume":"18","author":"Nielson","year":"1982","journal-title":"Acta Inform."},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90052-7_BIB12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/3916.3917","article-title":"Program transformations in a denotational setting","volume":"7","author":"Nielson","year":"1985","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0890-5401(89)90052-7_BIB13","series-title":"Proceedings, 1980 Conference on Information Sciences and Systems","first-page":"211","article-title":"A denotational semantics approach to program optimization","author":"Pleban","year":"1980"},{"key":"10.1016\/0890-5401(89)90052-7_BIB14","article-title":"Preexecution Analysis Based on Denotational Semantics","author":"Pleban","year":"1981"},{"key":"10.1016\/0890-5401(89)90052-7_BIB15","author":"Stoy","year":"1977"},{"issue":"No. 8","key":"10.1016\/0890-5401(89)90052-7_BIB16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/360303.360308","article-title":"The denotational semantics of programming languages","volume":"19","author":"Tennent","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/0890-5401(89)90052-7_BIB17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software Practice Experience"},{"key":"10.1016\/0890-5401(89)90052-7_BIB18","article-title":"Different Advice on Structuring Compilers and Proving Them Correct","author":"Wand","year":"1980"},{"key":"10.1016\/0890-5401(89)90052-7_BIB19","series-title":"Conference Record of the 9th Annual ACM Symposium on Principles of Programming Languages","first-page":"234","article-title":"Semantics-directed machine architecture","author":"Wand","year":"1982"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90052-7_BIB20","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","article-title":"Deriving target code as a representation of continuation semantics","volume":"4","author":"Wand","year":"1982","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0890-5401(89)90052-7_BIB21","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(83)80041-2","article-title":"Loops in combinator-based compilers","volume":"57","author":"Wand","year":"1983","journal-title":"Inform. and Control"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:26:52Z","timestamp":1549027612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0890540189900527"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90052-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}