Red-black trees with types

Stefan Kahrs

Abstract

Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the invariants of such data structures into their types, using higher-order nested datatypes. We show how one can achieve something very similar without the usual performance penalty of such types, by combining the features of nested datatypes, phantom types and existential type variables.

Bibtex Record

@article{1293,
author = {Stefan Kahrs},
title = {Red-black trees with types},
month = {July},
year = {2001},
pages = {425-432},
keywords = {balanced trees, existential types},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2001/1293},
    publication_type = {article},
    submission_id = {13813_1001084587},
    journal = {Journal of Functional Programming},
    volume = {11},
    number = {4},
    publisher = {Cambridge University Press},
}