recursion-schemes VS machines

Compare recursion-schemes vs machines and see what are their differences.

recursion-schemes

Generalized bananas, lenses and barbed wire (by ekmett)

machines

Networks of composable stream transducers (by ekmett)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
recursion-schemes machines
20 -
335 338
0.6% -
4.9 3.6
3 days ago 7 months ago
Haskell Haskell
BSD 2-clause "Simplified" 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.

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.
  • -❄️- 2023 Day 4 Solutions -❄️-
    143 projects | /r/adventofcode | 5 Dec 2023
    Reasonably proud of my part 2 solution, although would like to try using a recursion scheme rather than unstructured recursion:
  • Interactive animations
    11 projects | /r/haskell | 6 May 2023
    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
    1 project | /r/AskScienceDiscussion | 28 Sep 2022
    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?
    5 projects | /r/rust | 10 Sep 2022
    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!!!
    1 project | /r/programminghorror | 28 Jul 2022
    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?
    1 project | /r/csMajors | 5 Feb 2022
    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…
    2 projects | /r/haskell | 16 Nov 2021
    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
    2 projects | news.ycombinator.com | 3 Aug 2021
    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
    1 project | /r/haskell | 2 Aug 2021
    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.
  • Annotation via anamorphism?
    1 project | /r/haskell | 27 Jul 2021
    I've been working on a system which uses recursion-schemes to annotate a recursive type. The annotated tree itself is pretty simple; at each level, we pair the annotation with the base functor, or

machines

Posts with mentions or reviews of machines. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning machines yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing recursion-schemes and machines you can also consider the following projects:

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

pipes - Compositional pipelines

record - Anonymous records

daemons - Daemons in Haskell made fun and easy

unliftio - The MonadUnliftIO typeclass for unlifting monads to IO

static-closure

pipes-core - Compositional pipelines

capability - Extensional capabilities and deriving combinators

chr-core - Constraint Handling Rules

fused-effects - A fast, flexible, fused effect system for Haskell

freer-simple - A friendly effect system for Haskell

extensible-effects - Extensible Effects: An Alternative to Monad Transformers