Koen Claessen wrote:
> Take a look at the ST monad, implemented in most
> (all?) Haskell compilers.
>
> Relevant papers are:
>
> "Lazy Functional State Threads"
> John Launchbury & Simon Peyton Jones
>
> "Structuring Depth First Search Algorithms in Haskell"
> David King & John Launchbury
Thank you very much! This is precisely what I have been looking for, it
seems.
I had heard a little about the ST monad before, but thought that it was
just a "prelude definition". Not so, luckily :-)
This leads me to think that it is often too unclear what parts of a
module is implemented in the module file itself, and what parts rely on
support from hugs/ghc (like Array, IO and ST) to do things that cannot
be implemented in the language itself.
Of course, I could just grep for "primitive" :-)
Bjarke
--
IRISA-INRIA, Campus de Beaulieu, 35042 Rennes cedex, France
Home page: http://www.irisa.fr/compose/ebert/
