bk-tree VS vinyl

Compare bk-tree vs vinyl and see what are their differences.

bk-tree

Haskell library meant to be a set of tools to correct spelling mistakes, homophones, and OCR errors (by bitonic)

vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. (by VinylRecords)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
bk-tree vinyl
- 2
4 260
- 0.4%
0.0 0.0
over 11 years ago 6 months ago
Haskell Haskell
LicenseRef-PublicDomain MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

bk-tree

Posts with mentions or reviews of bk-tree. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning bk-tree yet.
Tracking mentions began in Dec 2020.

vinyl

Posts with mentions or reviews of vinyl. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-01-24.
  • Making sense of TypeScript using set theory
    2 projects | news.ycombinator.com | 24 Jan 2023
    > 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
    1 project | /r/haskell | 23 Apr 2021
    I would also like to see how this compares with data types à la carte or an extensible records solution like vinyl.

What are some alternatives?

When comparing bk-tree and vinyl you can also consider the following projects:

ethereum-merkle-patricia-db

graphite - Haskell graphs and networks library

Agda - Agda is a dependently typed programming language / interactive theorem prover.

slist - ♾️ Sized list

containers - Assorted concrete container types

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

hevm - Dapp, Seth, Hevm, and more

permutation - git import of patrick perry permutations lib from darcs

singletons - Fake dependent types in Haskell using singletons

rawr - Anonymous extensible records and variant types

miso - :ramen: A tasty Haskell front-end framework

haggle - An efficient graph library for Haskell