Recursionschemes Alternatives
Similar projects and alternatives to recursionschemes based on common topics and language

rank2classes
Grammar parser  combinator library for parsing a general contextfree grammar




naryfunctor
A single typeclass for Functor, Bifunctor, Trifunctor, etc.

adagenerators
Experimental support for coroutinesbased generators in Ada

porpoise
A simple web framework built on top of wai (by SamuelSchlesinger)


Scout APM
Scout APM: A developer's best friend. Try free for 14days. Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a better recursionschemes alternative or higher similarity.
Reviews and mentions
Posts with mentions or reviews of recursionschemes.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 20210803.

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/recursionschemes. Or even just pass a traversal function as an argument for maximum flexibility.

fromMaybe is Just a fold
https://hackage.haskell.org/package/recursionschemes is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.

Annotation via anamorphism?
I've been working on a system which uses recursionschemes 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
Yes please! Right now all of my opensource projects (most notably hint and recursionschemes) are about to drop into barelyupdated mode, and while I knew this would happen and have been working towards finding comaintainers, 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 comaintainers to tide over my projects until I become available again.

Annotate AST with location information
A short (?) primer before you dive into recursionschemes:

Anamorphisms aka Unfolds Explained  Functional Works
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 datatypegeneric 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 recursionschemes: Representing common recursion patterns as higherorder functions.

Idiomatic way to generically extract all occurrences of a type from a nested structure (e.g. an AST)
To automatically derive the boilerplate I use: https://hackage.haskell.org/package/recursionschemes

Question about composing functors, functor products, comonads and recursion schemes
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 Fomega
You're calling them "eliminators", I call them recursionschemes. elimChurch is cata, elimMendler is mcata, and elimMendler2 is a Mendlerstyle version of para. I'm a bit confused because we've published mpara in recursionschemes5.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.
 RecursionSchemes

FAlgebras consuming their catamorphisms
https://github.com/ekmett/recursionschemes/blob/5141c0e07cba3f5107b3da1f55e456eacaae8818/src/Data/Functor/Foldable.hs#L589
Stats
Basic recursionschemes repo stats
12
278
6.2
7 months ago
ekmett/recursionschemes is an open source project licensed under BSD 2clause "Simplified" License which is an OSI approved license.
SaaSHub  Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
Popular Comparisons
remote jobs
at our new job board 99remotejobs.com.
There are
36 new remote jobs listed recently.
Are you hiring? Post a new remote job listing for free.
Find
Are you hiring? Post a new remote job listing for free.