[Haskell-cafe] Serialization of (a -> b) and IO a
max.rabkin at gmail.com
Thu Nov 11 04:52:10 EST 2010
On Thu, Nov 11, 2010 at 11:25, Bob <tom.davie at 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".
More information about the Haskell-Cafe