25 Nov
2002
25 Nov
'02
3:19 p.m.
On Sun, 24 Nov 2002 22:50:43 +0100, Nick Name <nick.name@inwind.it> wrote:
On Sun, 24 Nov 2002 20:42:31 +0000 Glynn Clements <glynn.clements@virgin.net> wrote:
Even if Haskell were strict, you still wouldn't be able to treat I/O operations as functions without discarding referential transparency.
Yes, but if haskell were strict, it wouldn't really need referential transparency, that's why I mentioned lazyness.
Referential transparency is still useful in strict languages. I sometimes use updatable references in ML but find myself having to think very carefully whether what I'm doing is safe. Of course the need is rather greater in lazy languages. Ganesh