[Haskell-cafe] Referential Transparency and Monads
mark.spezzano at chariot.net.au
Thu Apr 9 11:47:08 EDT 2009
How exactly do monads solve the problem of referential transparency? I
understand RT to be such that a function can be replaced with a actual
Since a monad could potentially encapsulate any other valuesay, data read
from a keyboarddoesnt that violate the assumption of RT on monads?
Or does RT ignore the encapsulated data and just view the action performed
by the monad as the value of the monad?
Just curious as to the rationale behind referential transparency and how it
applies to monads.
No virus found in this outgoing message.
Checked by AVG.
Version: 7.5.557 / Virus Database: 270.11.48/2048 - Release Date: 8/04/2009
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe