[EMAIL PROTECTED] wrote,
Manuel M. T. Chakravarty writes:
[EMAIL PROTECTED] wrote,
I'm not surprised you are puzzled. Concurrent Haskell, as
implemented in ghc, does NOT preserve referential
transparency, nor could it.
Of course it does! If it wouldn't many of the
Manuel M. T. Chakravarty writes:
[EMAIL PROTECTED] wrote,
Adrian Hey writes:
On Wed 06 Oct, Johan Nordlander wrote:
Just to avoid any unfortunate misconceptions: O'Haskell definitely
preserves the property we commonly refer to as referential transparency,
and so
Tim [EMAIL PROTECTED] wrote:
For example, consider a program where one thread prints a value from an MVar,
while another thread modifies it. The output of the program will vary from one
run to another, even though its input (none) is unchanged.
This is not a result of using concurrency.
You
On Thu 07 Oct, [EMAIL PROTECTED] wrote:
See the paper "Concurrent Haskell" by Simon Peyton Jones, Andrew Gordon and
Sigbjorn Finne, which states:
"forkIO :: IO () - IO () forkIO a is an action which takes an action, a, as
its argument and spawns a concurrent process to perform that action.