diff --git a/Data/Size.hs b/Data/Size.hs
--- a/Data/Size.hs
+++ b/Data/Size.hs
@@ -3,11 +3,9 @@
 module Data.Size
     ( module Data.Size.Base
     , module Data.Size.Instances
-    , module Data.Monoid
     )
 where
 
-import           Data.Monoid
 import           Data.Size.Base
 import           Data.Size.Instances
 
diff --git a/Data/Size/Base.hs b/Data/Size/Base.hs
--- a/Data/Size/Base.hs
+++ b/Data/Size/Base.hs
@@ -1,8 +1,29 @@
 {-# LANGUAGE BangPatterns #-}
 
 module Data.Size.Base
-    ( module Data.Size.Base
-    , module Data.Monoid
+    ( Size
+    , SizeTable
+    , SizeStatistics
+    , Sizeable(..)
+
+    , bitsPerWord
+    , bytesPerWord
+    , bytesToWords
+    , mksize
+    , dataSize
+    , singletonSize
+
+    , (.*.)
+    , setName
+    , addSize
+    , addPart
+    , mkstats
+    , showstats
+
+    , mempty            -- re-export of Monoid
+    , mappend
+    , mconcat
+    , (<>)
     )
 where
 
@@ -147,17 +168,6 @@
 
     sizeof _  = mksize       1  -- defaults for primitive types
     statsof x = mkstats x "" 1  --     "     "      "       "
-
--- --------------------
-
-nameof' :: Typeable a => a -> String
-nameof' x
-    | m == "GHC.Types" = n
-    | otherwise        = m ++ "." ++ n
-      where
-        t = fst . splitTyConApp . typeOf $ x
-        m = tyConModule t
-        n = tyConName t
 
 -- ------------------------------------------------------------
 
diff --git a/Data/Size/Instances.hs b/Data/Size/Instances.hs
--- a/Data/Size/Instances.hs
+++ b/Data/Size/Instances.hs
@@ -5,7 +5,6 @@
 where
 
 import qualified Data.List            as L
-import           Data.Monoid
 import           Data.Size.Base
 
 import qualified Data.ByteString      as BS
diff --git a/data-size.cabal b/data-size.cabal
--- a/data-size.cabal
+++ b/data-size.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                data-size
-version:             0.1.0.3
+version:             0.1.0.4
 synopsis:            Profiling of data structures
 description:         Profiling of data structures
                      for counting the # of object allocated for a value