Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. newtype CofreeMapping (p :: Type -> Type -> Type) a b

    profunctors Data.Profunctor.Mapping

    No documentation available.

  2. CofreeMapping :: (forall (f :: Type -> Type) . Functor f => p (f a) (f b)) -> CofreeMapping (p :: Type -> Type -> Type) a b

    profunctors Data.Profunctor.Mapping

    No documentation available.

  3. data FreeMapping (p :: Type -> Type -> Type) a b

    profunctors Data.Profunctor.Mapping 

    FreeMapping -| CofreeMapping

  4. FreeMapping :: forall (f :: Type -> Type) y b (p :: Type -> Type -> Type) x a . Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b

    profunctors Data.Profunctor.Mapping

    No documentation available.

  5. closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b)

    profunctors Data.Profunctor.Mapping

    No documentation available.

  6. runCofreeMapping :: CofreeMapping (p :: Type -> Type -> Type) a b -> forall (f :: Type -> Type) . Functor f => p (f a) (f b)

    profunctors Data.Profunctor.Mapping

    No documentation available.

  7. traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b)

    profunctors Data.Profunctor.Mapping

    No documentation available.

  8. wanderMapping :: Mapping p => (forall (f :: Type -> Type) . Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t

    profunctors Data.Profunctor.Mapping

    No documentation available.

  9. promap :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) . (ProfunctorFunctor t, Profunctor p) => (p :-> q) -> t p :-> t q

    profunctors Data.Profunctor.Monad

    Laws: 

    promap f . promap g ≡ promap (f . g)
promap id ≡ id

  10. dimapWandering :: Traversing p => (a' -> a) -> (b -> b') -> p a b -> p a' b'

    profunctors Data.Profunctor.Traversing

    A definition of dimap for Traversing instances that define an explicit wander.

Page 432 of many | Previous | Next