An architecture that efficiently updates associative aggregates in applicative programming languages

Authors:
John T. O'Donnell
Affiliations:
Computer Science Dept., Indiana Univ. Bloomington
Venue:
Proc. of a conference on Functional programming languages and computer architecture
Year:
1985

Citing 0
Cited 3

Update analysis and the efficient implementation of functional aggregates

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Shallow binding makes functional arrays fast

ACM SIGPLAN Notices
Path analysis and the optimization of nonstrict functional languages

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract