Pairings between functors.
type Pairing f g = forall c b a. (a -> b -> c) -> f a -> g b -> c
A pairing between functors
This asserts that any sums in
f can annihilate any products in
g, and vice
This library provides some useful pairings, and ways of lifting pairings over
various constructions on