Representable functors http://github.com/ekmett/representable-functors/
|Latest on Hackage:||184.108.40.206|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
This package provides representable functors for haskell. In category theory a representable functor (more pedantically a corepresentable functor) is one such that
f a is isomorphic to
x -> a. We choose the name
Representable here because we are talking about haskell
Functor instances, and they are all covariant, so this is the more natural notion of representability for Haskell.
Contributions and bug reports are welcome!
Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.
- Updated array dependency
- Added proper upper bounds on dependencies
- Fixed issue #1. Did
RULESparsing change with GHC 7.6.3?
- Added Day Convolution
- Required Distributive as a superclass
Data.Functor.Contravariant.Representableto finally clean up this long-standing abuse of terminology.
- Removed intra-package dependencies
- Added IRC build-bot notification