
11 Nov
2010
11 Nov
'10
4:52 a.m.
On Thu, Nov 11, 2010 at 11:25, Bob
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