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. (>>====) :: Monad m => m d -> (a -> b -> c -> d -> m e) -> a -> b -> c -> m e

    composition-extra Control.Monad.Syntax

    No documentation available.

  2. (>>=====) :: Monad m => m e -> (a -> b -> c -> d -> e -> m f) -> a -> b -> c -> d -> m f

    composition-extra Control.Monad.Syntax

    No documentation available.

  3. (>>======) :: Monad m => m f -> (a -> b -> c -> d -> e -> f -> m g) -> a -> b -> c -> d -> e -> m g

    composition-extra Control.Monad.Syntax

    No documentation available.

  4. (>>=?) :: Fractional prob => T prob a -> (a -> Bool) -> T prob a

    probability Numeric.Probability.Distribution

    filter in infix form. Can be considered an additional monadic combinator, which can be used where you would want guard otherwise.

  5. (%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b) . SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >>= t2)

    singletons-base Control.Monad.Singletons

    No documentation available.

  6. (%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b) . SMonad m => Sing t1 -> Sing t2 -> Sing (t1 >>= t2)

    singletons-base Prelude.Singletons

    No documentation available.

  7. (:>>=) :: forall (instr :: Type -> Type) b (m :: Type -> Type) a . instr b -> (b -> ProgramT instr m a) -> ProgramViewT instr m a

    operational Control.Monad.Operational

    No documentation available.

  8. (>>>=) :: forall e1 (m :: Type -> Type) a b e2 . (Data e1, Monad m) => Cell (ExceptT e1 m) a b -> Cell (ExceptT e2 m) (e1, a) b -> Cell (ExceptT e2 m) a b

    essence-of-live-coding LiveCoding.Exceptions

    No documentation available.

  9. (>>>==) :: forall e1 (m :: Type -> Type) a b e2 . (Data e1, Monad m) => Cell (ExceptT e1 m) a b -> Cell (ReaderT e1 (ExceptT e2 m)) a b -> Cell (ExceptT e2 m) a b

    essence-of-live-coding LiveCoding.Exceptions

    No documentation available.

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

    bound Bound

    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
    

Page 8 of many | Previous | Next