diff --git a/Control/Monad/Reader/Trie.hs b/Control/Monad/Reader/Trie.hs
--- a/Control/Monad/Reader/Trie.hs
+++ b/Control/Monad/Reader/Trie.hs
@@ -28,7 +28,6 @@
 import Data.Functor.Representable.Trie
 import Data.Foldable
 import Data.Key
-import Data.Monoid
 import Data.Traversable
 import Data.Semigroup
 import Data.Semigroup.Foldable
diff --git a/Data/Functor/Representable/Trie.hs b/Data/Functor/Representable/Trie.hs
--- a/Data/Functor/Representable/Trie.hs
+++ b/Data/Functor/Representable/Trie.hs
@@ -44,7 +44,7 @@
 import Data.Functor.Representable.Trie.Either
 import Data.Functor.Representable.Trie.List
 import Data.Key
-import Data.Monoid as Monoid
+import qualified Data.Monoid as Monoid
 import Data.Semigroup.Foldable
 import Data.Semigroup.Traversable
 import Data.Sequence (Seq, (<|))
diff --git a/Data/Functor/Representable/Trie/Bool.hs b/Data/Functor/Representable/Trie/Bool.hs
--- a/Data/Functor/Representable/Trie/Bool.hs
+++ b/Data/Functor/Representable/Trie/Bool.hs
@@ -17,7 +17,6 @@
 import Data.Functor.Representable
 import Data.Functor.Bind
 import Data.Foldable
-import Data.Monoid
 import Data.Traversable
 import Data.Semigroup
 import Data.Semigroup.Foldable
diff --git a/Data/Functor/Representable/Trie/Either.hs b/Data/Functor/Representable/Trie/Either.hs
--- a/Data/Functor/Representable/Trie/Either.hs
+++ b/Data/Functor/Representable/Trie/Either.hs
@@ -21,7 +21,6 @@
 import Data.Functor.Representable
 import Data.Functor.Bind
 import Data.Foldable
-import Data.Monoid
 import Data.Traversable
 import Data.Traversable.Fair
 import Data.Semigroup
diff --git a/Data/Functor/Representable/Trie/List.hs b/Data/Functor/Representable/Trie/List.hs
--- a/Data/Functor/Representable/Trie/List.hs
+++ b/Data/Functor/Representable/Trie/List.hs
@@ -21,7 +21,6 @@
 import Data.Functor.Representable
 import Data.Functor.Bind
 import Data.Foldable
-import Data.Monoid
 import Data.Traversable
 import Data.Semigroup
 import Data.Semigroup.Foldable
diff --git a/Data/Traversable/Fair.hs b/Data/Traversable/Fair.hs
--- a/Data/Traversable/Fair.hs
+++ b/Data/Traversable/Fair.hs
@@ -13,7 +13,6 @@
 import Control.Arrow
 import Data.Key
 import Data.Functor.Apply
-import Data.Monoid
 import Data.Foldable
 import Data.Traversable
 import Data.Semigroup
diff --git a/representable-tries.cabal b/representable-tries.cabal
--- a/representable-tries.cabal
+++ b/representable-tries.cabal
@@ -1,6 +1,6 @@
 name:          representable-tries
 category:      Data Structures, Functors, Monads, Comonads
-version:       2.0.2
+version:       2.0.3
 license:       BSD3
 cabal-version: >= 1.6
 license-file:  LICENSE
@@ -39,7 +39,7 @@
     bifunctors             >= 0.1.1.1 && < 0.2,
     comonad                >= 1.1.1   && < 1.2,
     distributive           >= 0.2     && < 0.3,
-    semigroups             >= 0.7.1   && < 0.8,
+    semigroups             >= 0.8     && < 0.9,
     semigroupoids          >= 1.2.4   && < 1.3,
     keys                   >= 2.1     && < 2.2,
     comonad-transformers   >= 2.0     && < 2.1,