| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Data.Bifunctor.Functor
- type (:->) p q = forall a b. p a b -> q a b
- class BifunctorFunctor t where
- class BifunctorFunctor t => BifunctorMonad t where
- biliftM :: BifunctorMonad t => (p :-> q) -> t p :-> t q
- class BifunctorFunctor t => BifunctorComonad t where
- biliftW :: BifunctorComonad t => (p :-> q) -> t p :-> t q
Documentation
type (:->) p q = forall a b. p a b -> q a b infixr 0
Using parametricity as an approximation of a natural transformation in two arguments.
class BifunctorFunctor t where
Instances
| BifunctorFunctor k k k k (Flip k k) | |
| BifunctorFunctor k k k k (Sum k k p) | |
| BifunctorFunctor k k k k (Product k k p) | |
| Functor f => BifunctorFunctor k k k k (Tannen * k k f) |
class BifunctorFunctor t => BifunctorMonad t where
Instances
| BifunctorMonad k k (Sum k k p) | |
| (Functor f, Monad f) => BifunctorMonad k k (Tannen * k k f) |
biliftM :: BifunctorMonad t => (p :-> q) -> t p :-> t q
class BifunctorFunctor t => BifunctorComonad t where
Minimal complete definition
biextract, (biextend | biduplicate)
Instances
| BifunctorComonad k k (Product k k p) | |
| Comonad f => BifunctorComonad k k (Tannen * k k f) |
biliftW :: BifunctorComonad t => (p :-> q) -> t p :-> t q