On Thu, Nov 11, 2010 at 11:25, Bob <tom.da...@gmail.com> wrote: > I don't think I agree, I didn't see a rule f == g => serialise f == serialise > g anywhere.
The rule a == b => f a == f b is called referential transparency (for denotational equality, not Eq) and is (perhaps the most important) part of what is meant by "purely functional". --Max _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
