A new method for functional arrays

Journal of Functional Programming

Volumn 7, Issue 5, 1997, Pages 487-513

  O'Neill, Melissa E ^a   Burton, F Warren ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042946387     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796897002852     Document Type: Article

References (31)

1. Aasa, A., Holmström, S. and Nilsson, C. (1988) An efficiency comparison of some representations of purely functional arrays. BIT, 28(3): 490-503.
2. Achten, P. M., van Groningen, J. H. G. and Plasmeijer, M. J. (1993) High-level specification of I/O in functional languages. In: Launchbury et al., editors, Proceedings of the Glasgow Workshop on Functional Programming. Springer-Verlag.
3. Baker Jr., H. G. (1978) Shallow binding in lisp 1.5. Comm. ACM, 21(7): 565-569.
4. Baker Jr, H. G. (1991) Shallow binding makes functional arrays fast. SIGPLAN Notices, 26(8): 145-147.
5. Bloss, A. (1989) Update analysis and the efficient implementation of functional aggregates. In: Functional Programming Languages and Computer Architecture, London. ACM.
6. Chuang, T.-R. (1992) Fully persistent arrays for efficient incremental updates and voluminous reads. In: Krieg-Brückner, B., editor, ESOP '92: 4th European Symposium on Programming: Lecture Notes in Computer Science 582 pp. 110-129. Springer-Verlag.
7. Chuang, T.-R. (1994) A randomized implementation of multiple functional arrays. Conference Record of the 1994 ACM Conference on LISP and Functional Programming, pp. 173-184.
8. Cohen, S. (1984) Multi-version structures in Prolog. International Conference on Fifth Generation Computer Systems, pp. 265-274.
9. Dietz, P. F. (1989) Fully persistent arrays (extended abstract). In: Dehne, F., Sack, J.-R. and Santoro, N., editors, Proceedings of the Workshop on Algorithms and Data Structures: WADS'89, pp. 67-74. Lecture Notes in Computer Science 382. Springer-Verlag.
10. Dietz, P. F. and Sleator, D. D. (1987) Two algorithms for maintaining order in a list. To appear. (A preliminary version appeared in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, May 25-27 1987.)
11. Driscoll, J. R., Sarnak, N., Sleator, D. D. and Tarjan, R. E. (1989) Making data structures persistent. J. Computer & System Sci., 38: 86-124.
12. Holmström, S. (1983) How to handle large data structures in functional languages. Proceedings of the SERC Chalmers Workshop on Declarative Programming Languages.
13. Hoogerwoord, R. R. (1992) A logarithmic implementation of flexible arrays. Proceedings of the 2nd International Conference on Mathematics of Program Construction, pp. 191-207. Lecture Notes in Computer Science 669. Springer-Verlag.
14. Hudak, P., Peyton Jones, S. L., Wadler, P. L., Arvind, Bontel, B., Fairbairn, J., Fasel, J., Guzman, M., Hammond, K., Hughs, J., Johnson, T., Kieburtz, R, Partain, W. and Peterson, J. (1992) Report on the functional programming language Haskell. version 1.2. SIGPLAN Notices, 27, July.
15. Hughes, J. (1985) An efficient implementation of purely functional arrays. Technical Report, Department of Computer Sciences, Chalmers University of Technology.
16. Huitema, H. S. and Plasmeijer, M. J. (1992) The Concurrent Clean System Users Manual, version 0.8. Technical Report 92-19, University of Nijmegen.
17. Myers, E. W. (1984) Efficient applicative data types. In: Kennedy, K., editor, Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pp. 66-75. Salt Lake City, UT: ACM Press.
18. Overmars, M. H. (1981) Searching in the past II: General transforms. Technical Report RUU-CS-81-9, Department of Computer Science, University of Utrecht.
19. Overmars, M. H. (1983) The design of dynamic data structures: Lecture Notes in Computer Science 156, pp. 153-157. Springer-Verlag.
20. Paulson, L. C. (1991) ML for the Working Programmer. Cambridge University Press.
21. Pecaric, J. E., Proschan, F. and Tong, Y. L. (1993) Convex functions, partial orderings, and statistical applications. Mathematics in Science and Engineering, vol. 187. Academic Press.
22. Schmidt, D. A. (1985) Detecting global variables in denotational specifications. ACM Trans. on Programming Languages and Systems, 7: 299-310.
23. Sleator, D. D. and Tarjan, R. E. (1985) Self-adjusting binary search trees. J. ACM, 32(3): 652-686.
24. Stoye, W. R., Clarke, T. J. W. and Norman, A. C. (1984) Some practical methods for rapid combinator reduction. ACM symposium on LISP and functional programming, pp. 159-166. Austin, Texas: ACM.
25. Tarjan, R. E. (1985) Amortized computational complexity. SIAM J. Algebraic and Discrete Methods, 6(2): 306-318.
26. Tsakalidis, A. K. (1984) Maintaining order in a generalized linked list. Acta informatica, 21(1): 101-112.
27. Turner, D. A. (1986) An overview of Miranda. SIGPLAN Notices, 21(12): 158-166.
28. Wadler, P. L. (1990a) Comprehending monads. Proceedings of the ACM conference on Lisp and functional programming, Nice. ACM.
29. Wadler, P. L. (1990b) Linear types can change the world! In: Broy, M. and Jones, C, editors, Programming Concepts and Methods. North Holland.
30. Wadler, P. L. (1992) The essence of functional programming. Conference record of the 19th annual ACM symposium on principles of programming languages. New Orleans, Louisiana. ACM.
31. Wise, D. S. and Friedman, D. P. (1977) The one-bit reference count. BIT, 17(3): 351-359.