[Haskell-beginners] Performance of parallel mergesort

[Antoine Latter]

On Mon, Dec 28, 2009 at 2:01 PM, Jon Harrop <jon at ffconsultancy.com> wrote:
> On Monday 28 December 2009 12:56:17 Yitzchak Gale wrote:
>> This discussion definitely does not belong on the
>> Haskell-Beginners list. Besides not being a topic
>> for beginners, being there is keeping it under the
>> radar of many or most of the people who work on
>> these things in Haskell.
>>
>> I am moving the discussion to the GHC users list,
>> as suggested by Antoine. For those joining us in
>> progress, the first part of the thread starts here:
>>
>> http://www.haskell.org/pipermail/beginners/2009-December/003045.html
>
> I am not familiar with the GHC users list but is this discussion about basic
> parallelism really more relevant here? The interesting bits aren't GHC
> specific...

I don't think that any other implementation has support for the 'par'
operator, but I could see a case for either haskell-cafe or ghc-users
being a good spot for discussion. The beginers list is targeted at
raw-recruits or students overcoming their first encounter with
Haskell.

>
> Also, is this list censored like the Haskell Cafe or is it open?
>

I've never had any messages removed or moderated in any of the
@haskell.org lists, but maybe I'm not saying the right things :-)

Antoine