diff --git a/Data/Vector/Mutable/Dynamic.hs b/Data/Vector/Mutable/Dynamic.hs
--- a/Data/Vector/Mutable/Dynamic.hs
+++ b/Data/Vector/Mutable/Dynamic.hs
@@ -96,8 +96,8 @@
 -- | Check whether the vector is empty.
 null :: PrimMonad m => MVector (PrimState m) a -> m Bool
 null (MVector v) = do
-    MVectorData s _ <- readMutVar v
-    return (s == 0)
+  MVectorData s _ <- readMutVar v
+  return (s == 0)
 {-# INLINABLE null #-}
 
 -- | Create a new vector of given length. The elements are uninitialized and throw error upon accessing.
@@ -200,7 +200,7 @@
     v1 <- readMutVar v1
     v2 <- readMutVar v2
     MV.move (_data v1) (_data v2)
-{-# INLINABLE move#-}
+{-# INLINABLE move #-}
 
 -- | Move the contents of the right vector to the left one. The vectors must have the same length and may overlap.
 -- Input lengths are unchecked.  
@@ -264,7 +264,8 @@
         MV.unsafeWrite v' s a
         writeMutVar v (MVectorData (s + 1) v')
 {-# INLINABLE pushBack #-}
-      
+
+
 -- | Read the back value and remove it from the vector. Throws an error if the vector is empty. 
 popBack :: PrimMonad m => MVector (PrimState m) a -> m a 
 popBack (MVector v) = do
diff --git a/dynamic-mvector.cabal b/dynamic-mvector.cabal
--- a/dynamic-mvector.cabal
+++ b/dynamic-mvector.cabal
@@ -1,6 +1,6 @@
 
 name:                dynamic-mvector
-version:             0.1.0.2
+version:             0.1.0.3
 synopsis:            A wrapper around MVector that enables pushing, popping and extending.     
 homepage:            https://github.com/AndrasKovacs/dynamic-mvector
 license:             BSD3
@@ -13,5 +13,5 @@
 
 library
   exposed-modules:     Data.Vector.Mutable.Dynamic
-  build-depends:       base >=4.7 && <4.8, primitive >=0.5 && <0.6, vector >=0.10 && <0.11
+  build-depends:       base >=4.7 && <4.9, primitive >=0.5 && <0.7, vector >=0.10 && <0.11
   default-language:    Haskell2010