yaya: Total recursion schemes.
Recursion schemes allow you to separate recursion from your business logic – making your own operations simpler, more modular, and less error-prone. This library also provides tools for combining your operations in ways that reduce the number of passes over your data and is designed to encourage total (i.e., successfully terminating) functions.
[Skip to Readme]
|Versions [faq]||0.1.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.2|
|Dependencies||base (>=4.7 && <5), bifunctors, comonad, constraints, containers, distributive, either, errors, free, kan-extensions, lens, profunctors, template-haskell, transformers [details]|
|Copyright||2017 Greg Pfeil|
|Source repo||head: git clone https://github.com/sellout/yaya|
|Uploaded||by sellout at Fri Nov 8 17:35:19 UTC 2019|
|Downloads||727 total (102 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2019-11-08 [all 1 reports]
For package maintainers and hackage trustees