At this year's Haskell Implementors Workshop I gave talk about performance improvements to the unordered-containers package. I've talked about this package before. New since last time I gave this talk are performance numbers from the hash array mapped trie data implementation I've been working on. Here are the slides:
(You can also download the slides as a PDF.)
