hamtmap
representable-functors
hamtmap | representable-functors | |
---|---|---|
- | - | |
45 | 9 | |
- | - | |
0.0 | 0.0 | |
- | over 10 years ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" 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.
hamtmap
We haven't tracked posts mentioning hamtmap yet.
Tracking mentions began in Dec 2020.
representable-functors
We haven't tracked posts mentioning representable-functors yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
naperian - Efficient representable functors
ethereum-client-haskell
monadic-arrays - MArray instances for monad transformers
fgl - A Functional Graph Library for Haskell
distributive - Dual Traversable
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.
void - Provides Data.Void, which is in base since ghc 7.8 or so
singletons - Fake dependent types in Haskell using singletons
functor-friends - Friendly helpers for your recursion schemes.
containers - Bitnami container images