A uniform treatment of order of evaluation and aggregate update
dc.contributor.author | Draghicescu, M. | en_US |
dc.contributor.author | Purushothaman, S. | en_US |
dc.date.accessioned | 2006-04-10T15:35:32Z | |
dc.date.available | 2006-04-10T15:35:32Z | |
dc.date.issued | 1993-09-27 | en_US |
dc.identifier.citation | Draghicescu, M., Purushothaman, S. (1993/09/27)."A uniform treatment of order of evaluation and aggregate update." Theoretical Computer Science 118(2): 231-262. <http://hdl.handle.net/2027.42/30571> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V1G-45DHXFY-F/2/f010ddf368168bc0b727dd2486572994 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30571 | |
dc.description.abstract | The article presents an algorithm for the destructive update optimization in first-order lazy functional languages. The main component of the method is a new static analysis of the order of evaluation of expressions which, compared to other published work, has a much lower complexity and is not restricted to pure lazy evaluation. The other component, which we call reduction to variables, is a method of detecting the variables which denote locations where the result of an expression might be stored.Starting with the operational semantics of the language, we introduce some markers for the values in the basic domain. By choosing appropriately the set of markers M and the method of propagating them during evaluation, we can extract some property of the evaluation in which an expression can participate by looking at the marker of its value. We then define an equivalent denotational semantics and derive the above analyses, in a uniform way, by abstract interpretation over a subdomain of P(M[perpendicular]). | en_US |
dc.format.extent | 1969791 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | A uniform treatment of order of evaluation and aggregate update | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | EECS Department, University of Michigan, Ann Arbor, MI 48109-2122, USA | en_US |
dc.contributor.affiliationother | Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30571/1/0000206.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0304-3975(93)90110-F | en_US |
dc.identifier.source | Theoretical Computer Science | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.