type-level-bst

type-level binary search trees in haskell.

An efficient implementation of type-level binary search trees and of dependently-typed extensible records and unions.

More information can be found in the hackage's haddock or the updated haddock.