union
Extensible type-safe unions for Haskell (by int-index)
union | semigroupoids | |
---|---|---|
- | 2 | |
31 | 75 | |
- | - | |
0.0 | 3.2 | |
over 1 year ago | 12 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
union
Posts with mentions or reviews of union.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning union yet.
Tracking mentions began in Dec 2020.
semigroupoids
Posts with mentions or reviews of semigroupoids.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-09-11.
-
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?
When comparing union and semigroupoids you can also consider the following projects:
data-lens - Haskell 98 Lenses
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
proto-lens - API for protocol buffers using modern Haskell language and library patterns.
cassava-conduit - Conduit interface for cassava [Haskell]
msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]
irc - Haskell irc library
comonad - Haskell 98 comonads
fclabels - First class composable record labels for Haskell.
base64-bytestring - Fast base64 encoding and decoding for Haskell.
bimap - Bidirectional mapping between two key types
order-statistic-tree - Order statistic tree in Haskell