Proposal: Value strict versions of containers

[Johan Tibell]

On Sat, May 21, 2011 at 7:19 PM, Edward Z. Yang <ezyang at mit.edu> wrote:
> Since there are so many of these functions, I propose we introduce Lazy and
> Strict versions of IntMap.  We should also carefully document operations on the
> IntMap that are strict on all values; for example, filter.  Similar changes
> should be made to Data.Map.

This is exactly what I did in the unordered-containers package [1],
where I have Data.HashMap.Strict and Data.HashMap.Lazy.

1. http://hackage.haskell.org/package/unordered-containers

Johan