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. hoistMaybe :: MonadPlus m => Maybe a -> m a

   optparse-applicative	Options.Applicative.Internal

   No documentation available.

2. hoistAlt :: (forall a . () => f a -> g a) -> Alt f b -> Alt g b

   free	Control.Alternative.Free

   Given a natural transformation from f to g this gives a monoidal natural transformation from Alt f to Alt g.

3. hoistAlt :: (forall a . () => f a -> g a) -> Alt f b -> Alt g b

   free	Control.Alternative.Free.Final

   Given a natural transformation from f to g this gives a monoidal natural transformation from Alt f to Alt g.

4. hoistAp :: (forall a . () => f a -> g a) -> Ap f b -> Ap g b

   free	Control.Applicative.Free

   Given a natural transformation from f to g this gives a monoidal natural transformation from Ap f to Ap g.

5. hoistASeq :: (forall x . () => f x -> g x) -> ASeq f a -> ASeq g a

   free	Control.Applicative.Free.Fast

   Given a natural transformation from f to g this gives a natural transformation from ASeq f to ASeq g.

6. hoistAp :: (forall x . () => f x -> g x) -> Ap f a -> Ap g a

   free	Control.Applicative.Free.Fast

   Given a natural transformation from f to g this gives a monoidal natural transformation from Ap f to Ap g.

7. hoistAp :: (forall a . () => f a -> g a) -> Ap f b -> Ap g b

   free	Control.Applicative.Free.Final

   Given a natural transformation from f to g this gives a monoidal natural transformation from Ap f to Ap g.

8. hoistApF :: forall (g :: Type -> Type) f f' b . Functor g => (forall a . () => f a -> f' a) -> ApF f g b -> ApF f' g b

   free	Control.Applicative.Trans.Free

   Given a natural transformation from f to f' this gives a monoidal natural transformation from ApF f g to ApF f' g.

9. hoistApT :: forall (g :: Type -> Type) f f' b . Functor g => (forall a . () => f a -> f' a) -> ApT f g b -> ApT f' g b

   free	Control.Applicative.Trans.Free

   Given a natural transformation from f to f' this gives a monoidal natural transformation from ApT f g to ApT f' g.

10. hoistCofree :: Functor f => (forall x . () => f x -> g x) -> Cofree f a -> Cofree g a

    free	Control.Comonad.Cofree

    No documentation available.

Page 3 of many | Previous | Next