bifunctors-4.2.1: Bifunctors

Copyright(C) 2008-2013 Edward Kmett,
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Bifunctor.Biff

Description

 

Synopsis

Documentation

newtype Biff p f g a b

Compose two Functors on the inside of a Bifunctor.

Constructors

Biff 

Fields

runBiff :: p (f a) (g b)
 

Instances

(Bifoldable p, Foldable f, Foldable g) => Bifoldable (Biff p f g) 
(Bifoldable1 p, Foldable1 f, Foldable1 g) => Bifoldable1 (Biff p f g) 
(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) 
(Biapply p, Apply f, Apply g) => Biapply (Biff p f g) 
(Bitraversable p, Traversable f, Traversable g) => Bitraversable (Biff p f g) 
(Bitraversable1 p, Traversable1 f, Traversable1 g) => Bitraversable1 (Biff p f g) 
(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff p f g) 
(Bifunctor p, Functor g) => Functor (Biff p f g a) 
(Bifoldable p, Foldable g) => Foldable (Biff p f g a) 
(Bitraversable p, Traversable g) => Traversable (Biff p f g a) 
Eq (p (f a) (g b)) => Eq (Biff p f g a b) 
Ord (p (f a) (g b)) => Ord (Biff p f g a b) 
Read (p (f a) (g b)) => Read (Biff p f g a b) 
Show (p (f a) (g b)) => Show (Biff p f g a b)