Portability | portable |
---|---|

Stability | provisional |

Maintainer | Edward Kmett <ekmett@gmail.com> |

Safe Haskell | Safe-Infered |

- class Bifunctor p => Biapply p where
- (<<$>>) :: (a -> b) -> a -> b
- (<<..>>) :: Biapply p => p a c -> p (a -> b) (c -> d) -> p b d
- bilift2 :: Biapply w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c f
- bilift3 :: Biapply w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d h
- module Data.Bifunctor

# Functors

# Applyable bifunctors

class Bifunctor p => Biapply p whereSource

A strong lax semi-monoidal endofunctor.
This is equivalent to an `Applicative`

without `pure`

.

Laws:

associative composition: (.) <$> u <.> v <.> w = u <.> (v <.> w)

bilift2 :: Biapply w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c fSource

Lift a binary function into a comonad with zipping

bilift3 :: Biapply w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d hSource

Lift a ternary function into a comonad with zipping

module Data.Bifunctor