Copyright | (C) 2014-2015 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | experimental |
Portability | portable |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
Data.Profunctor.Cayley
Description
Documentation
newtype Cayley f p a b Source #
Static arrows. Lifted by Applicative
.
Cayley
has a polymorphic kind since 5.6
.
Instances
Functor f => ProfunctorFunctor (Cayley f :: (Type -> Type -> Type) -> Type -> Type -> Type) Source # | |
Defined in Data.Profunctor.Cayley | |
(Applicative f, Category p) => Category (Cayley f p :: k -> k -> Type) Source # | |
Comonad f => ProfunctorComonad (Cayley f :: (Type -> Type -> Type) -> Type -> Type -> Type) Source # | Cayley transforms Comonads in |
Defined in Data.Profunctor.Cayley Methods proextract :: forall (p :: Type -> Type -> Type). Profunctor p => Cayley f p :-> p Source # produplicate :: forall (p :: Type -> Type -> Type). Profunctor p => Cayley f p :-> Cayley f (Cayley f p) Source # | |
(Functor f, Monad f) => ProfunctorMonad (Cayley f :: (Type -> Type -> Type) -> Type -> Type -> Type) Source # | Cayley transforms Monads in |
Defined in Data.Profunctor.Cayley | |
(Applicative f, Arrow p) => Arrow (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley | |
(Applicative f, ArrowChoice p) => ArrowChoice (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley | |
(Applicative f, ArrowLoop p) => ArrowLoop (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley | |
(Applicative f, ArrowPlus p) => ArrowPlus (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley | |
(Applicative f, ArrowZero p) => ArrowZero (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley | |
(Functor f, Choice p) => Choice (Cayley f p) Source # | |
(Functor f, Cochoice p) => Cochoice (Cayley f p) Source # | |
(Functor f, Closed p) => Closed (Cayley f p) Source # | |
(Functor f, Mapping p) => Mapping (Cayley f p) Source # | |
(Functor f, Costrong p) => Costrong (Cayley f p) Source # | |
(Functor f, Strong p) => Strong (Cayley f p) Source # | |
(Functor f, Traversing p) => Traversing (Cayley f p) Source # | |
(Functor f, Profunctor p) => Profunctor (Cayley f p) Source # | |
Defined in Data.Profunctor.Cayley Methods dimap :: (a -> b) -> (c -> d) -> Cayley f p b c -> Cayley f p a d Source # lmap :: (a -> b) -> Cayley f p b c -> Cayley f p a c Source # rmap :: (b -> c) -> Cayley f p a b -> Cayley f p a c Source # (#.) :: forall a b c q. Coercible c b => q b c -> Cayley f p a b -> Cayley f p a c Source # (.#) :: forall a b c q. Coercible b a => Cayley f p b c -> q a b -> Cayley f p a c Source # |