diff --git a/Data/SBV/BitVectors/Bit.hs b/Data/SBV/BitVectors/Bit.hs
--- a/Data/SBV/BitVectors/Bit.hs
+++ b/Data/SBV/BitVectors/Bit.hs
@@ -13,7 +13,7 @@
 module Data.SBV.BitVectors.Bit where
 
 import Data.Bits
-import Control.Parallel.Strategies(NFData(..))
+import Control.DeepSeq(NFData(..))
 
 data Bit = Zero | One
          deriving (Eq, Ord)
diff --git a/Data/SBV/BitVectors/Data.hs b/Data/SBV/BitVectors/Data.hs
--- a/Data/SBV/BitVectors/Data.hs
+++ b/Data/SBV/BitVectors/Data.hs
@@ -34,7 +34,7 @@
  ) where
 
 import Control.Monad.Reader
-import Control.Parallel.Strategies(NFData(..))
+import Control.DeepSeq(NFData(..))
 import Data.Bits
 import Data.Int
 import Data.Word
diff --git a/Data/SBV/SMT/SMT.hs b/Data/SBV/SMT/SMT.hs
--- a/Data/SBV/SMT/SMT.hs
+++ b/Data/SBV/SMT/SMT.hs
@@ -15,7 +15,7 @@
 module Data.SBV.SMT.SMT where
 
 import Control.Monad(when, zipWithM)
-import Control.Parallel.Strategies(NFData(..))
+import Control.DeepSeq(NFData(..))
 import Data.Char(isSpace)
 import Data.List(intercalate)
 import Data.Word
diff --git a/Data/SBV/SMT/SMTLib.hs b/Data/SBV/SMT/SMTLib.hs
--- a/Data/SBV/SMT/SMTLib.hs
+++ b/Data/SBV/SMT/SMTLib.hs
@@ -13,7 +13,7 @@
 
 module Data.SBV.SMT.SMTLib(SMTLibPgm, toSMTLib, addNonEqConstraints) where
 
-import Control.Parallel.Strategies(NFData(..))
+import Control.DeepSeq(NFData(..))
 import qualified Data.Foldable    as F
 import Data.List (intercalate)
 
diff --git a/Data/SBV/Utils/TDiff.hs b/Data/SBV/Utils/TDiff.hs
--- a/Data/SBV/Utils/TDiff.hs
+++ b/Data/SBV/Utils/TDiff.hs
@@ -12,7 +12,7 @@
 
 module Data.SBV.Utils.TDiff(timeIf) where
 
-import Control.Parallel.Strategies
+import Control.DeepSeq
 import System.Time
 import Numeric
 
diff --git a/sbv.cabal b/sbv.cabal
--- a/sbv.cabal
+++ b/sbv.cabal
@@ -1,11 +1,12 @@
 Name:          sbv
-Version:       0.9
+Version:       0.9.1
 Category:      Formal Methods, Theorem Provers, Bit vectors, Symbolic Computation, Math
 Synopsis:      Symbolic Bit Vectors: Prove bit-precise program properties using SMT solvers.
 Description:   Adds support for symbolic bit vectors, allowing formal models of bit-precise
                programs to be created. Supports symbolic arrays and polynomials over GF(2^n).
                Aims to provide seamless integration with SMT solvers to produce formal
                property proofs of theoremhood and satisfiability, with counter-examples.
+Copyright:     Levent Erkok, 2011
 License:       BSD3
 License-file:  LICENSE
 Stability:     Experimental
@@ -25,13 +26,13 @@
   ghc-options     : -Wall
   ghc-prof-options: -auto-all -caf-all
   Build-Depends   : base >= 3 && < 5
+                  , deepseq >= 1.1.0.2
                   , process >= 1.0.1
                   , containers >= 0.2.0
                   , QuickCheck >= 2.1.0.3
                   , strict-concurrency >= 0.2.3
                   , haskell98
                   , old-time >= 1.0.0.2
-                  , parallel >= 2.2.0.1
                   , mtl >= 1.1.0.2
                   , array >= 0.2.0.0
                   , HUnit >= 1.2.2.3