Changes between Version 1 and Version 2 of SplitBase
 Timestamp:
 Feb 13, 2013 6:18:33 PM (14 months ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

SplitBase
v1 v2 4 4 5 5 The following is a list of all modules in Base, with a suggested regrouping. Whether this makes sense WRT interdependencies has not yet been verified: 6 7 === purebase === 8 9 One package for all standard ADTs (Bool, [], Maybe...) and other pure definitions that are expected to work even with strange targets. 10 11 Question: Do we want this to include Int and Integer? It is required for, e.g. length, but already includes assumptions about the target. But probably they’d need to go in here as well. 12 13 Question: Any reason to keep Char and String separate? Maybe the requirement on the unicode data? Presumably there are interesting targets that do not need String (embedded devices), but what about functions like `error`? 14 15 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataBool.html Data.Bool] 16 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataEither.html Data.Either] 17 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataEq.html Data.Eq] 18 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFoldable.html Data.Foldable] 19 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFunction.html Data.Function] 20 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFunctor.html Data.Functor] 21 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTraversable.html Data.Traversable] 22 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTuple.html Data.Tuple] 23 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataList.html Data.List] 24 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataMaybe.html Data.Maybe] 25 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataMonoid.html Data.Monoid] 26 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataOrd.html Data.Ord] 27 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataRatio.html Data.Ratio] 28 6 29 7 30 === Unsorted === … … 30 53 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/ControlMonad.Zip.html Control.Monad.Zip] 31 54 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataBits.html Data.Bits] 32 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataBool.html Data.Bool]33 55 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataChar.html Data.Char] 34 56 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataComplex.html Data.Complex] 35 57 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataData.html Data.Data] 36 58 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataDynamic.html Data.Dynamic] 37 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataEither.html Data.Either]38 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataEq.html Data.Eq]39 59 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFixed.html Data.Fixed] 40 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFoldable.html Data.Foldable]41 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFunction.html Data.Function]42 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataFunctor.html Data.Functor]43 60 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataHashTable.html Data.HashTable] 44 61 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataInt.html Data.Int] 45 62 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataIORef.html Data.IORef] 46 63 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataIx.html Data.Ix] 47 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataList.html Data.List]48 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataMaybe.html Data.Maybe]49 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataMonoid.html Data.Monoid]50 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataOrd.html Data.Ord]51 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataRatio.html Data.Ratio]52 64 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataSTRef.html Data.STRef] 53 65 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataSTRef.Lazy.html Data.STRef.Lazy] 54 66 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataSTRef.Strict.html Data.STRef.Strict] 55 67 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataString.html Data.String] 56 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTraversable.html Data.Traversable]57 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTuple.html Data.Tuple]58 68 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTypeable.html Data.Typeable] 59 69 * [http://hackage.haskell.org/packages/archive/base/4.6.0.1/doc/html/DataTypeable.Internal.html Data.Typeable.Internal]