recursion-schemes

Generalized bananas, lenses and barbed wire

http://github.com/ekmett/recursion-schemes/

Version on this page:5.0.1@rev:1
LTS Haskell 23.19:5.2.3@rev:1
Stackage Nightly 2025-04-30:5.2.3@rev:1
Latest on Hackage:5.2.3@rev:1

See all snapshots recursion-schemes appears in

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.1@sha256:36143fa4a8c0474a6799fc6975a051cecfdafb72a34d43a10cd53e395286ae38,2073

Module documentation for 5.0.1

Used by 1 package in lts-7.24(full list with versions):
aeson-extra

recursion-schemes

Hackage Build Status

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

Changes

5.0.1

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

5

  • 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

4.1.2

  • Support for free 4.12.1

4.1.1

  • Support for GHC 7.10
  • Fixed para.

4.1

  • Support for GHC 7.7+’s generalized Typeable.
  • Faster gapo and para by exploiting sharing.

4.0

  • Compatibility with comonad and free version 4.0

3.0

  • Compatibility with transformers 0.3
  • Resolved deprecation warnings caused by changes to Data.Typeable