diff --git a/persistent-vector.cabal b/persistent-vector.cabal
--- a/persistent-vector.cabal
+++ b/persistent-vector.cabal
@@ -1,5 +1,5 @@
 name: persistent-vector
-version: 0.1.0.3
+version: 0.1.1
 synopsis: A persistent sequence based on array mapped tries
 license: BSD3
 license-file: LICENSE
diff --git a/src/Data/Vector/Persistent.hs b/src/Data/Vector/Persistent.hs
--- a/src/Data/Vector/Persistent.hs
+++ b/src/Data/Vector/Persistent.hs
@@ -244,11 +244,11 @@
 pvTraverse :: (Ap.Applicative f) => (a -> f b) -> Vector a -> f (Vector b)
 pvTraverse f = go
   where
-    go EmptyVector = pure EmptyVector
-    go (DataNode a) = DataNode <$> A.traverseArray f a
-    go (InternalNode as) = InternalNode <$> A.traverseArray go as
+    go EmptyVector = Ap.pure EmptyVector
+    go (DataNode a) = DataNode Ap.<$> A.traverseArray f a
+    go (InternalNode as) = InternalNode Ap.<$> A.traverseArray go as
     go (RootNode sz sh off cap t as) =
-      RootNode sz sh off cap <$> T.traverse f t <*> A.traverseArray go as
+      RootNode sz sh off cap Ap.<$> T.traverse f t Ap.<*> A.traverseArray go as
 
 {-# INLINABLE append #-}
 append :: Vector a -> Vector a -> Vector a