@hackage / distributive

Distributive functors -- Dual to Traversable

Latest0.6.3

About

Metadata

  • Last updated , by ryanglscott
  • License BSD-3-Clause
  • Categories Data Structures

  • Maintained by: Edward A. Kmett <ekmett@gmail.com>

  • Lottery factor: 3

Links

Installation

Tested Compilers

  1. 9.12.2
  2. 9.10.3
  3. 9.8.4
  4. 9.6.7
  5. 9.4.8
  6. 9.2.8
  7. 9.0.2
  8. 8.10.4
  9. 8.8.4
  10. 8.6.5
  11. 8.4.4
  12. 8.2.2
  13. 8.0.2

Package Flags

Use the -f option with cabal commands to enable flags

    tagged (on by default)

    You can disable the use of the tagged package using `-f-tagged`.

    Disabling this is an unsupported configuration, but it may be useful for accelerating builds in sandboxes for expert users.

Readme

distributive

Hackage Build Status

This package provides the notion that is categorically dual to Traversable.

A Distributive Functor is one that you can push any functor inside of.

distribute :: (Functor f, Distributive g) => f (g a) -> g (f a)

Compare this with the corresponding Traversable notion, sequenceA.

sequenceA :: (Applicative f, Traversable g) => g (f a) -> f (g a)

This package includes instances for common types, and includes other methods similar to traverse which fuse the use of fmap.

We only require Functor rather than some dual notion to Applicative, because the latter cannot meaningfully exist in Haskell since all comonoids there are trivial.

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