Proposal: reduce base from the top

[Ashley Yakeley]

Jeffrey Yasskin wrote:
> On 4/3/07, Simon Marlow <simonmarhaskell at gmail.com> wrote:
>> Control.Applicative
>> Data.Foldable, Data.Traversable
>> Data.Map, Data.IntMap, Data.Set, Data.IntSet
>> Data.Sequence, Data.Tree
>> Data.HashTable
>> Data.Graph
>> ---> new package collections? containers?  or split further?
>>       (dep. on array, generics, concurrent)
> 
> Applicative seems more related to Functor, Monad, and Arrow than to
> the collections. Even its haddock page mentions parsers before
> Traversable. I think Control.Applicative should stay in base or follow
> Control.Arrow if that moves somewhere else.

Agreed, and I think Foldable and Traversable too. Also, Monad should one 
day be a subclass of Applicative, IMO:
<http://hackage.haskell.org/trac/haskell-prime/ticket/113>.

The rest are collections or containers.

-- 
Ashley Yakeley