tie-knot
vinyl
tie-knot | vinyl | |
---|---|---|
- | 2 | |
4 | 260 | |
- | 0.4% | |
0.0 | 0.0 | |
over 11 years ago | 6 months ago | |
Haskell | Haskell | |
LicenseRef-LGPL | MIT License |
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.
tie-knot
We haven't tracked posts mentioning tie-knot yet.
Tracking mentions began in Dec 2020.
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.
What are some alternatives?
multiset - multiset haskell package
graphite - Haskell graphs and networks library
justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.
slist - ♾️ Sized list
bookkeeper
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
permutation - git import of patrick perry permutations lib from darcs
fgl - A Functional Graph Library for Haskell
rawr - Anonymous extensible records and variant types
data-r-tree - Haskell implementatio of R-Trees
haggle - An efficient graph library for Haskell