diff --git a/data-easy.cabal b/data-easy.cabal
--- a/data-easy.cabal
+++ b/data-easy.cabal
@@ -1,5 +1,5 @@
 name:                data-easy
-version:             0.6.1
+version:             0.7.0
 synopsis:            Consistent set of utility functions for Maybe, Either, List and Monoids.
 description:         Easy to use set of utility functions, implementing a Data.Maybe like
                      interface for other common types, like Either, List, Bool, Tuple, 
@@ -35,7 +35,7 @@
   -- other-modules:       
   
   -- Other library packages from which modules are imported.
-  build-depends   : base          >= 4.6 && < 4.9
+  build-depends   : base          >= 4.6 && < 4.11
                   , safe          >= 0.3.3
                   , containers    >= 0.5.0.0
   
diff --git a/src/Data/Easy.hs b/src/Data/Easy.hs
--- a/src/Data/Easy.hs
+++ b/src/Data/Easy.hs
@@ -257,9 +257,7 @@
   , (?&&)
   , (?&&\)
   , allCond
-  , allCond'
   , anyCond
-  , anyCond'
 
   ) where
 
@@ -270,11 +268,6 @@
 -- #else
 -- import Data.Either.Combinators
 -- #endif
-import Control.Applicative
-{-import Data.Tuple-}
-{-import Data.Ord-}
-{-import Data.Function-}
-import Data.Monoid
 import Safe
 import qualified Data.List as L
 import qualified Data.Set as Set
@@ -703,12 +696,12 @@
 --
 -- > nubSort = Set.toAscList . Set.fromList
 --
-nubSort :: (Eq a, Ord a) => [a] -> [a]
+nubSort :: (Ord a) => [a] -> [a]
 nubSort = Set.toAscList . Set.fromList
 
 -- | Sort, nub (remove duplicates) and remove initial empty value, if it
 -- exists. See 'nubSort'.
-nubSort' :: (Eq a, Ord a, Monoid a) => [a] -> [a]
+nubSort' :: (Ord a, Monoid a) => [a] -> [a]
 nubSort' lst = case nubSort lst of
   []     -> []
   (x:xs) -> if isEmpty x then xs else x:xs
@@ -1152,7 +1145,7 @@
 -- to promote values into a monoid
 --
 -- > listToMonoid = headDef mempty
-listToMonoid :: (Eq a, Monoid a) => [a] -> a
+listToMonoid :: (Monoid a) => [a] -> a
 listToMonoid = headDef mempty
 
 -- | monoidToList convert an empty monoid into an empty list,
@@ -1398,12 +1391,6 @@
 allCond _ [] = False
 allCond value lst = and . mapV value $ lst
 
--- | Flipped allCond
---
--- > flip allCond
-allCond' :: [a -> Bool] -> a -> Bool
-allCond' = flip allCond
-
 -- | Apply a list of boolean checks/tests to a variable, and return (True)
 -- if /any/ of them passed.
 --
@@ -1414,11 +1401,3 @@
 anyCond :: a -> [a -> Bool] -> Bool
 anyCond _ [] = False
 anyCond value lst = or . mapV value $ lst
-
--- | Flipped anyCond
---
--- > flip anyCond
-anyCond' :: [a -> Bool] -> a -> Bool
-anyCond' = flip anyCond
-
-