Generalized bananas, lenses and barbed wire (by ekmett)

Recursion-schemes Alternatives

Similar projects and alternatives to recursion-schemes based on common topics and language

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better recursion-schemes alternative or higher similarity.

Suggest an alternative to recursion-schemes

Reviews and mentions

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 2021-08-03.
  • Beautiful ideas in programming: generators and continuations | 2021-08-03
    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 Or even just pass a traversal function as an argument for maximum flexibility.
  • fromMaybe is Just a fold | 2021-08-02 is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.
  • Annotation via anamorphism? | 2021-07-27
    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
  • Seeking a Project Lead for Matchmaker - Haskell Foundation | 2021-07-26
    Yes please! Right now all of my open-source projects (most notably hint and recursion-schemes) are about to drop into barely-updated mode, and while I knew this would happen and have been working towards finding co-maintainers, I am now realizing that it wasn't enough. I think such a website would definitely have helped, and I am hoping that once it launches, I'll be able to use it to find some co-maintainers to tide over my projects until I become available again.
  • Annotate AST with location information | 2021-05-30
    A short (?) primer before you dive into recursion-schemes:
  • Anamorphisms aka Unfolds Explained | Functional Works | 2021-05-13
    And here is the branch containing my implementation.
  • Language which allows multiple iterators on a single type
    Recursion schemes: I, admittedly, don't know a whole lot about recursion schemes, but IIUC, they let you write datatype-generic iterative algorithms and all you have to do is define a few primitives per each datatype you'd like to use those algorithms on. See recursion-schemes: Representing common recursion patterns as higher-order functions.
  • Idiomatic way to generically extract all occurrences of a type from a nested structure (e.g. an AST) | 2021-04-15
    To automatically derive the boilerplate I use:
  • Question about composing functors, functor products, comonads and recursion schemes | 2021-04-01
    I wouldn't bother with gfold, it's broken and rarely used. I'd start from a simpler implementation of zygo:
  • Efficient datatypes in System F-omega
    You're calling them "eliminators", I call them recursion-schemes. elimChurch is cata, elimMendler is mcata, and elimMendler2 is a Mendler-style version of para. I'm a bit confused because we've published mpara in recursion-schemes-5.2.1, but I don't see it in the documentation, I'll have to investigate if this is a problem with the documentation or if I published the package incorrectly.
  • Recursion-Schemes | 2021-02-05
  • F-Algebras consuming their catamorphisms | 2021-01-23


Basic recursion-schemes repo stats
7 months ago

ekmett/recursion-schemes is an open source project licensed under BSD 2-clause "Simplified" License which is an OSI approved license.

SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
Find remote jobs at our new job board There are 36 new remote jobs listed recently.
Are you hiring? Post a new remote job listing for free.