| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Profunctor.Mapping
Contents
- class (Traversing p, Closed p) => Mapping p where
- newtype CofreeMapping p a b = CofreeMapping {
- runCofreeMapping :: forall f. Functor f => p (f a) (f b)
- data FreeMapping p a b where
- FreeMapping :: Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b
- traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b)
- closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b)
Documentation
class (Traversing p, Closed p) => Mapping p where Source
Instances
| Mapping (->) Source | |
| (Monad m, Distributive m) => Mapping (Kleisli m) Source | |
| (Applicative m, Distributive m) => Mapping (Star m) Source | |
| Mapping (FreeMapping p) Source | |
| Profunctor p => Mapping (CofreeMapping p) Source |
newtype CofreeMapping p a b Source
Constructors
| CofreeMapping | |
Fields
| |
Instances
| ProfunctorComonad CofreeMapping Source | |
| ProfunctorFunctor CofreeMapping Source | |
| Profunctor p => Profunctor (CofreeMapping p) Source | |
| Profunctor p => Strong (CofreeMapping p) Source | |
| Profunctor p => Closed (CofreeMapping p) Source | |
| Profunctor p => Choice (CofreeMapping p) Source | |
| Profunctor p => Traversing (CofreeMapping p) Source | |
| Profunctor p => Mapping (CofreeMapping p) Source |
data FreeMapping p a b where Source
FreeMapping -| CofreeMapping
Constructors
| FreeMapping :: Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b |
Instances
Closed in terms of Mapping
traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b) Source
closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b) Source