Automated benchmarking of functional data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1551 LNCS, Issue , 1999, Pages 1-15

  Moss, Graeme E ^a   Runciman, Colin ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TOOLS; FUNCTIONAL DATAS; TRADITIONAL TECHNIQUES;

ALGORITHMS; BENCHMARKING; DECISION TREES;

DATA STRUCTURES;

EID: 0346498989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. Stephen R. Adams. Efficient sets - a balancing act. Journal of Functional Programming, 3(4):553-561, October 1993.
2. The Auburn Home Page. http://www.cs.york.ac.uk/~gem/auburn/.
3. Gerth S. Brodal and Chris Okasaki. Optimal purely functional priority queues. Journal of Functional Programming, 6(6):839-857, November 1996.
4. Martin Erwig. Functional programming with graphs. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 52-65. ACM Press, June 1997.
5. Rob R. Hoogerwoord. A logarithmic implementation of flexible arrays. In Proceedings of the Second International Conference on the Mathematics of Program Construction, volume 669 of LNCS, pages 191-207, July 1992.
6. Haim Kaplan and Robert E. Tarjan. Persistent lists with catenation via recursive slow-down. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 93-102, May 1995.
7. Graeme E. Moss. Benchmarking Functional Data Structures. DPhil thesis, University of York, 1999. To be submitted.
8. Graeme E. Moss and Colin Runciman. Auburn: A kit for benchmarking functional data structures. In Proceedings of IFL'97, volume 1467 of LNCS, pages 141-160, September 1997.
9. Eugene W. Myers. An applicative random-access stack. Information Processing Letters, 17(5):241-248, December 1983.
10. Eugene W. Myers. Efficient applicative data types. In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, pages 66-75, 1984.
11. Melissa E. O'Neill and F. Warren Burton. A new method for functional arrays. Journal of Functional Programming, 7(5):487-513, September 1997.
12. Chris Okasaki. Purely functional random-access lists. In C onf erence Record of FPCA '95, pages 86-95. ACM Press, June 1995.
13. Chris Okasaki. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996.