diff --git a/Data/Set/BKTree.hs b/Data/Set/BKTree.hs
--- a/Data/Set/BKTree.hs
+++ b/Data/Set/BKTree.hs
@@ -434,8 +434,8 @@
             = do printf "%-25s :" s
                  result <- quickCheckResult prop
                  case result of
-                   Success _   -> return ()
-                   GaveUp  _ _ -> return ()
-                   _           -> exitFailure
+                   Success _ _ _ -> return ()
+                   GaveUp  _ _ _ -> return ()
+                   _             -> exitFailure
                    
 #endif 
diff --git a/bktrees.cabal b/bktrees.cabal
--- a/bktrees.cabal
+++ b/bktrees.cabal
@@ -1,5 +1,5 @@
 name:		bktrees
-version:	0.3
+version:	0.3.1
 license:	BSD3
 license-file:	LICENSE
 author:		Josef Svenningsson
@@ -12,17 +12,21 @@
 		approximate member search, allowing you to search for 
 		elements that are of a certain distance from the element 
 		you are searching for.
-cabal-version: >=1.2
+cabal-version: >=1.6
 extra-source-files: 	test/Test.hs
 extra-source-files:	README
 build-type:	Simple
 
+source-repository head
+  type:     darcs
+  location: http://patch-tag.com/r/josef/bktrees
+
 flag splitBase
   description: Choose the new smaller, split-up base package.
 
 library
   if flag(splitBase)
-    build-depends: base >= 3, base < 4, containers, array
+    build-depends: base >= 3, base < 5, containers, array
   else
     build-depends: base < 3