The Higher-Order Aggregate Update Problem

Authors:
Christos Dimoulas;Mitchell Wand
Affiliations:
College of Computer and Information Science, Northeastern University, Boston, 02115;College of Computer and Information Science, Northeastern University, Boston, 02115
Venue:
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Year:
2008

Citing 9
Cited 0

A calculus for assignments in higher-order languages

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
How to make destructive updates less destructive

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
A uniform treatment of order of evaluation and aggregate update

Theoretical Computer Science
Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Efficient array update analysis of strict functional languages

Efficient array update analysis of strict functional languages
The aggregate update problem in functional programming systems

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Static Analysis for Safe Destructive Updates in a Functional Language

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Set constraints for destructive array update optimization

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

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.