Skip to main content
Conference Proceedings

The higher-order aggregate update problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5403 LNCS 44-58
DOI: 10.1007/978-3-540-93900-9_8
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestricted closures and nested arrays. Also, it can handle programs that contain a mix of functional and destructive updates. Correctness of all the analyses and of the transformation itself is proved. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dimoulas, C., & Wand, M. (2009). The higher-order aggregate update problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5403 LNCS, pp. 44–58). https://doi.org/10.1007/978-3-540-93900-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free