BSD-3-Clause licensed by Edward A. Kmett
Maintained by Edward A. Kmett
This version can be pinned in stack with:adjunctions-4.2.1@sha256:a36b8a272455149715fb58c1d8c2a40762ee15bc9cc46145b5e1d6fdc3825248,1972

Module documentation for 4.2.1

adjunctions

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.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.