A Design and Implementation of Functional Array for Improvement of the Traversal Time


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 5, pp. 1262-1272, Sep. 1996
10.3745/KIPSTE.1996.3.5.1262,   PDF Download:

Abstract

Pure functional languages have the referential transparency feature so that all objects cannot be updated destructively. Once an aggregated data structure such as array is updated, both the original and newly updated array must be preserved to maintain referential transparency. Thus, it is required to develop an efficient mechanism with which can reduce the maintenance cost while maintaining referential transparency for whole data.This study is to suggest a functional array to solve the problem, and then test it. For that, the proposed mechanism was implemented on a combinator graph reduction machine. The result shows that proposed mechanism reduces traversal time for array operations. Also, updating all versions and accessing the recent version are achieved in constant time without reconstruction of updated data in execution time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. W. Hee and J. H. Seok, "A Design and Implementation of Functional Array for Improvement of the Traversal Time," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 5, pp. 1262-1272, 1996. DOI: 10.3745/KIPSTE.1996.3.5.1262.

[ACM Style]
Yoo Weon Hee and Joo Hyung Seok. 1996. A Design and Implementation of Functional Array for Improvement of the Traversal Time. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 5, (1996), 1262-1272. DOI: 10.3745/KIPSTE.1996.3.5.1262.