Portability portable provisional Edward Kmett None

Data.Bifunctor.Apply

Contents

Description

Synopsis

# Biappliable bifunctors

class Bifunctor p => Biapply p whereSource

Methods

(<<.>>) :: p (a -> b) (c -> d) -> p a c -> p b dSource

(.>>) :: p a b -> p c d -> p c dSource

``` a `.>` b ≡ `const` `id` `<\$>` a `<.>` b
```

(<<.) :: p a b -> p c d -> p a bSource

``` a `<.` b ≡ `const` `<\$>` a `<.>` b
```

Instances

 Biapply (,) Biapply Const (Bifunctor ((,,) x), Semigroup x) => Biapply ((,,) x) Biapply (Tagged *) (Bifunctor (Clown f), Apply f) => Biapply (Clown f) (Bifunctor (Flip p), Biapply p) => Biapply (Flip p) (Bifunctor (Joker g), Apply g) => Biapply (Joker g) (Bifunctor (WrappedBifunctor p), Biapply p) => Biapply (WrappedBifunctor p) (Bifunctor ((,,,) x y), Semigroup x, Semigroup y) => Biapply ((,,,) x y) (Bifunctor ((,,,,) x y z), Semigroup x, Semigroup y, Semigroup z) => Biapply ((,,,,) x y z)

(<<\$>>) :: (a -> b) -> a -> bSource

(<<..>>) :: Biapply p => p a c -> p (a -> b) (c -> d) -> p b dSource

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

Lift binary functions

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

Lift ternary functions