Inductive benchmarking for purely functional data structures

Journal of Functional Programming

Volumn 11, Issue 5, 2001, Pages 525-556

  Moss, Graeme E ^a   Runciman, Colin ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035596828     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801004063     Document Type: Article

References (32)

1. Adams, S. R. (1993) Efficient sets - a balancing act. J. Functional Programming, 3(4), 553-562.
2. Arnow, D. M. and Tanenbaum, A. M. (1984) An empirical comparison of B-trees, compact B-trees and multiway trees. ACM SIGMOD Record, 14(2), 33-46.
3. Brodal, G. S. and Okasaki, C. (1996) Optimal purely functional priority queues. J. Functional Programming, 6(6), 839-857.
4. Chuang, T.-R. and Goldberg, B. (1993) Real-time deques, multihead Turing machines, and purely functional programming. Proc. Conference on Functional Programming Languages and Computer Architecture, pp. 289-298. ACM Press.
5. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990) Introduction to Algorithms. MIT Press.
6. Dietz, P. F. (1989) Fully persistent arrays. Proc. 1st Workshop on Algorithms and Data Structures: Lecture Notes in Computer Science 382, pp. 67-74. Springer-Verlag.
7. Driscoll, J. R., Sarnak, N., Sleator, D. D. and Tarjan, R. E. (1989) Making data structures persistent. J. Computer and System Sciences, 38(1), 86-124.
8. Erwig, M. (1997) Functional programming with graphs. Proc. ACM SIGPLAN International Conference on Functional Programming, pp. 52-65. ACM Press.
9. Gill, A. (2000) Debugging haskell by observing intermediate data structures. Proc. ACM Workshop on Haskell.
10. Hoare, C. A. R. (1962) Quicksort. Computer J. 5(1), 10-15.
11. Hood, R. and Melville, R. (1981) Real-time queue operations in pure LISP. Infor. Process. Lett. 13(2), 50-54.
12. Hoogerwoord, R. R. (1992) A symmetric set of efficient list operations. J. Functional Programming, 2(4), 505-513.
13. Hunt, E. B., Martin, J. and Stone, P. J. (1966) Experiments in Induction. Academic Press.
14. Jones, D. W. (1986) An empirical comparison of priority-queue and event-set implementations. Comm. ACM, 29(4), 300-311.
15. Kaplan, H. and Tarjan, R. E. (1995) Persistent lists with catenation via recursive slow-down. Proc. 27th Annual ACM Symposium on Theory of Computing, pp. 93-102.
16. Moss, G. E. (1999) Benchmarking Purely Functional Data Structures. PhD thesis, Department of Computer Science, University of York, UK.
17. Moss, G. E. and Runciman, C. (1997) Auburn: A kit for benchmarking functional data structures. Proceedings of IFL'97: Lecture Notes in Computer Science 1467, pp. 141-160. Springer-Verlag.
18. Moss, G. E. and Runciman, C. (1999) Automated benchmarking of functional data structures. Proceedings of PADL '99: Lecture Notes in Computer Science 1551, pp. 1-15. Springer-Verlag.
19. Myers, E. W. (1983) An applicative random-access stack. Infor. Process. Lett. 17(5), 241-248.
20. Núñez, M., Palao, P. and Peña, R. (1995) A second year course on data structures based on functional programming. Functional Programming Languages in Education: Lecture Notes in Computer Science 1022, pp. 65-84. Springer-Verlag.
21. Okasaki, C. (1995a) Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking. IEEE Symposium on Foundations of Computer Science, pp. 646-654.
22. Okasaki, C. (1995b) Purely functional random-access lists. Conference Record of FPCA '95, pp. 86-95. ACM Press.
23. Okasaki, C. (1995c) Simple and efficient purely functional queues and deques. J. Functional Programming, 5(4), 583-592.
24. Okasaki, C. (1996a) Functional data structures. Advanced Functional Programming: Lecture Notes in Computer Science 1129, pp. 131-158. Springer-Verlag.
25. Okasaki, C. (1996b) Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University.
26. Okasaki, C. (1996c) The role of lazy evaluation in amortized data structures. Proc. International Conference on Functional Programming, pp. 62-72. ACM Press.
27. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
28. O'Neill, M. E. and Burton, F. W. (1997) A new method for functional arrays. J. Functional Programming, 7(5), 487-513.
29. Peyton Jones, S., Nordin, T. and Reid, A. (1997) Green Card: A foreign-language interface for Haskell. Haskell Workshop. Oregon Graduate Institute of Science & Technology.
30. Quinlan, J. R. (1986) Induction of decision trees. Machine Learning, 1(1), 81-106.
31. Quinlan, J. R. (1987) Simplifying decision trees. Int. J. Man-Machine Studies, 27, 221-234.
32. Quinlan, J. R. (1993) C4.5: Programs for Machine Learning. Morgan Kaufmann.