type-level-bst: type-level binary search trees in haskell

[ bsd3, data-structures, dependent-types, library ] [ Propose Tags ]

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.




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1
Dependencies base (>=4 && <5) [details]
License BSD-3-Clause
Copyright (c) Yusuke Matsushita 2014
Author Yusuke Matsushita
Maintainer Yusuke Matsushita <y.skm24t@gmail.com>
Category Dependent Types, Data Structures
Home page https://github.com/Kinokkory/type-level-bst
Bug tracker https://github.com/Kinokkory/type-level-bst/issues
Source repo head: git clone git@github.com:Kinokkory/type-level-bst.git
Uploaded by Kinokkory at 2014-10-28T15:09:40Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1149 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-05-21 [all 1 reports]