constrained-categories
funflow
constrained-categories | funflow | |
---|---|---|
- | 3 | |
20 | 360 | |
- | 0.0% | |
2.0 | 3.5 | |
about 1 year ago | 4 months ago | |
Haskell | Haskell | |
GNU General Public License v3.0 only | MIT 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.
constrained-categories
We haven't tracked posts mentioning constrained-categories yet.
Tracking mentions began in Dec 2020.
funflow
-
Is there anything like funflow for rust?
funflow is a cool library for writing "workflows", but basically it's a library that implements caching. So if you have a process that reads a file A, does transformation A → B, then does B → C, then C → D, then writes D to disk, each step of that will be cached to disk and you won't need to redo the A → B step if your program crashes during the B → C step.
-
Need a reason to start Haskell learning
You might wanna check out funflow
-
Experiences with workflow managers implemented in Haskell (funflow, porcupine, bioshake, ?)
Funflow: https://github.com/tweag/funflow
What are some alternatives?
freer-simple - A friendly effect system for Haskell
ChannelT - Generalized stream processors
free - free monads
hask - Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)
mtl - The Monad Transformer Library
lens-tutorial - The missing tutorial module for the lens library
record - Anonymous records
apecs - a fast, extensible, type driven Haskell ECS framework for games
safe-exceptions - Safe, consistent, and easy exception handling
selective - Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically
transient - A full stack, reactive architecture for general purpose programming. Algebraic and monadically composable primitives for concurrency, parallelism, event handling, transactions, multithreading, Web, and distributed computing with complete de-inversion of control (No callbacks, no blocking, pure state)
recursion-schemes - Generalized bananas, lenses and barbed wire