úÎ1/s     If t1 and t2 are endofunctorsm then t2 :. t15 is their composition (which is also an endofunctor) If t) is an endofunctor in our category, then t :$ m is basically the same as t m. If m# is an algebra over an endofunctor t , then it'"s structure morphism has the type Inst t m. m :-> n is the set of morphisms (from m to n, naturally) in our category.  A composable monad transformer.  You shoudn't (and probably can't) use *anything* except for  ", defined in this very module, as  transMInst. If you define *instance TransM T where transMInst = instM%, then you would also need to define instance Monad m => Monad (T m) somewhere in your code. MonadM m' is actually a free monad generated by m. MonadM is a monad itself (on the (* -> *)5 category), as usually happens with free structures.  +A monad is nothing but an algebra over the MonadM monad. instM provides it's structure map. Sometimes we need an instance Monad T, while everything we' ve got is  Inst MonadP T. In this case, return' serves as a return substitution. Sometimes we need an instance Monad T, while everything we' ve got is  Inst MonadP T. In this case, bind' serves as a >>= substitution.      A composable MonadFix transformer.  You shoudn't (and probably can't) use *anything* except for ", defined in this very module, as  transFInst. If you define *instance TransF T where transFInst = instF%, then you would also need to define %instance MonadFix m => MonadFix (T m) somewhere in your code. MonadF m is actually a free MonadFix generated by m. MonadF is a monad itself (on the (* -> *)5 category), as usually happens with free structures. A MonadFix$ is nothing but an algebra over the MonadF monad. instF provides it's structure map. Sometimes we need an instance MonadFix T, while everything we' ve got is InstP MonadF T. In this case, mfix' serves as a mfix substitution.  A composable  MonadPlus transformer.  You shoudn't (and probably can't) use *anything* except for ", defined in this very module, as  transPInst. If you define *instance TransP T where transPInst = instP%, then you would also need to define 'instance MonadPlus m => MonadPlus (T m) somewhere in your code. MonadP m is actually a free  MonadPlus generated by m. MonadP is a monad itself (on the (* -> *)5 category), as usually happens with free structures. A  MonadPlus$ is nothing but an algebra over the MonadP monad. instP provides it's structure map. Sometimes we need an instance MonadPlus T, while everything we' ve got is InstP MonadP T. In this case, mzero' serves as a mzero substitution. Sometimes we need an instance Monad T, while everything we' ve got is  Inst MonadP T. In this case, mplus' serves as a mplus substitution.       !compose-trans-0.1Control.Monad.Trans.CategoryControl.Monad.Trans.MonadControl.Monad.Trans.MonadFixControl.Monad.Trans.MonadPlus:.ComposeF runComposeF:$ApplyF runApplyFInst:->TransM transMInstMonadMinstMreturn'bind'TransF transFInstMonadFinstFmfix'TransP transPInstMonadPinstPmzero'mplus'bindMbindFbindP