diff --git a/filesystem-trees.cabal b/filesystem-trees.cabal
--- a/filesystem-trees.cabal
+++ b/filesystem-trees.cabal
@@ -1,11 +1,12 @@
 Name: filesystem-trees
-Version: 0.1.0.2
+Version: 0.1.0.3
 Synopsis: Recursively manipulate and traverse filesystems as lazy rose trees.
 Cabal-Version: >= 1.10
 License: BSD3
 License-File: LICENSE
 Author: Adam Curtis
 Maintainer: acurtis@spsu.edu
+Homepage: https://github.com/kallisti-dev/filesystem-trees
 Build-Type: Simple
 Category: System, Data
 
@@ -16,7 +17,7 @@
   if impl(ghc >= 7.2) 
     default-extensions: Trustworthy
   build-depends:   base == 4.*
-                 , directory >= 1.1 && < 1.2
+                 , directory >= 1.1 && < 1.3
                  , filepath >= 1.0 && < 2.0 
                  , unix >= 2.0 && < 3.0
                  , containers >= 0.1 && < 0.6
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
@@ -62,7 +62,6 @@
 import Data.Foldable (foldrM)
 import qualified Data.Traversable as T (mapM)
 import Data.Maybe (mapMaybe, catMaybes)
-import Data.Function (on)
 import Data.Lens.Common (Lens, lens, getL, setL, modL)
 import Control.DeepSeq (NFData(..), deepseq)
 import Control.Conditional (ifM, (<&&>), (<||>), notM, condM, otherwiseM)