News for hackers. Stuff that matters.
Re:Mio: A High-Performance Multicore IO Manager for GHC [pdf] by seanmcdirmid on Monday August 12, 2013 @09:59PM (#6203569)
The ST monad [1] provides an efficient hashtable now; doing hashtables as pure functional data structures is well know to be slow.

I would hope one wouldn't need to resort to STM for a compiler, especially since retry is fairly undefined! Still nothing about iterative computation however, I wonder how the ST monad would deal with a Y combinator?

[1] http://hackage.haskell.org/package/hashtables

There are no comments on this comment yet.