stack-bound vs. travelling closures proposal.

[Neal Gafter]

On Thu, Jun 17, 2010 at 6:12 PM, Reinier Zwitserloot
<reinier at zwitserloot.com> wrote:
> Parellizing sort can be done in a similar way to the example implementation
> of forEachParallelized.
> Yes, it's ugly, and involves both unshackle and sneakyThrow, but it would
> work just fine.

Recall that better concurrency support is one of the motivations for
adding lambda.  If the language forces programmers to undermine the
type system (or exception checking system) in order to use
concurrency, then we've failed.