diff --git a/ListTree.cabal b/ListTree.cabal
--- a/ListTree.cabal
+++ b/ListTree.cabal
@@ -1,5 +1,5 @@
 Name:                ListTree
-Version:             0.2.2
+Version:             0.2.3
 Category:            Algorithms
 Synopsis:            Trees and monadic trees expressed as monadic lists where the underlying monad is a list
 Description:
@@ -17,8 +17,7 @@
 Library
   hs-Source-Dirs:      src
   Extensions:
-  Build-Depends:       base >= 3 && < 5, directory >= 1.0 && < 2.0, filepath >= 1.1 && < 2.0, transformers >= 0.2, List >= 0.4.0 && < 0.6.0
+  Build-Depends:       base >= 3 && < 5, directory >= 1.0 && < 2.0, filepath >= 1.1 && < 2.0, transformers >= 0.2, List >= 0.4.0
   Exposed-modules:     Data.List.Tree
                        System.Directory.ListTree
   Ghc-Options:         -O2 -Wall
-
diff --git a/src/Data/List/Tree.hs b/src/Data/List/Tree.hs
--- a/src/Data/List/Tree.hs
+++ b/src/Data/List/Tree.hs
@@ -7,7 +7,7 @@
 -- which can also be seen as a tree, except only its leafs
 -- are accessible and only in "dfs order".
 --
--- > import Control.Monad.Trans.List.Funcs (repeatM)
+-- > import Control.Monad.ListT.Funcs (repeatM)
 -- > import Data.List.Class (genericTake, scanl, takeWhile, toList, lastL)
 -- > import Prelude hiding (scanl, takeWhile)
 -- >