Data.Biapplicative

Biapplicative bifunctors

class Bifunctor p => Biapplicative p where

Minimal complete definition

bipure, (<<*>>)

Methods

bipure :: a -> b -> p a b

(<<*>>) :: p (a -> b) (c -> d) -> p a c -> p b d infixl 4

(*>>) :: p a b -> p c d -> p c d infixl 4

a *> b ≡ const id <$> a <*> b

(<<*) :: p a b -> p c d -> p a b infixl 4

a <* b ≡ const <$> a <.> b

Instances

Biapplicative (,)

Biapplicative Const

Biapplicative Arg

Monoid x => Biapplicative ((,,) x)

Biapplicative (Tagged *)

Applicative f => Biapplicative (Clown f)

Biapplicative p => Biapplicative (Flip p)

Applicative g => Biapplicative (Joker g)

Biapplicative p => Biapplicative (WrappedBifunctor p)

(Monoid x, Monoid y) => Biapplicative ((,,,) x y)

(Biapplicative f, Biapplicative g) => Biapplicative (Product f g)

(Applicative f, Biapplicative p) => Biapplicative (Tannen f p)

(Monoid x, Monoid y, Monoid z) => Biapplicative ((,,,,) x y z)

(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff p f g)

(<<$>>) :: (a -> b) -> a -> b infixl 4

(<<**>>) :: Biapplicative p => p a c -> p (a -> b) (c -> d) -> p b d infixl 4

biliftA2 :: Biapplicative w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c f

Lift binary functions

biliftA3 :: Biapplicative w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d h

Lift ternary functions

module Data.Bifunctor