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.

Versions [faq] 0.1
Dependencies base (==4.*) [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 Tue Oct 28 15:09:40 UTC 2014
Distributions NixOS:0.1
Downloads 521 total (10 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-05-21 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees