bifunctors
hebrew-time
bifunctors | hebrew-time | |
---|---|---|
1 | - | |
56 | 2 | |
- | - | |
5.6 | 0.0 | |
about 2 months ago | about 5 years 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.
bifunctors
-
Why is the maybe monad transformer defined as MaybeT { runMaybeT :: m (Maybe a) } instead of MaybeT { runMaybeT :: Maybe (m a) } ?
But it is possible to derive using a newtype of a tuple with its arguments reversed: Flip (,) s. If we get the (Biapplicative bi, Monoid b) => Applicative (Flip bi b) instance (issue). It will require a constraint to restrict m to have a representational argument because otherwise we cannot coerce through it.
hebrew-time
We haven't tracked posts mentioning hebrew-time yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
size-based
massiv - Efficient Haskell Arrays featuring Parallel computation
hnix - A Haskell re-implementation of the Nix expression language
primitive - This package provides various primitive memory-related operations.
frontmatter - Attoparsec parsers for YAML frontmatter as used in Jekyll
audiovisual - Extensible records, variants, structs, effects, tangles
combobuffer - Several pure buffer implementations
b-tree - Haskell on-disk B* tree implementation
hierarchy
aig - Provides an interface for AIGs and word-level operations on them
gps2htmlReport - Generates a HTML page report detailing a GPS journey, with charts, statistics and an OpenStreetMap graphic.
critbit - A Haskell implementation of crit-bit trees.