hamtmap
distributive
| hamtmap | distributive | |
|---|---|---|
| - | 6 | |
| 45 | 41 | |
| - | - | |
| 0.0 | 2.7 | |
| - | over 1 year 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.
distributive
- stack
-
Is there an idiomatic way to have a record but with enum values as keys?
Moving discussion to a github issue.
-
Issue 302 :: Haskell Weekly newsletter
In main branch of distributive, Distributive is gone. There is only Representable. See current state https://github.com/ekmett/distributive/blob/117377d7ba38efc5b115169b565dfb80de8ad407/src/Data/Rep/Internal.hs
-
Monthly Hask Anything (November 2021)
Seems like a neat signature. Is it an instance of some deeper concept or property? Is there a general typeclass for it? It looks a little bit like distribute from distributive.
-
Chris Penner - Intro to Higher Kinded Data Types
The upcoming version of distributive includes a lot of hkd toys. It might be up your alley.
What are some alternatives?
naperian - Efficient representable functors
miso - :ramen: A tasty Haskell front-end framework
monadic-arrays - MArray instances for monad transformers
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
functor-friends - Friendly helpers for your recursion schemes.
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
containers - Assorted concrete container types
subwordgraph - An implementation of a classic Subword Graph (also known as Directed Acyclic Word Graph).
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)