distributed-process-platform
DEPRECATED (Cloud Haskell Platform) in favor of distributed-process-extras, distributed-process-async, distributed-process-client-server, distributed-process-registry, distributed-process-supervisor, distributed-process-task and distributed-process-execution (by haskell-distributed)
recursion-schemes
Generalized bananas, lenses and barbed wire (by ekmett)
| distributed-process-platform | recursion-schemes | |
|---|---|---|
| - | 21 | |
| 47 | 345 | |
| - | 0.3% | |
| 0.0 | 4.9 | |
| over 9 years ago | 5 months 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.
distributed-process-platform
Posts with mentions or reviews of distributed-process-platform.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning distributed-process-platform yet.
Tracking mentions began in Dec 2020.
recursion-schemes
Posts with mentions or reviews of recursion-schemes.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-05.
-
Typesafe recursion... in TypeScript??
I've got another article planned where I talk through exactly why and how this function works, but it's worth noting that I didn't come up with it myself -- I simply ported it from the Haskell library that first introduced this technique.
-
-❄️- 2023 Day 4 Solutions -❄️-
Reasonably proud of my part 2 solution, although would like to try using a recursion scheme rather than unstructured recursion:
-
Interactive animations
Yeah, that project is pretty much at the bottom of my list, unfortunately. My top projects these days are mgmt, klister, recursion-schemes, and hint... And that's already too much!
-
Science of Recursion
In a programming context, recursion schemes can be used to write recursive (or corecursive) functions, by automating/abstracting away the common boilerplate part of actually doing the recursion. They take the form of polymorphic higher-order functions, which can be imported from a library like this classic one.
-
Is there a way to avoid call overhead?
Maybe I didn't link the best post. It is unfortunately the only one I know that uses Rust. If you are able to read Haskell, the documentation for the recursion-schemes package might be a better resource?
-
Ah yes I love arrays with a length of infinity!!!
Writing something as a type of fold over an infinite sequence is nicer than using recursion directly in my opinion. See: https://hackage.haskell.org/package/recursion-schemes
-
Tips on mastering recursion and trees and shit?
Consider recursion schemes! It let's you separate the logic of how your recursion is structured on your data, and the logic of what you're doing on each recursion stage. So e.g. you can write the core logic of a recursive linked list summation as just fun x accum -> x + accum, and then you just find the appropriate recursion scheme to pipe the list values into x and handle recursing to build accum (a catamorphism in this case)
-
So you come across an undocumented library…
It's a pretty complicated bug, documented in details at https://github.com/recursion-schemes/recursion-schemes/issues/50
-
Beautiful ideas in programming: generators and continuations
It’s also trivial and easy in Haskell — you just need an instance of `Foldable` or `Traversable` on your collection, and then you can fold or traverse it in a configurable way. Or for recursive structures, use https://hackage.haskell.org/package/recursion-schemes. Or even just pass a traversal function as an argument for maximum flexibility.
-
fromMaybe is Just a fold
https://hackage.haskell.org/package/recursion-schemes is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.
What are some alternatives?
When comparing distributed-process-platform and recursion-schemes you can also consider the following projects:
either - the EitherT monad transformer
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
assert-failure - syntactic sugar that improves the usability of 'assert' and 'error' in Haskell
record - Anonymous records
time-warp
machines - Networks of composable stream transducers