representable-functors
vinyl
Our great sponsors
| representable-functors | vinyl | |
|---|---|---|
| - | 2 | |
| 9 | 260 | |
| - | 0.4% | |
| 0.0 | 0.0 | |
| over 10 years ago | 6 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | 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.
representable-functors
We haven't tracked posts mentioning representable-functors 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?
ethereum-client-haskell
graphite - Haskell graphs and networks library
fgl - A Functional Graph Library for Haskell
slist - ♾️ Sized list
psqueues - Priority Search Queues in three different flavors for Haskell
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
Agda - Agda is a dependently typed programming language / interactive theorem prover.
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
containers - Bitnami container images
haggle - An efficient graph library for Haskell