Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. (>>>) :: forall (m :: Type -> Type) b a . Monad m => (b -> a) -> Predicate m a -> Predicate m b

    skeletest Skeletest.Internal.Predicate

    Same as <<<, except with the arguments flipped. 

    >>> "hello" `shouldSatisfy` (length P.>>> P.eq 5)

  2. (>>>) :: forall (m :: Type -> Type) b a . Monad m => (b -> a) -> Predicate m a -> Predicate m b

    skeletest Skeletest.Predicate

    Same as <<<, except with the arguments flipped. 

    >>> "hello" `shouldSatisfy` (length P.>>> P.eq 5)

  3. (>>>) :: IOMcn a b -> IOMcn b c -> IOMcn a c

    io-machine IOMcn

    No documentation available.

  4. (>>>) :: (Category k, Object k a, Object k b, Object k c) => k a b -> k b c -> k a c

    constrained-categories Control.Arrow.Constrained

    No documentation available.

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

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

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

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

  9. (>>>^) :: forall (m :: Type -> Type) cl a b c . Monad m => SN m cl a b -> (b -> c) -> SN m cl a c

    rhine FRP.Rhine.SN.Combinators

    Postcompose a signal network with a pure function.

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

Page 1 of many | Next