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.
A monad transformer can transform another monad, but if you have two monads both lacking a transformer, you can define an extended distributive law which allows a monad to arise - see Control.Monad.PlusMonad. This is an alternate solution to the same problem.
Modules
- Control
- Control.Linear
- Monad
- Control.Monad.IOT
- Control.Monad.Lifter
- Control.Monad.PlusMonad
Downloads
- MonadCompose-0.8.4.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.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, mmorph (>=1.0 && <1.1), monad-loops (>=0.4.2.1), monad-products, mtl (>=2.2), parallel (>=3.2), random, transformers, transformers-compat (>=0.4 && <0.5) [details] |
| License | BSD-3-Clause |
| Author | James Candy |
| Maintainer | info@alkalisoftware.net |
| Category | Monad |
| Home page | http://alkalisoftware.net |
| Uploaded | by JamesCandy at 2016-01-27T01:23:34Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 12264 total (37 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] All reported builds failed as of 2016-11-28 [all 2 reports] |