Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. (>>======) :: 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.

2. (>>=?) :: 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.

3. (%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b) . SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) t1) t2)

   singletons-base	Control.Monad.Singletons

   No documentation available.

4. (%>>=) :: forall a b (t1 :: m a) (t2 :: a ~> m b) . SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) t1) t2)

   singletons-base	Prelude.Singletons

   No documentation available.

5. (:>>=) :: 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.

6. (>>>=) :: 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.

7. (>>>==) :: 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.

8. (>>>=) :: (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
   

9. (>>>=) :: (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
   

10. 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.

Page 8 of many | Previous | Next