diff --git a/CHANGELOG.markdown b/CHANGELOG.markdown
--- a/CHANGELOG.markdown
+++ b/CHANGELOG.markdown
@@ -1,3 +1,7 @@
+1.9.0.1
+-----
+* Fixed a broken build
+
 1.9
 ---
 * Added `MonadZip` instances.
diff --git a/linear.cabal b/linear.cabal
--- a/linear.cabal
+++ b/linear.cabal
@@ -1,6 +1,6 @@
 name:          linear
 category:      Math, Algebra
-version:       1.9
+version:       1.9.0.1
 license:       BSD3
 cabal-version: >= 1.8
 license-file:  LICENSE
diff --git a/src/Linear/Affine.hs b/src/Linear/Affine.hs
--- a/src/Linear/Affine.hs
+++ b/src/Linear/Affine.hs
@@ -1,6 +1,7 @@
 {-# LANGUAGE CPP #-}
 {-# LANGUAGE FlexibleContexts #-}
 {-# LANGUAGE GeneralizedNewtypeDeriving #-}
+{-# LANGUAGE DeriveTraversable #-}
 {-# LANGUAGE TypeFamilies #-}
 #if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702
 {-# LANGUAGE Trustworthy #-}
@@ -48,6 +49,10 @@
 import Linear.V3
 import Linear.V4
 import Linear.Vector
+
+#ifdef HLINT
+{-# ANN module "HLint: ignore Unused LANGUAGE pragma" #-}
+#endif
 
 -- | An affine space is roughly a vector space in which we have
 -- forgotten or at least pretend to have forgotten the origin.
diff --git a/src/Linear/Quaternion.hs b/src/Linear/Quaternion.hs
--- a/src/Linear/Quaternion.hs
+++ b/src/Linear/Quaternion.hs
@@ -542,6 +542,6 @@
 
 instance MonadFix Quaternion where
   mfix f = Quaternion (let Quaternion a _ = f a in a)
-                      (let Quaternion _ (V3 a _ _) = f a in a)
-                      (let Quaternion _ (V3 _ a _) = f a in a)
-                      (let Quaternion _ (V3 _ _ a) = f a in a)
+                      (V3 (let Quaternion _ (V3 a _ _) = f a in a)
+                          (let Quaternion _ (V3 _ a _) = f a in a)
+                          (let Quaternion _ (V3 _ _ a) = f a in a))
diff --git a/src/Linear/V.hs b/src/Linear/V.hs
--- a/src/Linear/V.hs
+++ b/src/Linear/V.hs
@@ -49,7 +49,7 @@
 import Data.Distributive
 import Data.Foldable as Foldable
 import Data.Functor.Bind
-import Data.Functor.Rep
+import Data.Functor.Rep as Rep
 import Data.Proxy
 import Data.Reflection as R
 import Data.Vector as V
@@ -284,7 +284,7 @@
   mzipWith f (V as) (V bs) = V $ V.zipWith f as bs
 
 instance Dim n => MonadFix (V n) where
-  mfix f = tabulate $ \r -> let a = index (f a) r in a
+  mfix f = tabulate $ \r -> let a = Rep.index (f a) r in a
 
 instance Each (V n a) (V n b) a b where
   each = traverse