diff --git a/Data/Traversable/Fair.hs b/Data/Traversable/Fair.hs
--- a/Data/Traversable/Fair.hs
+++ b/Data/Traversable/Fair.hs
@@ -14,7 +14,7 @@
 import Data.Key
 import Data.Functor.Apply
 import Data.Monoid
-import Data.Stream.NonEmpty as NonEmpty hiding (toList)
+import Data.List.NonEmpty as NonEmpty hiding (toList)
 
 refill :: Traversable t => t a -> [b] -> t b
 refill t l = snd (mapAccumL (\xs _ -> (Prelude.tail xs, Prelude.head xs)) l t)
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:       0.3.2
+version:       0.3.4
 license:       BSD3
 cabal-version: >= 1.6
 license-file:  LICENSE
@@ -19,19 +19,19 @@
 
 library
   build-depends: 
-    adjunctions >= 0.9.1 && < 0.10,
+    adjunctions >= 0.9.2 && < 0.10,
     base >= 4 && < 4.4,
     bifunctors >= 0.1 && < 0.2,
-    comonad >= 1.0.3 && < 1.1,
-    comonad-transformers >= 1.5.3 && < 1.6,
+    comonad >= 1.1 && < 1.2,
+    comonad-transformers >= 1.6.2 && < 1.7.0,
     containers >= 0.3 && < 0.5,
     distributive >= 0.2 && < 0.3,
-    keys >= 0.2.4 && < 0.3,
+    keys >= 0.2.5 && < 0.3,
     mtl >= 2.0.1.0 && < 2.1,
     representable-functors >= 0.4.1 && < 0.5,
-    semigroups >= 0.4 && < 0.5,
-    semigroupoids >= 1.1.3 && < 1.2.0,
-    streams >= 0.6.3 && < 0.7,
+    semigroups >= 0.5 && < 0.6,
+    semigroupoids >= 1.2.1 && < 1.3.0,
+    streams >= 0.7 && < 0.8,
     transformers >= 0.2.0 && < 0.3
 
   exposed-modules: