BSD-3-Clause licensed by Edward A. Kmett
This version can be pinned in stack with:recursion-schemes-5.0.3@sha256:c8e68c62fee5bba339d606e4768f0a27f522e650b4b98f3809c83c0f54e71864,2809
Module documentation for 5.0.3
recursion-schemes
 
 
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
5.0.3 [2018.07.01]
- Make the Template Haskell machinery look through type synonyms.
- Avoid incurring some dependencies when using recent GHCs.
5.0.2
- Support GHC-8.2.1
- Fix Template Haskell derivation with non-default type renamer.
- Add RecursiveandCorecursive Naturalinstances, withBase Natural = Maybe.
5.0.1
- Add Data.Functor.Foldable.THmodule, which provides derivation of base functors via Template Haskell.
5
- Renamed FoldabletoRecursiveandUnfoldabletoCorecursive. WithFoldableinPreludein GHC 7.10+, having a needlessly conflicting name seemed silly.
- Add support for GHC-8.0.1
- Use Eq1,Ord1,Show1,Read1to deriveFix,NuandMuEq,OrdShowandReadinstances
- Remove Primdata family.ListFas a new name forPrim [a], with plenty of instances, e.g.Traversable.
- Export unfix
- Add chronomorphisms: chronoandgchrono.
- Add distGApoT
4.1.2
4.1.1
- Support for GHC 7.10
- Fixed para.
4.1
- Support for GHC 7.7+’s generalized Typeable.
- Faster gapoandparaby exploiting sharing.
4.0
- Compatibility with comonadandfreeversion 4.0
3.0
- Compatibility with transformers0.3
- Resolved deprecation warnings caused by changes to Data.Typeable