Matryoshka

Implements a wide range of schemes like cata, ana, para, and histo, enabling expressive and reusable transformations for complex recursive data structures, as detailed in the cheat-sheet and academic references.

Integrates seamlessly with Scala's type system and libraries like Cats/Scalaz through type classes such as Recursive and Corecursive, ensuring compile-time safety and reducing errors in recursive logic.

Separates recursion from business logic using algebras and coalgebras, making code more maintainable and composable, as demonstrated in the example where eval algebra is applied independently of the fixed point type.

Based on well-researched concepts from functional programming papers, supporting generalized forms like G-algebras and Elgot algebras for advanced use cases, which is highlighted in the generalization section.