Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. hoistCode :: Monad m => (forall x . () => m x -> n x) -> Code m a -> Code n a

   ghc-lib-parser	GHC.Internal.TH.Syntax

   Modify the ambient monad used during code generation. For example, you can use hoistCode to handle a state effect: handleState :: Code (StateT Int Q) a -> Code Q a handleState = hoistCode (flip runState 0)

2. hoistUDSMT :: (forall x . () => m x -> n x) -> UniqDSMT m a -> UniqDSMT n a

   ghc-lib-parser	GHC.Types.Unique.DSM

   Change the monad underyling an applied UniqDSMT, i.e. transform a UniqDSMT m into a UniqDSMT n given m ~> n.

3. hoistScope :: Functor f => (forall x . () => f x -> g x) -> Scope b f a -> Scope b g a

   bound	Bound.Scope

   Lift a natural transformation from f to g into one between scopes.

4. hoistScope :: (f (Var b a) -> g (Var b a)) -> Scope b f a -> Scope b g a

   bound	Bound.Scope.Simple

   No documentation available.

5. hoistClSF :: (Monad m1, Monad m2) => (forall c . () => m1 c -> m2 c) -> ClSF m1 cl a b -> ClSF m2 cl a b

   rhine	FRP.Rhine.ClSF.Core

   Hoist a ClSF along a monad morphism.

6. hoistClSFAndClock :: (Monad m1, Monad m2) => (forall c . () => m1 c -> m2 c) -> ClSF m1 cl a b -> ClSF m2 (HoistClock m1 m2 cl) a b

   rhine	FRP.Rhine.ClSF.Core

   Hoist a ClSF and its clock along a monad morphism.

7. hoistResamplingBuffer :: (Monad m1, Monad m2) => (forall c . () => m1 c -> m2 c) -> ResamplingBuffer m1 cla clb a b -> ResamplingBuffer m2 cla clb a b

   rhine	FRP.Rhine.ResamplingBuffer

   Hoist a ResamplingBuffer along a monad morphism.

8. hoistS :: Monad m => (forall x . () => m x -> n x) -> Automaton m a b -> Automaton n a b

   automaton	Data.Automaton

   Apply an arbitrary monad morphism to an automaton.

9. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

   automaton	Data.Automaton.Trans.Maybe

   Convert a Maybe computation to MaybeT.

10. hoist' :: (forall x . () => m1 x -> m2 x) -> StreamT m1 a -> StreamT m2 a

    automaton	Data.Stream

    Hoist a stream along a monad morphism, by applying said morphism to the step function. This is like mmorph's hoist, but it doesn't require a Monad constraint on m2.

Page 9 of many | Previous | Next