diff --git a/MissingH.cabal b/MissingH.cabal
--- a/MissingH.cabal
+++ b/MissingH.cabal
@@ -1,5 +1,5 @@
 Name: MissingH
-Version: 1.1.0.1
+Version: 1.1.0.2
 License: GPL
 Maintainer: John Goerzen <jgoerzen@complete.org>
 Author: John Goerzen
@@ -70,7 +70,6 @@
 
  Build-Depends: network, parsec, base,
                haskell98, mtl, HUnit, regex-compat,
-               QuickCheck >= 1.0 && < 2.0,
                filepath,
                hslogger
  If flag(splitBase)
diff --git a/src/Data/List/Utils.hs b/src/Data/List/Utils.hs
--- a/src/Data/List/Utils.hs
+++ b/src/Data/List/Utils.hs
@@ -59,7 +59,7 @@
                      -- sub,
                     ) where
 import Data.List(intersperse, concat, isPrefixOf, isSuffixOf, elemIndices,
-                elemIndex, elemIndices, tails, find, findIndex, isInfixOf)
+                elemIndex, elemIndices, tails, find, findIndex, isInfixOf, nub)
 import Control.Monad.State(State, get, put)
 import Data.Maybe(isJust)
 
@@ -473,10 +473,12 @@
 You should not rely on this function necessarily preserving order, though
 the current implementation happens to.
 
-This function is not compatible with infinite lists. -}
+This function is not compatible with infinite lists.
+
+This is presently an alias for Data.List.nub
+ -}
 uniq :: Eq a => [a] -> [a]
-uniq [] = []
-uniq (x:xs) = x : uniq (filter (/= x) xs)
+uniq = nub
 
 ----- same as
 --uniq (x:xs) = x : [y | y <- uniq xs, y /= x]
diff --git a/src/System/Time/ParseDate.hs b/src/System/Time/ParseDate.hs
--- a/src/System/Time/ParseDate.hs
+++ b/src/System/Time/ParseDate.hs