[Haskell-cafe] Re: excercise - a completely lazy sorting algorithm

[Matthias Görgens]

> So, a tree like Matthias implements it is the way to go. Basically, it
> reifies the recursive calls of quicksort as a lazy data struture which
> can be evaluated piecemeal.

Yes.  I wonder if it is possible to use a standard (randomized
quicksort) and employ some type class magic (like continuations) to
make the reification [1] transparent to the code.

Matthias.
[1] I reified reify.