cond VS recursion-schemes

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


Basic conditional operators with monadic variants. (by kallisti-dev)


Generalized bananas, lenses and barbed wire (by ekmett)
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • SonarLint - Clean code begins in your IDE with SonarLint
  • SaaSHub - Software Alternatives and Reviews
cond recursion-schemes
0 15
8 301
- 1.0%
0.0 4.3
almost 3 years ago 8 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.


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

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


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-11-16.
  • Tips on mastering recursion and trees and shit?
    1 project | | 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 | | 16 Nov 2021
    But wait, there's more! One of the two challenges was the recursion-schemes library. I wrote some examples, but the output I was getting from that example was not what I expected. I dug further, and it turned out to be a bug in the library! In addition to the documentation, I thus also worked on a fix for that bug.
    2 projects | | 16 Nov 2021
    It's a pretty complicated bug, documented in details at
  • Beautiful ideas in programming: generators and continuations
    2 projects | | 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 Or even just pass a traversal function as an argument for maximum flexibility.
  • fromMaybe is Just a fold
    1 project | | 2 Aug 2021 is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.
  • Annotation via anamorphism?
    1 project | | 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
  • Seeking a Project Lead for Matchmaker - Haskell Foundation
    3 projects | | 26 Jul 2021
    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
    1 project | | 30 May 2021
    A short (?) primer before you dive into recursion-schemes:
  • Anamorphisms aka Unfolds Explained | Functional Works
    1 project | | 13 May 2021
    And here is the branch containing my implementation.
  • Language which allows multiple iterators on a single type
    1 project | | 26 Apr 2021
    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.

What are some alternatives?

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

freer-simple - A friendly effect system for Haskell

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

unliftio - The MonadUnliftIO typeclass for unlifting monads to IO

pipes - Compositional pipelines

conduit-combinators - Type classes for mapping, folding, and traversing monomorphic containers

free - free monads

machines - Networks of composable stream transducers

rank2classes - Grammar parser - combinator library for parsing a general context-free grammar

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

funflow - Functional workflows

rio-orphans - A standard library for Haskell

foldl - Composable, streaming, and efficient left folds