Functional pearl: Red-black trees in a functional setting

Journal of Functional Programming

Volumn 9, Issue 4, 1999, Pages 471-477

  Okasaki, Chris ^a,b  

^a Carnegie Mellon University   (United States)

^b MC 0401 ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347115912     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003494     Document Type: Article

References (9)

1. Adams, S. (1993) Efficient sets - a balancing act. J. Functional Programming, 3(4): 553-561.
2. Andersson, A. (1991) A note on searching in a binary search tree. Software - Practice and Experience, 21(10): 1125-1128.
3. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1990) Introduction to Algorithms. MIT Press.
4. Fähndrich, M. and Boyland, J. (1997) Statically checkable pattern abstractions. ACM SIGPLAN International Conference on Functional Programming, pp. 75-84.
5. Guibas, L. J. and Sedgewick, R. (1978) A dichromatic framework for balanced trees. IEEE Symposium on Foundations of Computer Science, pp. 8-21.
6. Hudak, P. et al. (1992) Report on the functional programming language Haskell, Version 1.2. SIGPLAN Notices, 27(5).
7. 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.
8. Reade, C. M. P. (1992) Balanced trees with removals: an exercise in rewriting and proof. Science of Computer Programming, 18(2): 181-204.
9. Weiss, M. A. (1998) Data Structures & Problem Solving Using Java. Addison-Wesley.