bimap
data-category
| bimap | data-category | |
|---|---|---|
| - | 1 | |
| 22 | 54 | |
| - | - | |
| 0.0 | 3.3 | |
| almost 2 years ago | 9 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.
bimap
We haven't tracked posts mentioning bimap yet.
Tracking mentions began in Dec 2020.
data-category
-
Monthly Hask Anything (October 2021)
Even a fairly simple statement like "F preserves direct limits over N" is basically impossible to express like this. You can step further from Hask and work at the type level until the very end (which I believe is the approach taken by data-category), you can resign yourself to only expressing things that can be "defunctionalized" (an appropriate use of the term, I think, if not a correct one) down to Haskell functions, which gets you (Co)Yoneda, Lan, Ran, etc. in the general case and I think Traversable in this particular instance, or you can take some intermediate approach with constrained functions and/or explicit witnesses in your data types, but you can't make proper category theory "just work" the way it should.
What are some alternatives?
procrastinating-variable - Haskell values that cannot be evaluated immediately.
data-lens - Haskell 98 Lenses
asn1-encoding - ASN1 Raw/BER/DER/CER reader/writer in haskell
data-lens-fd - Lenses with Functional Dependencies
base64-bytestring - Fast base64 encoding and decoding for Haskell.
cassava-conduit - Conduit interface for cassava [Haskell]
unamb-custom - Functional concurrency with unambiguous choice, using a custom scheduler.
folds - Folds and sequence algebras
schedule-planner - Calculate an ideal schedule layout from a set of timeslots
total-map - Finitely represented /total/ maps
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor