Copyright | (C) 2014-2015 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | provisional |
Portability | Rank2Types |
Safe Haskell | Safe |
Language | Haskell2010 |
Data.Profunctor.Strong
Contents
Description
Synopsis
- class Profunctor p => Strong (p :: Type -> Type -> Type) where
- uncurry' :: Strong p => p a (b -> c) -> p (a, b) c
- strong :: Strong p => (a -> b -> c) -> p a b -> p a c
- newtype Tambara (p :: Type -> Type -> Type) a b = Tambara {
- runTambara :: forall c. p (a, c) (b, c)
- tambara :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). Strong p => (p :-> q) -> p :-> Tambara q
- untambara :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Profunctor q => (p :-> Tambara q) -> p :-> q
- data Pastro (p :: Type -> Type -> Type) a b where
- pastro :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Strong q => (p :-> q) -> Pastro p :-> q
- unpastro :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). (Pastro p :-> q) -> p :-> q
- class Profunctor p => Costrong (p :: Type -> Type -> Type) where
- data Cotambara (q :: Type -> Type -> Type) a b where
- cotambara :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). Costrong p => (p :-> q) -> p :-> Cotambara q
- uncotambara :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Profunctor q => (p :-> Cotambara q) -> p :-> q
- newtype Copastro (p :: Type -> Type -> Type) a b = Copastro {
- runCopastro :: forall (r :: Type -> Type -> Type). Costrong r => (forall x y. p x y -> r x y) -> r a b
Strength
class Profunctor p => Strong (p :: Type -> Type -> Type) where #
Generalizing Star
of a strong Functor
Note: Every Functor
in Haskell is strong with respect to (,)
.
This describes profunctor strength with respect to the product structure of Hask.
Methods
Instances
newtype Tambara (p :: Type -> Type -> Type) a b #
Tambara
cofreely makes any Profunctor
Strong
.
Constructors
Tambara | |
Fields
|
Instances
tambara :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). Strong p => (p :-> q) -> p :-> Tambara q #
untambara :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Profunctor q => (p :-> Tambara q) -> p :-> q #
data Pastro (p :: Type -> Type -> Type) a b where #
Pastro -| Tambara
Pastro p ~ exists z. Costar ((,)z)Procompose
pProcompose
Star ((,)z)
Pastro
freely makes any Profunctor
Strong
.
Constructors
Pastro :: forall y z b (p :: Type -> Type -> Type) x a. ((y, z) -> b) -> p x y -> (a -> (x, z)) -> Pastro p a b |
Instances
ProfunctorMonad Pastro # | |
ProfunctorAdjunction Pastro Tambara # | |
ProfunctorFunctor Pastro # | |
Strong (Pastro p) # | |
Profunctor (Pastro p) # | |
Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Pastro p b c -> Pastro p a d # lmap :: (a -> b) -> Pastro p b c -> Pastro p a c # rmap :: (b -> c) -> Pastro p a b -> Pastro p a c # (#.) :: forall a b c q. Coercible c b => q b c -> Pastro p a b -> Pastro p a c # (.#) :: forall a b c q. Coercible b a => Pastro p b c -> q a b -> Pastro p a c # | |
Functor (Pastro p a) # | |
pastro :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Strong q => (p :-> q) -> Pastro p :-> q #
unpastro :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). (Pastro p :-> q) -> p :-> q #
Costrength
class Profunctor p => Costrong (p :: Type -> Type -> Type) where #
Methods
Instances
MonadFix m => Costrong (Kleisli m) # | |
Costrong (Copastro p) # | |
Costrong (Cotambara p) # | |
Costrong p => Costrong (Coyoneda p) # | |
Costrong p => Costrong (Yoneda p) # | |
Costrong (Tagged :: Type -> Type -> Type) # | |
Functor f => Costrong (Cokleisli f) # | |
Functor f => Costrong (Costar f) # | |
Costrong (->) # | |
Defined in Data.Profunctor.Strong | |
ArrowLoop p => Costrong (WrappedArrow p) # | |
Defined in Data.Profunctor.Strong Methods unfirst :: WrappedArrow p (a, d) (b, d) -> WrappedArrow p a b # unsecond :: WrappedArrow p (d, a) (d, b) -> WrappedArrow p a b # | |
(Costrong p, Costrong q) => Costrong (Product p q) # | |
(Costrong p, Costrong q) => Costrong (Sum p q) # | |
(Functor f, Costrong p) => Costrong (Tannen f p) # | |
(Functor f, Costrong p) => Costrong (Cayley f p) # | |
(Corepresentable p, Corepresentable q) => Costrong (Procompose p q) # | |
Defined in Data.Profunctor.Composition Methods unfirst :: Procompose p q (a, d) (b, d) -> Procompose p q a b # unsecond :: Procompose p q (d, a) (d, b) -> Procompose p q a b # |
data Cotambara (q :: Type -> Type -> Type) a b where #
Cotambara cofreely constructs costrength
Constructors
Cotambara :: forall (r :: Type -> Type -> Type) (q :: Type -> Type -> Type) a b. Costrong r => (r :-> q) -> r a b -> Cotambara q a b |
Instances
ProfunctorComonad Cotambara # | |
Defined in Data.Profunctor.Strong Methods proextract :: forall (p :: Type -> Type -> Type). Profunctor p => Cotambara p :-> p # produplicate :: forall (p :: Type -> Type -> Type). Profunctor p => Cotambara p :-> Cotambara (Cotambara p) # | |
ProfunctorAdjunction Copastro Cotambara # | |
ProfunctorFunctor Cotambara # | |
Costrong (Cotambara p) # | |
Profunctor (Cotambara p) # | |
Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Cotambara p b c -> Cotambara p a d # lmap :: (a -> b) -> Cotambara p b c -> Cotambara p a c # rmap :: (b -> c) -> Cotambara p a b -> Cotambara p a c # (#.) :: forall a b c q. Coercible c b => q b c -> Cotambara p a b -> Cotambara p a c # (.#) :: forall a b c q. Coercible b a => Cotambara p b c -> q a b -> Cotambara p a c # | |
Functor (Cotambara p a) # | |
cotambara :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). Costrong p => (p :-> q) -> p :-> Cotambara q #
uncotambara :: forall (q :: Type -> Type -> Type) (p :: Type -> Type -> Type). Profunctor q => (p :-> Cotambara q) -> p :-> q #
newtype Copastro (p :: Type -> Type -> Type) a b #
Copastro -| Cotambara
Copastro freely constructs costrength
Constructors
Copastro | |
Fields
|
Instances
ProfunctorMonad Copastro # | |
ProfunctorAdjunction Copastro Cotambara # | |
ProfunctorFunctor Copastro # | |
Costrong (Copastro p) # | |
Profunctor (Copastro p) # | |
Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Copastro p b c -> Copastro p a d # lmap :: (a -> b) -> Copastro p b c -> Copastro p a c # rmap :: (b -> c) -> Copastro p a b -> Copastro p a c # (#.) :: forall a b c q. Coercible c b => q b c -> Copastro p a b -> Copastro p a c # (.#) :: forall a b c q. Coercible b a => Copastro p b c -> q a b -> Copastro p a c # | |
Functor (Copastro p a) # | |