The recursion-schemes package

Generalized bananas, lenses and barbed wire

Properties

Versions	0.1, 0.1.1, 0.2, 0.2.1, 0.2.2, 0.3.0, 0.3.0.1, 0.4.0, 0.4.0.1, 0.4.0.2, 0.4.0.3, 0.4.1, 0.4.2, 0.4.3, 0.5.0, 0.5.0.1, 1.8.0, 1.8.0.1, 1.8.0.2, 2.0, 2.0.1, 2.0.1.1, 2.0.1.2, 2.0.2, 2.1, 3.0, 3.0.0.1, 3.0.0.2, 4.0, 4.1, 4.1.1, 4.1.2, 5, 5.0.1, 5.0.2
Change log	CHANGELOG.markdown
Dependencies	base (==4.), bifunctors (>=4 && <6), comonad (>=4 && <6), free (==4.), ghc-prim, transformers (>=0.2 && <1), transformers-compat (>=0.3 && <1) [details]
License	BSD3
Copyright	Copyright (C) 2008-2015 Edward A. Kmett
Author	Edward A. Kmett
Maintainer	Edward A. Kmett <ekmett@gmail.com>
Category	Control, Recursion
Home page	http://github.com/ekmett/recursion-schemes/
Bug tracker	http://github.com/ekmett/recursion-schemes/issues
Source repository	head: git clone git://github.com/ekmett/recursion-schemes.git
Uploaded	Wed Sep 14 21:41:23 UTC 2016 by EricMertens
Distributions	LTSHaskell:5.0.2, NixOS:5.0.2, Stackage:5.0.2, Tumbleweed:5.0.2
Downloads	9721 total (1133 in the last 30 days)
Votes	2 []
Status	Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI

For package maintainers and hackage trustees

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

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