MonadCompose: Methods for composing monads.

[ bsd3, library, monad ] [ Propose Tags ]

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

[Last Documentation]

  • Control
    • Control.Linear
    • Monad
      • Control.Monad.Distributive
      • Control.Monad.IOT
      • Control.Monad.Lifter
      • Control.Monad.PlusMonad

Downloads

Maintainer's Corner

Package maintainers

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), comonad (>=3.0 && <3.1), data-default, ghc-prim (>=0.3 && <0.4), MaybeT, mmorph (>=1.0 && <1.1), monad-loops (>=0.4.2.1), monad-products, mtl (>=2.1 && <2.2), parallel (>=3.2 && <3.3), 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 2015-07-31T02:58:29Z
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-12-02 [all 7 reports]