monoid-extras
monoid-extras | semigroupoids | |
---|---|---|
- | 2 | |
17 | 75 | |
- | - | |
4.6 | 3.2 | |
6 months ago | 10 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" 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.
monoid-extras
We haven't tracked posts mentioning monoid-extras yet.
Tracking mentions began in Dec 2020.
semigroupoids
-
I came across the "Fantasy Land Specification", it somewhat conflicts with my own simplistic understanding of monads and functors. Is this specification valid, and should I honor it?
I think of this as the "semigroupoid" factoring. Here's the canonical Haskell library, with an explanation of why the extra classes exist: https://hackage.haskell.org/package/semigroupoids. In this library, fantasyland's Chain is called Bind.
-
Folding Nonempty Structures In Haskell
obligatory shoutout to semigroupoids 🤘
What are some alternatives?
data-lens-fd - Lenses with Functional Dependencies
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
data-lens - Haskell 98 Lenses
proto-lens - API for protocol buffers using modern Haskell language and library patterns.
schedule-planner - Calculate an ideal schedule layout from a set of timeslots
msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]
type-iso - Expresses isomorphic and injective relations between types.
comonad - Haskell 98 comonads
unamb-custom - Functional concurrency with unambiguous choice, using a custom scheduler.
base64-bytestring - Fast base64 encoding and decoding for Haskell.
currency - Types representing standard and non-standard currencies
order-statistic-tree - Order statistic tree in Haskell