|
|
|
|
|
|
by seanmcdirmid
4691 days ago
|
|
|
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 |
|
|