datasets
bifunctors
Our great sponsors
| datasets | bifunctors | |
|---|---|---|
| - | 1 | |
| 11 | 56 | |
| - | - | |
| 0.0 | 5.6 | |
| about 7 years ago | about 1 month ago | |
| Haskell | Haskell | |
| MIT 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.
datasets
We haven't tracked posts mentioning datasets 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?
cassava - A CSV parsing and encoding library optimized for ease of use and high performance
size-based
protobuf - An implementation of Google's Protocol Buffers in Haskell.
hnix - A Haskell re-implementation of the Nix expression language
unordered-containers - Efficient hashing-based container types
frontmatter - Attoparsec parsers for YAML frontmatter as used in Jekyll
binary - Efficient, pure binary serialisation using ByteStrings in Haskell.
combobuffer - Several pure buffer implementations
text - Haskell library for space- and time-efficient operations over Unicode text.
hebrew-time - Hebrew dates and prayer times.
refined - Refinement types with static checking
hierarchy