Abstract
We present a new approach to implementing arrays in a pure lazy functional programming language. The arrays can be updated destructively by using uniqueness typing, and the elements can be unboxed. We describe the implementation of these arrays in the functional programming language Clean 1.1. The performance of two sorting algorithms and a fast fourier transformation written in Clean using arrays is compared with similar programs written in C. The current implementation of Clean is on average about 25 percent slower than C for these programs.
Cite
CITATION STYLE
van Groningen, J. H. G. (1997). The implementation and efficiency of arrays in clean 1.1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1268, pp. 105–124). Springer Verlag. https://doi.org/10.1007/3-540-63237-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
