Shallow Binding Makes Functional Arrays Fast

Abstract

Access and update for random elements of arrays in imperative programming languages are O1991 operations. Implementing functional programming languages to achieve equivalent efficiency has proved difficult. We show how the straight-forward application of shallow binding to functional arrays automatically achieves O(1) update for single-threaded usage. © 1991, ACM. All rights reserved.