diff --git a/Math/NumberTheory/Primes/Counting/Impl.hs b/Math/NumberTheory/Primes/Counting/Impl.hs
--- a/Math/NumberTheory/Primes/Counting/Impl.hs
+++ b/Math/NumberTheory/Primes/Counting/Impl.hs
@@ -25,7 +25,7 @@
 import Math.NumberTheory.Logarithms
 
 import Data.Array.Base
-import Data.Array.ST
+import Data.Array.ST    hiding (unsafeThaw)
 import Control.Monad.ST
 import Data.Bits
 import Data.Int
diff --git a/Math/NumberTheory/Primes/Sieve/Eratosthenes.hs b/Math/NumberTheory/Primes/Sieve/Eratosthenes.hs
--- a/Math/NumberTheory/Primes/Sieve/Eratosthenes.hs
+++ b/Math/NumberTheory/Primes/Sieve/Eratosthenes.hs
@@ -35,9 +35,8 @@
 #include "MachDeps.h"
 
 import Control.Monad.ST
-import Data.Array.Base (unsafeRead, unsafeWrite, unsafeAt, unsafeNewArray_)
-import Data.Array.ST
-import Data.Array.Unboxed
+import Data.Array.Base
+import Data.Array.ST        hiding (unsafeFreeze, unsafeThaw, castSTUArray)
 import Control.Monad (when)
 import Data.Bits
 import Data.Word
diff --git a/Math/NumberTheory/Utils.hs b/Math/NumberTheory/Utils.hs
--- a/Math/NumberTheory/Utils.hs
+++ b/Math/NumberTheory/Utils.hs
@@ -155,7 +155,7 @@
 -- | Number of 1-bits in an @'Int'@.
 bitCountInt :: Int -> Int
 #if __GLASGOW_HASKELL__ >= 703
-bitCountWord = popCount
+bitCountInt = popCount
 -- should yield a machine instruction
 #else
 bitCountInt (I# i#) = bitCountWord (W# (int2Word# i#))
diff --git a/arithmoi.cabal b/arithmoi.cabal
--- a/arithmoi.cabal
+++ b/arithmoi.cabal
@@ -1,5 +1,5 @@
 name                : arithmoi
-version             : 0.2.0.0
+version             : 0.2.0.1
 cabal-version       : >= 1.6
 author              : Daniel Fischer
 copyright           : (c) 2011 Daniel Fischer