BSD-3-Clause licensed by Edward A. Kmett
Maintained by Edward A. Kmett

Module documentation for 4.2.2

This version can be pinned in stack with:[email protected]:88a7582f405d8545049fe529afe7edcd5092547ae4f68b8ff3a8c3edd4367e89,1956

adjunctions

Hackage Build Status

This package provides adjunctions for Haskell.

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

4.2.2

  • Builds clean on GHC 7.10

4.2.1

  • semigroupoids 5 support.
  • profunctors 5 support.

4.2

  • contravariant 1.0 support. Day convolution moves to kan-extensions.

4.0.3

  • Silenced Control.Monad.Instances deprecation warnings on GHC 7.8

4.0.2

  • Added mfixRep to make it easier to define representable MonadFix instances.
  • Added mzipRep and mzipWithRep to make it easier to define representable MonadZip instances.
  • Added duplicateRepBy, extendRepBy and extractRepBy to make it easier to pick your own Monoid.
  • Minor documentation fixes.

4.0.1

  • Increased lower bound on contravariant to match the actual requirement.

4.0

  • Merged the contents of representable-functors.
  • Removed the dependency on keys.
  • Moved Data.Functor.Contravariant.Representable to Data.Functor.Contravariant.Rep and made the API mimic Data.Profunctor.Rep.
  • Moved Data.Functor.Representable to Data.Functor.Rep and made the API mimic Data.Profunctor.Rep.
  • Added Tagged and Proxy instances for Data.Functor.Rep.Representable
  • Added a Proxy instance for Data.Functor.Contravariant.Rep.Representable

3.2.1.1

  • Updated the array dependency

3.2.1

  • Marked modules appropriately Trustworthy.

3.2

  • Updated to representable-functors 3.1, which changed the API for contravariant representable functors.