monadic-recursion-schemes
Recursion Schemes for Monadic version. (by cutsea110)
foldl
Composable, streaming, and efficient left folds (by Gabriella439)
Our great sponsors
| monadic-recursion-schemes | foldl | |
|---|---|---|
| - | 1 | |
| 1 | 156 | |
| - | - | |
| 1.7 | 4.3 | |
| about 1 year ago | about 2 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" 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.
monadic-recursion-schemes
Posts with mentions or reviews of monadic-recursion-schemes.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning monadic-recursion-schemes yet.
Tracking mentions began in Dec 2020.
foldl
Posts with mentions or reviews of foldl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-03.
-
How lazy do push streams need to be?
Re Haskell Foldl: do you mean it doesn't support finite streams? Because the limitation of Foldl is precisely the fact that it is strict and doesn't support early termination. See https://github.com/Gabriella439/foldl/issues/85
What are some alternatives?
When comparing monadic-recursion-schemes and foldl you can also consider the following projects:
distributed-closure - Serializable closures for distributed programming.
ReplicateEffects - Composable replication schemes of applicative functors in Haskell
free - free monads
foldl-incremental
machines - Networks of composable stream transducers
foldl-exceptions - Exception handling with FoldM
ether - Monad Transformers and Classes
foldl-transduce-attoparsec - Attoparsec and foldl-transduce integration.
pipes - Compositional pipelines
concurrent-state
freer-simple - A friendly effect system for Haskell
parallel - a library for parallel programming
monadic-recursion-schemes vs distributed-closure
foldl vs ReplicateEffects
monadic-recursion-schemes vs free
foldl vs foldl-incremental
monadic-recursion-schemes vs machines
foldl vs foldl-exceptions
monadic-recursion-schemes vs ether
foldl vs foldl-transduce-attoparsec
monadic-recursion-schemes vs pipes
foldl vs concurrent-state
monadic-recursion-schemes vs freer-simple
foldl vs parallel