recursion-schemes

Generalized bananas, lenses and barbed wire

BSD-3-Clause licensed by Edward A. Kmett

Maintained by Edward A. Kmett

This version can be pinned in stack with:recursion-schemes-5.0.3@sha256:c8e68c62fee5bba339d606e4768f0a27f522e650b4b98f3809c83c0f54e71864,2809

Depends on 7 packages(full list with versions):

Used by 1 package in lts-11.22(full list with versions):

This package includes code for functional programming with bananas, envelopes, lenses, barbed wire and all that.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett

Support GHC-8.2.1
Fix Template Haskell derivation with non-default type renamer.
Add Recursive and Corecursive Natural instances, with Base Natural = Maybe.

Add Data.Functor.Foldable.TH module, which provides derivation of base functors via Template Haskell.

Renamed Foldable to Recursive and Unfoldable to Corecursive. With Foldable in Prelude in GHC 7.10+, having a needlessly conflicting name seemed silly.
Add support for GHC-8.0.1
Use Eq1, Ord1, Show1, Read1 to derive Fix, Nu and Mu Eq, Ord Show and Read instances
Remove Prim data family. ListF as a new name for Prim [a], with plenty of instances, e.g. Traversable.
Export unfix
Add chronomorphisms: chrono and gchrono.
Add distGApoT