This seems to be the Haskell equivalent

[Don]

retard wrote:
> Sun, 20 Dec 2009 16:44:03 +0100, Don wrote:
> 
>> downs wrote:
>>> according to
>>> http://www.mail-archive.com/haskell-cafe%40haskell.org/msg63381.html
>>>
>>> I'll let this speak for itself.
>>>
>>> import Data.Array.Base (unsafeRead, unsafeWrite)
>> [snip]
>>
>> Brilliant.
> 
> What is so brilliant? Referential transparency is broken unless single-
> threadedness is forced through monadic computation or by some other means 
> (uniqueness types comes to mind).

The brilliant bit is the idea of doing a fairer comparison of quicksort 
between D and Haskell.