Shallow binding makes functional arrays fast
- 1 August 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (8) , 145-147
- https://doi.org/10.1145/122598.122614
Abstract
Access and update for random elements of arrays in imperative programming languages are O(1) 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.Keywords
This publication has 12 references indexed in Scilit:
- Efficient stack allocation for tail-recursive languagesPublished by Association for Computing Machinery (ACM) ,1990
- Copy elimination in functional languagesPublished by Association for Computing Machinery (ACM) ,1989
- Update analysis and the efficient implementation of functional aggregatesPublished by Association for Computing Machinery (ACM) ,1989
- A simple and efficient implmentation approach for single assignment languagesPublished by Association for Computing Machinery (ACM) ,1988
- Embedding continuations in procedural objectsACM Transactions on Programming Languages and Systems, 1987
- A semantic model of reference counting and its abstraction (detailed summary)Published by Association for Computing Machinery (ACM) ,1986
- Shallow binding in Lisp 1.5Communications of the ACM, 1978
- List processing in real time on a serial computerCommunications of the ACM, 1978
- Shifting garbage collection overhead to compile timeCommunications of the ACM, 1977
- Optimization of very high level languages—I: Value transmission and its corollariesComputer Languages, 1975