Journal ArticleOPEN ACCESS

Shallow Binding Makes Functional Arrays Fast

ACM SIGPLAN Notices (1991) 26(8) 145-147
DOI: 10.1145/122598.122614
15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Baker, H. G. (1991). Shallow Binding Makes Functional Arrays Fast. ACM SIGPLAN Notices, 26(8), 145–147. https://doi.org/10.1145/122598.122614

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free