Copyright | (C) 2024 Eitan Chatav |
---|---|
License | BSD 3-Clause License (see the file LICENSE) |
Maintainer | Eitan Chatav <[email protected]> |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Control.Monad.Trans.Indexed.Do
Description
Qualified Indexed.do
notation.
>>>
:set -XQualifiedDo
>>>
import qualified Control.Monad.Trans.Indexed.Do as Indexed
Synopsis
- (>>=) :: forall {k1} t (m :: Type -> Type) (i :: k1) (j :: k1) x (k2 :: k1) y. (IxMonadTrans t, Monad m) => t i j m x -> (x -> t j k2 m y) -> t i k2 m y
- (>>) :: forall {k1} t (m :: Type -> Type) (i :: k1) (j :: k1) x (k2 :: k1) y. (IxMonadTrans t, Monad m) => t i j m x -> t j k2 m y -> t i k2 m y
- return :: Monad m => a -> m a
- fail :: forall {k} t (m :: Type -> Type) (i :: k) (j :: k) x. (IxMonadTrans t, MonadFail m, i ~ j) => String -> t i j m x
Documentation
(>>=) :: forall {k1} t (m :: Type -> Type) (i :: k1) (j :: k1) x (k2 :: k1) y. (IxMonadTrans t, Monad m) => t i j m x -> (x -> t j k2 m y) -> t i k2 m y Source #
(>>) :: forall {k1} t (m :: Type -> Type) (i :: k1) (j :: k1) x (k2 :: k1) y. (IxMonadTrans t, Monad m) => t i j m x -> t j k2 m y -> t i k2 m y Source #