Data.Bifunctor.Biff

bifunctors-5.3: Bifunctors

Copyright | (C) 2008-2016 Edward Kmett
License | BSD-style (see the file LICENSE)
Maintainer | Edward Kmett <ekmett@gmail.com>
Stability | provisional
Portability | portable
Safe Haskell | Safe
Language | Haskell98

Data.Bifunctor.Biff

Description

Synopsis

- newtype Biff p f g a b = Biff {
  - runBiff :: p (f a) (g b)
  }

# Documentation

newtype Biff p f g a b

Compose two `Functor`s on the inside of a `Bifunctor`.

Constructors

Biff |
Fields runBiff :: p (f a) (g b)

Instances

(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff * * * * p f g) |
(Bifoldable p, Foldable f, Foldable g) => Bifoldable (Biff * * * * p f g) |
(Bitraversable p, Traversable f, Traversable g) => Bitraversable (Biff * * * * p f g) |
(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff * * * * p f g) |
(Bifunctor p, Functor g) => Functor (Biff * * k * p f g a) |
(Bifoldable p, Foldable g) => Foldable (Biff * * k * p f g a) |
(Bitraversable p, Traversable g) => Traversable (Biff * * k * p f g a) |
Functor (p (f a)) => Generic1 (Biff k * k * p f g a) |
Eq (p (f a) (g b)) => Eq (Biff k k k k p f g a b) |
Ord (p (f a) (g b)) => Ord (Biff k k k k p f g a b) |
Read (p (f a) (g b)) => Read (Biff k k k k p f g a b) |
Show (p (f a) (g b)) => Show (Biff k k k k p f g a b) |
Generic (Biff k k k k p f g a b) |
type Rep1 (Biff k k1 k2 k3 p f g a) |
type Rep (Biff k k1 k2 k3 p f g a b) |