The aggregate update problem in functional programming systems

1 January 1985

proceedings article
Published by Association for Computing Machinery (ACM)

p. 300-314
https://doi.org/10.1145/318593.318660

Abstract

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 of 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.1

Keywords

SIMPLE CHANGE
DYNAMIC TECHNIQUE
NEW COPY
AGGREGATE UPDATE PROBLEM
PROGRAM FUNCTIONALLY
FUNCTIONAL PROGRAMMING SYSTEM
CONVENTIONAL PROGRAM
AGGREGATE CONCEPTUALLY
CHANGED COMPONENT
CONTIGUOUS DATA STRUCTURE
DATA STRUCTURE
REMOTE PROCEDURE CALL
INTERPROCESS COMMUNICATION
DISTRIBUTED SYSTEMS
FUNCTIONAL PROGRAMMING
OBJECT ORIENTED LANGUAGES

This publication has 0 references indexed in Scilit: