[Haskell-beginners] Parallelizing array-based functions

If you have a function that mutates the elements of an array in-place and leverages parallelism by recursively subdividing the problem and mutating parts of the array separately, can this be expressed in Haskell? In-place quicksort and many of the numerical methods from linear algebra fall into this category. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e