[Haskell-cafe] Mutable arrays

[Stefan O'Rear]

On Wed, Feb 06, 2008 at 08:57:43PM +0000, Andrew Butterfield wrote:
> In Clean, we not only have explicit access to the world, but
> we can partition it. Simplifying somewhat, we could open up
> pairs of file-handle (f1.in,f1.out), (f2.in,f2,out) ... (fn.in,fn.out),
> which does have to be done sequentially, since each file opening modifies 
> the (global) filesystem. However, once this is done,
> we could, in principle, execute the fn in any order,
> and indeed in such a way that the implementation could choose to
> do them in parallel - this potential for (admittedly limited)
> deterministic parallel execution of I/O actions is possible with
> uniqueness types, but not epxressible in the monadic world as
> currently formulated.

What if f1.out is a symlink to f2.out?  I don't think Clean satisfies
the evaluation order independance that is so treasured here.

Stefan
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20080206/e8322060/attachment.bin