The aggregate update problem in functional programming systems


Paul Hudak and Adrienne Bloss


We discuss the problem of efficiently implementing aggregates (contiguous data structures) such as arrays in functional programming systems.  Simple changes to an aggregate conceptually involve making a new copy 01 the aggregate differing only in the changed component, but such copying can be expensive.  We present both static and dynamic techniques for avoiding this copying, and argue that they allow one to program functionally using aggregates, without loss of efficiency over conventional programs.


    ,author={Hudak, P. and Bloss, A.}
    ,title={The aggregate update problem in functional programming systems}
    ,booktitle={12th ACM Symposium on Principles of Programming Languages}