Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

1. hoistFixM' :: (Functor f, Traversable g, Monad m) => (forall a . () => f a -> m (g a)) -> Fix f -> m (Fix g)

   unification-fd	Data.Functor.Fixedpoint

   A monadic variant of hoistFix'. NOTE: The implementation of hmapM prior to version 0.12 was based on anaM, and therefore most closely matches the behavior of unfoldFixM. However, there is another function of the same type which is instead implemented via cataM, which has different semantics for many monads.

2. data HoistClock (m1 :: Type -> Type) (m2 :: Type -> Type) cl

   rhine	FRP.Rhine.Clock

   Applying a monad morphism yields a new clock.

3. HoistClock :: cl -> (forall a . () => m1 a -> m2 a) -> HoistClock (m1 :: Type -> Type) (m2 :: Type -> Type) cl

   rhine	FRP.Rhine.Clock

   No documentation available.

4. class ComonadHoist (t :: Type -> Type -> Type -> Type)

   comonad	Control.Comonad.Hoist.Class

   No documentation available.

5. cohoist :: (ComonadHoist t, Comonad w, Comonad v) => (forall x . () => w x -> v x) -> t w a -> t v a

   comonad	Control.Comonad.Hoist.Class

   Given any comonad-homomorphism from w to v this yields a comonad homomorphism from t w to t v.

6. unsafeHoist :: Functor m => (forall x . () => m x -> n x) -> Proxy a' a b' b m r -> Proxy a' a b' b n r

   pipes	Pipes.Internal

   unsafeHoist is like hoist, but faster. This is labeled as unsafe because you will break the monad transformer laws if you do not pass a monad morphism as the first argument. This function is safe if you pass a monad morphism as the first argument.

7. genericClientHoist :: forall routes m n . (HasClient m (ToServantApi routes), GenericServant routes (AsClientT n), Client n (ToServantApi routes) ~ ToServant routes (AsClientT n)) => (forall x . () => m x -> n x) -> routes (AsClientT n)

   servant-client-core	Servant.Client.Generic

   genericClient but with hoistClientMonad in between.

8. alternateHoisting :: (Monad n, Alternative n) => (forall a1 . () => m a1 -> n a1) -> ListT m a -> n a

   list-t	ListT

   Use a monad morphism to convert a ListT to a similar monad, such as '[]'. A more efficient alternative to alternate . hoist f.

9. srpHoist :: (forall x . () => f x -> g x) -> SourceRepositoryPackage f -> SourceRepositoryPackage g

   cabal-install-parsers	Cabal.SourceRepo

   No documentation available.

10. unhoistedClock :: HoistClock (m1 :: Type -> Type) (m2 :: Type -> Type) cl -> cl

    rhine	FRP.Rhine.Clock

    No documentation available.

Page 16 of many | Previous | Next