diff --git a/Data/BinaryList.hs b/Data/BinaryList.hs
--- a/Data/BinaryList.hs
+++ b/Data/BinaryList.hs
@@ -44,7 +44,6 @@
   , generateM
     -- * Queries
   , lengthExponent
-  , length
   , lookup
   , head
   , last
@@ -75,19 +74,18 @@
     -- $fft
   ) where
 
-import Prelude hiding ( length,lookup,replicate,head,last
-                      , zip,unzip,zipWith,reverse,foldr1
-                      , take,map,foldr )
-import qualified Prelude
+import Prelude hiding
+  ( map, head, last
+  , reverse, replicate
+  , take, lookup
+  , zip, unzip, zipWith
+    )
+import Data.Foldable (fold,toList)
 import Foreign.Storable (sizeOf)
 import Data.List (find)
 import Data.BinaryList.Internal
-import Control.Applicative (Applicative (..),(<$>))
 import Control.Applicative.Backwards
 import Control.Arrow ((***))
-import Data.Monoid (mappend)
-import Data.Foldable (Foldable (..),toList)
-import Data.Traversable (Traversable (..))
 import Control.Monad.Trans.State
   ( StateT (..)
   , evalStateT ,evalState
@@ -113,10 +111,6 @@
 lengthExponent (ListNode n _ _) = n
 lengthExponent (ListEnd _) = 0
 
--- | /O(1)/. Number of elements in the list.
-length :: BinList a -> Int
-length = (2^) . lengthExponent
-
 {-# RULES
        "Data.BinaryList: length equality"
          forall xs ys . length xs == length ys = lengthExponent xs == lengthExponent ys
@@ -547,6 +541,7 @@
   fold = foldr1 mappend
   foldl1 = foldr1
   foldMap f = fold . fmap f
+  length = (2^) . lengthExponent
 
 instance Traversable BinList where
   sequenceA (ListEnd f) = ListEnd <$> f
diff --git a/binary-list.cabal b/binary-list.cabal
--- a/binary-list.cabal
+++ b/binary-list.cabal
@@ -1,5 +1,5 @@
 name:                binary-list
-version:             1.0.1.0
+version:             1.1.0.0
 synopsis:            Lists of length a power of two.
 description:         Implementation of lists whose number of elements is a
                      power of two. Binary lists have this property by definition,
@@ -16,6 +16,9 @@
                      .
                      The package contains an additional module with utilities for
                      the (de)serialization of binary lists.
+                     .
+                     /Warning: to use this version, you need at least GHC-7.10. I will submit/
+                     /a new version with backwards compatibility very soon. Stay tuned!/
 license:             BSD3
 license-file:        LICENSE
 author:              Daniel Díaz
@@ -23,7 +26,7 @@
 bug-reports:         https://github.com/Daniel-Diaz/binary-list/issues
 category:            Data
 build-type:          Simple
-cabal-version:       >=1.10
+cabal-version:       >= 1.10
 
 library
   exposed-modules:     Data.BinaryList, Data.BinaryList.Serialize