Hoogle Search

Within Stackage Nightly 2026-07-01 (ghc-9.12.4)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. (>>>=) :: (Bound t, Monad f) => t f a -> (a -> f c) -> t f c

    bound Bound.Class

    Perform substitution If t is an instance of MonadTrans and you are compiling on GHC >= 7.4, then this gets the default definition: 

    m >>>= f = m >>= lift . f

  2. pattern (:>>=) :: forall t s sq f a x . () => t x -> Fun s sq f t x a -> Freer s sq f t a

    freer-par-monad Control.Monad.Freer.Par

    No documentation available.

  3. (>>>=) :: forall (sq :: (Type -> Type -> Type) -> Type -> Type -> Type) (f :: (Type -> Type) -> Type -> Type -> Type) t a s b . (Sequence sq, Funable f) => t a -> (a -> Freer s sq f t b) -> Freer s sq f t b

    freer-par-monad Control.Monad.Freer.Par

    No documentation available.

  4. (:>>=) :: f x -> (x -> g a) -> Comp (f :: Type -> Type) (g :: k -> Type) (a :: k)

    functor-combinators Control.Monad.Freer.Church

    No documentation available.

  5. (:>>=) :: h (H h) i o x -> Q (H h i o) x a -> H (h :: (Type -> Type -> Type -> Type) -> Type -> Type -> Type -> Type) i o a

    higher-order-freer-monad Control.Monad.HigherFreer

    No documentation available.

  6. (=<<->>=) :: Monad m => (a -> m b) -> (b -> m a) -> m a <-> m b

    invertible Data.Invertible.Monad

    Crazy operator form of bind.

  7. (.>>=) :: Expr -> Expr -> Expr

    language-c99-simple Language.C99.Simple.Expr

    No documentation available.

Page 9 of many | Previous | Next