vinyl
bk-tree
| vinyl | bk-tree | |
|---|---|---|
| 2 | - | |
| 260 | 4 | |
| 0.4% | - | |
| 0.0 | 0.0 | |
| 7 months ago | over 11 years ago | |
| Haskell | Haskell | |
| MIT License | LicenseRef-PublicDomain |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
vinyl
-
Making sense of TypeScript using set theory
> Having set types like this and refining them smaller is something I wish Haskell would learn from Typescript, especially the automatic inference side
Haskell has far better type inference than Typescript in large part because it doesn't have subtyping.
There are libraries for open records and sums (e.g. https://hackage.haskell.org/package/vinyl) but they're almost always the wrong choice.
-
Typed Markdown Revisited
I would also like to see how this compares with data types à la carte or an extensible records solution like vinyl.
bk-tree
We haven't tracked posts mentioning bk-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
graphite - Haskell graphs and networks library
ethereum-merkle-patricia-db
slist - ♾️ Sized list
Agda - Agda is a dependently typed programming language / interactive theorem prover.
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
containers - Assorted concrete container types
permutation - git import of patrick perry permutations lib from darcs
hevm - Dapp, Seth, Hevm, and more
rawr - Anonymous extensible records and variant types
singletons - Fake dependent types in Haskell using singletons
haggle - An efficient graph library for Haskell
miso - :ramen: A tasty Haskell front-end framework