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
@@ -30,6 +30,7 @@
 import Data.Key
 import Data.Monoid
 import Data.Traversable
+import Data.Semigroup
 import Data.Semigroup.Foldable
 import Data.Semigroup.Traversable
 import Prelude hiding (lookup,zipWith)
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
@@ -31,6 +31,7 @@
 import Control.Monad.Representable.Reader
 import Data.Bits
 import Data.Distributive
+import Data.Semigroup
 import Data.Word
 import Data.Int
 import Data.Foldable
diff --git a/Data/Traversable/Fair.hs b/Data/Traversable/Fair.hs
--- a/Data/Traversable/Fair.hs
+++ b/Data/Traversable/Fair.hs
@@ -14,6 +14,11 @@
 import Data.Key
 import Data.Functor.Apply
 import Data.Monoid
+import Data.Foldable
+import Data.Traversable
+import Data.Semigroup
+import Data.Semigroup.Foldable
+import Data.Semigroup.Traversable
 import Data.List.NonEmpty as NonEmpty hiding (toList)
 
 refill :: Traversable t => t a -> [b] -> t b
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.1.2
+version:       2.0.2
 license:       BSD3
 cabal-version: >= 1.6
 license-file:  LICENSE
@@ -41,9 +41,9 @@
     distributive           >= 0.2     && < 0.3,
     semigroups             >= 0.7.1   && < 0.8,
     semigroupoids          >= 1.2.4   && < 1.3,
-    keys                   >= 2.0     && < 2.1,
+    keys                   >= 2.1     && < 2.2,
     comonad-transformers   >= 2.0     && < 2.1,
-    adjunctions            >= 2.0.1.1 && < 2.1,
+    adjunctions            >= 2.0.2   && < 2.1,
     representable-functors >= 2.0     && < 2.1
 
   exposed-modules: