diff --git a/perfect-hash-generator.cabal b/perfect-hash-generator.cabal
--- a/perfect-hash-generator.cabal
+++ b/perfect-hash-generator.cabal
@@ -2,10 +2,10 @@
 --
 -- see: https://github.com/sol/hpack
 --
--- hash: 6cef8e50eddca58ff0fc0d93fe7604c3d1cf4f1de43ae0db0b7761fa5a7ed31d
+-- hash: defbbf1d1718cc4bcb4ed6c112f56dfcdb9f82a67a2dcc70b6e55f67a3015865
 
 name:           perfect-hash-generator
-version:        0.2.0.1
+version:        0.2.0.2
 synopsis:       Perfect minimal hashing implementation in native Haskell
 description:     A <https://en.wikipedia.org/wiki/Perfect_hash_function perfect hash function> for a set @S@ is a hash function that maps distinct elements in @S@ to a set of integers, with __no collisions__. A <https://en.wikipedia.org/wiki/Perfect_hash_function#Minimal_perfect_hash_function minimal perfect hash function> is a perfect hash function that maps @n@ keys to @n@ __consecutive__ integers, e.g. the numbers from @0@ to @n-1@.
                 .
@@ -55,7 +55,7 @@
       src
   ghc-options: -fwarn-tabs -W
   build-depends:
-      base >=4.5 && <=4.10
+      base >=4.5 && <5
     , binary
     , bytestring
     , containers
@@ -81,7 +81,7 @@
       test
   ghc-options: -fwarn-tabs -W
   build-depends:
-      base >=4.5 && <=4.10
+      base >=4.5 && <5
     , binary
     , bytestring
     , containers
@@ -106,7 +106,7 @@
       test
   ghc-options: -fwarn-tabs -W
   build-depends:
-      base >=4.5 && <=4.10
+      base >=4.5 && <5
     , binary
     , bytestring
     , hashable
@@ -131,7 +131,7 @@
   ghc-options: -fwarn-tabs -W
   build-depends:
       HUnit
-    , base >=4.5 && <=4.10
+    , base >=4.5 && <5
     , binary
     , bytestring
     , hashable