{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:41:47Z","timestamp":1750459307844},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":7259,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0304-3975(93)90110-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"231-262","source":"Crossref","is-referenced-by-count":10,"title":["A uniform treatment of order of evaluation and aggregate update"],"prefix":"10.1016","volume":"118","author":[{"given":"M.","family":"Draghicescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Purushothaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90110-F_BIB1","series-title":"Ph.D. Thesis","article-title":"Path analysis and the optimization of non-strict functional languages","author":"Bloss","year":"1989"},{"key":"10.1016\/0304-3975(93)90110-F_BIB2","series-title":"Proc. 4th Internat. Conf. on Functional Programming and Computer Architecture","first-page":"26","article-title":"Update analysis and the efficient implementation of functional aggregates","author":"Bloss","year":"1989"},{"key":"10.1016\/0304-3975(93)90110-F_BIB3","series-title":"Proc. 1986 ACM Conf. on LISP and Functional Programming","first-page":"132","article-title":"Variations on strictness analysis","author":"Bloss","year":"1986"},{"key":"10.1016\/0304-3975(93)90110-F_BIB4","series-title":"Mathematical Foundations of Programming Language Semantics","first-page":"476","article-title":"Path semantics","volume":"Vol. 298","author":"Bloss","year":"1987"},{"key":"10.1016\/0304-3975(93)90110-F_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01806169","article-title":"Code optimizations for lazy evaluation","volume":"1","author":"Bloss","year":"1968","journal-title":"Lisp and Symbolic Computation"},{"key":"10.1016\/0304-3975(93)90110-F_BIB6","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher-order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(93)90110-F_BIB7","series-title":"Proc. 1990 ACM Conf. on LISP and Functional Programming","first-page":"242","article-title":"A compositional analysis of evaluation-order and its application","author":"Draghicescu","year":"1990"},{"key":"10.1016\/0304-3975(93)90110-F_BIB8","series-title":"16th ACM Symp. on Principles of Programming Languages","first-page":"303","article-title":"Copy elimination in functional languages","author":"Gopinath","year":"1989"},{"key":"10.1016\/0304-3975(93)90110-F_BIB9","series-title":"Abstract Interpretation of Declarative Languages","article-title":"A semantic model of reference counting and its abstraction","author":"Hudak","year":"1987"},{"key":"10.1016\/0304-3975(93)90110-F_BIB10","series-title":"12th ACM Symp. on Principles of Programming Languages","first-page":"300","article-title":"The aggregate update problem in functional programming systems","author":"Hudak","year":"1985"},{"key":"10.1016\/0304-3975(93)90110-F_BIB11","series-title":"13th ACM Symp. on Principles of Programming Languages","first-page":"97","article-title":"Higher-order strictness analysis in untyped lambda calculus","author":"Hudak","year":"1986"},{"key":"10.1016\/0304-3975(93)90110-F_BIB12","series-title":"Abstract Interpretation of Declarative Languages","article-title":"Analysing strictness by abstract interpretation of continuations","author":"Hughes","year":"1987"},{"key":"10.1016\/0304-3975(93)90110-F_BIB13","series-title":"Ph.D. Thesis","article-title":"Abstract interpretation and optimising transformations for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/0304-3975(93)90110-F_BIB14","series-title":"Proc. 14th ACM Symp. on Principles of Programming Languages","first-page":"274","article-title":"Computation of aliases and support sets","author":"Neirynck","year":"1987"},{"key":"10.1016\/0304-3975(93)90110-F_BIB15","series-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"key":"10.1016\/0304-3975(93)90110-F_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90110-F_BIB17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/3318.3323","article-title":"Detecting global variables in denotational specifications","volume":"7","author":"Schmidt","year":"1985","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0304-3975(93)90110-F_BIB18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6423(88)90001-9","article-title":"Detecting stack-based environments in denotational definitions","volume":"11","author":"Schmidt","year":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(93)90110-F_BIB19","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390110F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390110F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:58:20Z","timestamp":1555077500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390110F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["030439759390110F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90110-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}