I don't see any breaking of referential transparence in your code.
Every time you do an IO operation the result is basically
non-deterministic since you are talking to the outside world.
You're assuming the IO has some kind of semantics that Haskell makes
no promises about.
I'm not saying that thi
Hi,
It seems to me that basically, a run of Oleg's code is :: IO Int,
not Int, so there is little sense to talk about referential transparencies
by comparing the results of two runs.
It would have sense by making the comparison directly in a single run,
inside the code (using a pure compare funct
On Mar 1, 2009, at 8:21 PM, John MacFarlane wrote:
I'm pleased to announce the release of pandoc version 1.2
(uploaded today to HackageDB).
The most significant new feature is support for literate Haskell.
That is a very useful feature. It let's us mash-up pandoc and lhs2TeX
to create nice
As Amr Sabry aptly observed more than a decade ago discussions of
purity and referential transparency usually lead to confusion and
disagreement. His JFP paper provided the needed rigor and argued that
Haskell even _with regular file (stream) IO_ is pure. As was shown
yesterday, with Lazy IO, Hask
On Thu, 2009-03-05 at 20:11 -0800, o...@okmij.org wrote:
> As Amr Sabry aptly observed more than a decade ago discussions of
> purity and referential transparency usually lead to confusion and
> disagreement. His JFP paper provided the needed rigor and argued that
> Haskell even _with regular file
James Wood, Senior Consultant of The Kaizen Partnership, has posted
the following message on fa.haskell about a Haskell career
opportunity, so I am forwarding it to here for your information:
On Thu, 5 Mar 2009 07:00:57 -0800 (PST), in fa.haskell James Wood
wrote:
>Dear All
>
>I am a headhunter
