[Haskell-cafe] A tale of Project Euler

Henning Thielemann lemming at henning-thielemann.de
Fri Nov 30 08:39:17 EST 2007

On Thu, 29 Nov 2007, Andrew Coppin wrote:

> Sebastian Sylvan wrote:
> > On Nov 29, 2007 6:43 PM, Andrew Coppin <andrewcoppin at btinternet.com> wrote:
> >
> >> I don't understand the ST monad.
> >
> > There's not a whole lot to understand if you just want to use it
> > (though it's all very cool from a theoretical standpoint too).
>  From what I can tell, it's not definable without using strange language
> extensions. (I don't really like using things where it's unclear why it
> works.)

Is this thread still about the prime sieve? As I mentioned, I think one
can avoid the mutable array, because if there is only a small number of
array updates with much changes per update, it should be efficient enough
to copy the array per update.

More information about the Haskell-Cafe mailing list