diff --git a/demo/IntsDemo.hs b/demo/IntsDemo.hs
--- a/demo/IntsDemo.hs
+++ b/demo/IntsDemo.hs
@@ -1,4 +1,4 @@
-module IntsDemo where
+module Main where
 
 import           System.Random                 (RandomGen, mkStdGen, randomR)
 
diff --git a/demo/StringsDemo.hs b/demo/StringsDemo.hs
--- a/demo/StringsDemo.hs
+++ b/demo/StringsDemo.hs
@@ -1,4 +1,4 @@
-module StringsDemo where
+module Main where
 
 import           Control.Monad                 (when)
 
diff --git a/perfect-hash-generator.cabal b/perfect-hash-generator.cabal
--- a/perfect-hash-generator.cabal
+++ b/perfect-hash-generator.cabal
@@ -3,7 +3,7 @@
 -- see: https://github.com/sol/hpack
 
 name:           perfect-hash-generator
-version:        0.1.0.1
+version:        0.1.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@.
                 .
diff --git a/test/Test.hs b/test/Test.hs
--- a/test/Test.hs
+++ b/test/Test.hs
@@ -1,3 +1,5 @@
+module Main where
+
 import           Data.Either                    (isRight)
 import           Data.Hashable                  (Hashable)
 import qualified Data.Vector.Unboxed            as Vector