darcs patch: Add equating p x y = p x == p y

[Jon Fairbairn]

On 2006-10-20 at 12:22BST Malcolm Wallace wrote:
> Jon Fairbairn <jon.fairbairn at cl.cam.ac.uk> wrote:
> 
> > Control.Combinators? Such general beasts as mapFst, mapSnd
> > and >< from Data.Graph.Inductive.Query.Monad could go in
> > there, as could other pair handling combinators like
> > (f <&> g) x = (f x, g x)
> 
> Pairs are a data structure.

Whoops, so they are. There I was thinking they were just
(forall r. (a -> b -> r) -> r) ;-)

Still, the other ones (const, id, flip, $) /are/ (pure)
combinators, so why not call them that?

-- 
Jón Fairbairn                              Jon.Fairbairn at cl.cam.ac.uk