diff --git a/Setup.hs b/Setup.hs
deleted file mode 100644
--- a/Setup.hs
+++ /dev/null
@@ -1,2 +0,0 @@
-import Distribution.Simple
-main = defaultMain
diff --git a/primes-type.cabal b/primes-type.cabal
--- a/primes-type.cabal
+++ b/primes-type.cabal
@@ -3,7 +3,7 @@
 -- see: https://github.com/sol/hpack
 
 name:           primes-type
-version:        0.2.0.0
+version:        0.2.0.1
 synopsis:       Type-safe prime numbers.
 description:    This library provides type safe prime numbers. The idea is based upon the concept of a predicate type from type theory.
 category:       Algorithms, Numerical
diff --git a/src/Data/Numbers/Primes/Type.hs b/src/Data/Numbers/Primes/Type.hs
--- a/src/Data/Numbers/Primes/Type.hs
+++ b/src/Data/Numbers/Primes/Type.hs
@@ -16,7 +16,7 @@
 
 -- | An abstract type for primes.
 --
---   It will only ever hold a valid prime, together with its zero-based index.
+--   It will only ever hold a valid prime, along with its zero-based index.
 data Prime int = Prime { _value :: !int, _index :: !Int } deriving Show
 
 -- | Given a Prime, give back its value.
@@ -41,7 +41,7 @@
 instance Ord (Prime int) where
     x `compare` y = getIndex x `compare` getIndex y
 
--- | If a given number is prime, give its index.
+-- | If a given number is prime, give back its index.
 primeIndex :: Integral n => n -> Maybe Int
 primeIndex x | isPrime x = elemIndex x primes
              | otherwise = Nothing
@@ -54,6 +54,6 @@
 maybePrime :: (Integral int) => int -> Maybe (Prime int)
 maybePrime x = Prime x <$> primeIndex x
 
--- | A list of indexed primes.
+-- | List of indexed primes.
 indexedPrimes :: Integral int => [Prime int]
 indexedPrimes = getPrime <$> [0,1..]