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

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

Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
  • 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?

  • WorkOS

    The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

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