diff --git a/filesystem-trees.cabal b/filesystem-trees.cabal
--- a/filesystem-trees.cabal
+++ b/filesystem-trees.cabal
@@ -1,5 +1,5 @@
 Name: filesystem-trees
-Version: 0.1.0.5
+Version: 0.1.0.6
 Synopsis: Recursively manipulate and traverse filesystems as lazy rose trees.
 Cabal-Version: >= 1.10
 License: BSD3
@@ -20,7 +20,7 @@
                  , directory >= 1.1 && < 1.3
                  , filepath >= 1.0 && < 2.0 
                  , containers >= 0.1 && < 0.6
-                 , data-lens >= 2.0.1 && < 3.0
+                 , data-lens-light >= 0.1 && < 0.2
                  , dlist >= 0.2 && < 1.0
                  , mtl >= 1.0 && < 3.0
                  , cond >= 0.3 && < 0.5
diff --git a/src/System/File/Tree.hs b/src/System/File/Tree.hs
--- a/src/System/File/Tree.hs
+++ b/src/System/File/Tree.hs
@@ -53,7 +53,7 @@
 
 import Data.Tree (Tree(..), Forest)
 import qualified Data.Tree as Tree (flatten, levels)
-import Data.DList as DL (DList(..), cons, append, toList, empty, concat, snoc)
+import Data.DList as DL (DList, cons, append, toList, empty, concat, snoc)
 
 import Control.Exception (throwIO, catch, IOException)
 import System.IO.Error (ioeGetErrorType, doesNotExistErrorType)
@@ -64,7 +64,7 @@
 import Data.Foldable (foldrM)
 import qualified Data.Traversable as T (mapM)
 import Data.Maybe (mapMaybe, catMaybes)
-import Data.Lens.Common (Lens, lens, getL, setL, modL)
+import Data.Lens.Light (Lens, lens, getL, setL, modL)
 import Control.DeepSeq (NFData(..), deepseq)
 import Control.Conditional (ifM, (<&&>), (<||>), notM, condM, otherwiseM)