diff --git a/Data/Foldable/Constrained.hs b/Data/Foldable/Constrained.hs
--- a/Data/Foldable/Constrained.hs
+++ b/Data/Foldable/Constrained.hs
@@ -36,6 +36,7 @@
    , Foldable(..)
    )
 import Data.Monoid
+import qualified Data.List as List
 
 import qualified Control.Category.Hask as Hask
 import qualified Data.Foldable as Hask
@@ -105,7 +106,7 @@
 instance Foldable [] (->) (->) where
   foldMap _ [] = mempty
   foldMap f (x:xs) = f x <> foldMap f xs
-  ffoldl f = uncurry $ Hask.foldl (curry f)
+  ffoldl f = uncurry $ List.foldl (curry f)
 
 instance Foldable Maybe (->) (->) where
   foldMap f Nothing = mempty
diff --git a/constrained-categories.cabal b/constrained-categories.cabal
--- a/constrained-categories.cabal
+++ b/constrained-categories.cabal
@@ -1,5 +1,5 @@
 Name:                constrained-categories
-Version:             0.2.1.0
+Version:             0.2.1.1
 Category:            control
 Synopsis:            Constrained clones of the category-theory type classes, using ConstraintKinds.
 Description:         Haskell has, and makes great use of, powerful facilities from category