distributive: Haskell 98 Distributive functors -- Dual to Traversable
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| lib-werror | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- distributive-0.3.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.0.1, 0.2.1, 0.2.2, 0.3, 0.3.1, 0.3.2, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.4.3.1, 0.4.3.2, 0.4.4, 0.5, 0.5.0.1, 0.5.0.2, 0.5.1, 0.5.2, 0.5.3, 0.6, 0.6.1, 0.6.2, 0.6.2.1 |
|---|---|
| Change log | CHANGELOG.markdown |
| Dependencies | base (>=4 && <5), transformers (>=0.2 && <0.4), transformers-compat (>=0.1 && <0.2) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (C) 2011-2013 Edward A. Kmett |
| Author | Edward A. Kmett |
| Maintainer | Edward A. Kmett <[email protected]> |
| Category | Data Structures |
| Home page | http://github.com/ekmett/distributive/ |
| Bug tracker | http://github.com/ekmett/distributive/issues |
| Source repo | head: git clone git://github.com/ekmett/distributive.git |
| Uploaded | by EdwardKmett at 2013-03-09T09:45:41Z |
| Distributions | Arch:0.6.2.1, Debian:0.6.2, Fedora:0.6.2.1, FreeBSD:0.4.4, LTSHaskell:0.6.2.1, NixOS:0.6.2.1, Stackage:0.6.2.1, openSUSE:0.6.2.1 |
| Reverse Dependencies | 88 direct, 8539 indirect [details] |
| Downloads | 260483 total (315 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Readme for distributive-0.3.1
[back to package description]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