size-based
bifunctors
| size-based | bifunctors | |
|---|---|---|
| - | 1 | |
| 10 | 57 | |
| - | - | |
| 0.0 | 5.6 | |
| over 3 years ago | 6 months 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.
size-based
We haven't tracked posts mentioning size-based yet.
Tracking mentions began in Dec 2020.
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.
What are some alternatives?
code-builder - Packages for defining APIs, running them, generating client code and documentation.
hnix - A Haskell re-implementation of the Nix expression language
thyme
frontmatter - Attoparsec parsers for YAML frontmatter as used in Jekyll
critbit - A Haskell implementation of crit-bit trees.
hierarchy
scientific - Arbitrary-precision floating-point numbers represented using scientific notation
here - Haskell here docs & interpolated strings via quasiquotation
resource-pool - A high-performance striped resource pooling implementation for Haskell
combobuffer - Several pure buffer implementations
binary - Efficient, pure binary serialisation using ByteStrings in Haskell.
ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump