streams
Haskell 2010 stream comonads (by ekmett)
Our great sponsors
| streams | semigroupoids | |
|---|---|---|
| 3 | 2 | |
| 22 | 75 | |
| - | - | |
| 1.0 | 3.2 | |
| about 1 year ago | 1 day ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 or later |
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.
streams
Posts with mentions or reviews of streams.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-13.
-
Infinite lists
Cool, looks good. I've used u/edwardkmett's streams package, but I would certainly consider moving to something more complete, maintained and with a smaller dependency footprint. Plus, it defines head, which streams lacks for some reason.
-
How Long is your List?
FWIW, there are quite a few libraries on Hackage implementing the infinite Stream type. When I looked in to this last year, u/edwardkmett's streams was the only one that seemed to be maintained.
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 streams and semigroupoids you can also consider the following projects:
base64-bytestring - Fast base64 encoding and decoding for Haskell.
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.
comonad - Haskell 98 comonads
msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]
comonads-fd - comonad transformers based on functional-dependencies
representable-tries - representable tries
monoid-extras - Miscellaneous constructions on monoids
streams vs base64-bytestring
semigroupoids vs kan-extensions
streams vs proto-lens
semigroupoids vs proto-lens
streams vs comonad
semigroupoids vs msgpack
streams vs comonads-fd
semigroupoids vs base64-bytestring
streams vs representable-tries
semigroupoids vs comonad
streams vs monoid-extras
semigroupoids vs monoid-extras