containers: to be or not to be (strict, in this case)?

[John Meacham]

One can always turn a strict data structure into a non-strict one by
introducing lazyness explicitly like

data Box a = Box a
        deriving(Eq,Ord,..)

then having Set (Box Int) for a set of lazy ints. It might make sense to
make the strict implementation the default and emulate the lazy one with
boxes like above. It would give us both with very little code
duplication.

        John

-- 
John Meacham - ⑆repetae.net⑆john⑈