Red-black trees with types

Journal of Functional Programming

Volumn 11, Issue 4, 2001, Pages 425-432

  Kahrs, Stefan ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035595943     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801004026     Document Type: Article

References (13)

1. Bayer, R. (1972) Symmetric binary b-trees: Data structure and maintenance algorithms. Acta informatica, 1, 290-306.
2. Cormen, T. H., Leiserson, C. E. and Rivett, R. L. (1990) Introduction to Algorithms. MIT Press.
3. Davies, R. (1997) A refinement-type checker for Standard ML. AMAST'97 presentation.
4. Finne, S., Daan, L., Meijer, E. and Peyton Jones, S. (1999) Calling heaven from hell and hell from heaven. Proceedings ACM SIGPLAN International Conference on Functional Programming, pp. 114-125. ACM Press.
5. Hinze, R. (1998) Numerical representations as higher-order nested datatypes. Technical report IAI-TR-98-12, Universität Bonn.
6. Hinze, R. (1999a) Constructing red-black trees. Workshop on algorithmic aspects of advanced programming languages, pp. 89-99.
7. Hinze, R. (1999b) Manufacturing datatypes. Workshop on Algorithmic Aspects of Advanced Programming Languages, pp. 1-16.
8. Kahrs, S. (1996) Limits of ML-definability. Proceedings of PLILP'96: Lecture Notes in Computer Science 1140, pp. 17-31. Springer-Verlag.
9. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
10. Okasaki, C. (1999) Functional pearl: Red-black trees in a functional setting. J. Functional Programming, 9(4), 471-477.
11. Reade, C. (1992) Balanced trees with removals, an exercise in rewriting and proof. Science of Computer Programming, 18(2), 181-204.
12. Sedgewick, R. (1988) Algorithms. Addison-Wesley.
13. Xi, H. (1999) Dependently typed data structures. Workshop on Algorithmic Aspects of Advanced Programming Languages, pp. 17-32.