distributive
Distributive functors -- Dual to Traversable
http://github.com/ekmett/distributive/
| Version on this page: | 0.5.0.2 |
| LTS Haskell 22.41: | 0.6.2.1@rev:1 |
| Stackage Nightly 2024-11-12: | 0.6.2.1@rev:1 |
| Latest on Hackage: | 0.6.2.1@rev:1 |
Maintained by Edward A. Kmett
This version can be pinned in stack with:
distributive-0.5.0.2@sha256:8245d8b189742f5dd5d17587af85f32c2e305793330dff1cf391e4d0a570e8b0,1768Module documentation for 0.5.0.2
Depends on 5 packages(full list with versions):
Used by 14 packages in nightly-2016-01-26(full list with versions):
distributive
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