Auburn: A kit for benchmarking functional data structures

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

Volumn 1467, Issue , 1998, Pages 141-159

  Moss, Graeme E ^a   Runciman, Colin ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING;

FUNCTIONAL DATAS; PURELY FUNCTIONAL;

DATA STRUCTURES;

EID: 84957059079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055429     Document Type: Conference Paper

References (10)

1. The Auburn Home Page. http://www.cs.york.ac.uk/~gem/auburn/.
2. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1): 86-124, February 1989.
3. Graphviz: Tools for viewing and interacting with graph diagrams, http://www.research.att.com/sw/tools/graphviz/.
4. Robert Hood and Robert Melville. Real-time queue operations in pure Lisp. Information Processing Letters, 13(2): 50-54, November 1981.
5. Chris Okasaki. Simple and efficient purely functional queues and deques. Journal of Functional Programming, 5(4): 583-592, October 1995.
6. Chris Okasaki. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996.
7. Chris Okasaki. The role of lazy evaluation in amortized data structures. In Proceedings of the International Conference on Functional Programming, pages 62-72. ACM Press, May 1996.
8. Simon Peyton Jones, Thomas Nordin, and Alastair Reid. Green Card: A foreign-language interface for Haskell. In Haskell Workshop, Amsterdam, June 1997. Published by Oregon Graduate Institute of Science & Technology.
9. D. L. Shell. A high-speed sorting procedure. Communications of the ACM, 2(7): 30-32, 1959.
10. York Functional Programming Group. http://www.cs.york.ac.uk/fp/.