Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

Exact lookup

1. invmapProfunctor :: Profunctor p => (a -> b) -> (b -> a) -> p a a -> p b b

   invariant	Data.Functor.Invariant

   A Profunctor with the same input and output types can be seen as an Invariant functor.

2. makeInvmap :: Name -> Q Exp

   invariant	Data.Functor.Invariant.TH

   Generates a lambda expression which behaves like invmap (without requiring an Invariant instance).

3. makeInvmap2 :: Name -> Q Exp

   invariant	Data.Functor.Invariant.TH

   Generates a lambda expression which behaves like invmap2 (without requiring an Invariant2 instance).

4. makeInvmap2Options :: Options -> Name -> Q Exp

   invariant	Data.Functor.Invariant.TH

   Like makeInvmap2, but takes an Options argument.

5. makeInvmapOptions :: Options -> Name -> Q Exp

   invariant	Data.Functor.Invariant.TH

   Like makeInvmap, but takes an Options argument.

6. data FmapSym0 (a1 :: TyFun a ~> b f a ~> f b)

   singletons-base	Control.Monad.Singletons

   No documentation available.

7. data FmapSym1 (a6989586621679356621 :: a ~> b) (b1 :: TyFun f a f b)

   singletons-base	Control.Monad.Singletons

   No documentation available.

8. type family FmapSym2 (a6989586621679356621 :: a ~> b) (a6989586621679356622 :: f a) :: f b

   singletons-base	Control.Monad.Singletons

   No documentation available.

9. sFmap :: forall a b (t1 :: a ~> b) (t2 :: f a) . SFunctor f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) t1) t2)

   singletons-base	Control.Monad.Singletons

   No documentation available.

10. sMapAndUnzipM :: forall a (m :: Type -> Type) b c (t1 :: a ~> m (b, c)) (t2 :: [a]) . SApplicative m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapAndUnzipMSym0 :: TyFun (a ~> m (b, c)) ([a] ~> m ([b], [c])) -> Type) t1) t2)

    singletons-base	Control.Monad.Singletons

    No documentation available.

Page 527 of many | Previous | Next