MonadCompose: Methods for composing monads.
Methods for composing monads.
The IO monad transformer solves the problem of combining two IO-performing monads, so that neither one needs to provide a MonadIO interface and both can be transformed separately.
Most known monads have a distributive law. The Distributive module implements distributivity for monad transformers.
A monad transformer can transform another monad, but if you have two monads both lacking a transformer, there is little you can do in general. However, you can compose them in a coproduct construction. The PlusMonad module implements a similar plan, but differs from coproducts in that it doesn't compress together contiguous uses of a monad.
Modules
[Index]
Downloads
- MonadCompose-0.8.1.0.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.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.5.0.0, 0.6.0.0, 0.7.0.0, 0.8.0.0, 0.8.1.0, 0.8.2.0, 0.8.3.0, 0.8.3.1, 0.8.4.0, 0.8.4.1, 0.8.4.2, 0.9.0.0 |
---|---|
Dependencies | base (>=4 && <=5), data-default, ghc-prim (>=0.3 && <0.4), MaybeT, mmorph (>=1.0 && <1.1), monad-products, mtl (>=2.1 && <2.2), random, transformers [details] |
License | BSD-3-Clause |
Author | James Candy |
Maintainer | info@alkalisoftware.net |
Category | Monad |
Home page | http://alkalisoftware.net |
Uploaded | by JamesCandy at 2015-03-02T02:36:20Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 12636 total (16 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2015-03-02 [all 1 reports] |