Question about composing functors, functor products, comonads and recursion schemes

This page summarizes the projects mentioned and recommended in the original post on reddit.com/r/haskell

Our great sponsors
  • InfluxDB - Build time-series-based applications quickly and at scale.
  • Scout APM - Truly a developer’s best friend
  • Zigi - Workflow assistant built for devs & their teams
  • SonarLint - Clean code begins in your IDE with SonarLint
  • recursion-schemes

    Generalized bananas, lenses and barbed wire

    I wouldn't bother with gfold, it's broken and rarely used. I'd start from a simpler implementation of zygo:

  • n-ary-functor

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

    so many different interesting kinds to instantiate those ideas at! I wonder if the ideas in my n-ary-functor package would make it possible to write a single recursion-schemes libraries for all of those kinds?

  • InfluxDB

    Build time-series-based applications quickly and at scale.. InfluxDB is the Time Series Data Platform where developers build real-time applications for analytics, IoT and cloud-native services in less time with less code.

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts