diff --git a/composition-tree.cabal b/composition-tree.cabal
--- a/composition-tree.cabal
+++ b/composition-tree.cabal
@@ -1,5 +1,5 @@
 name:                composition-tree
-version:             0.1.0.0
+version:             0.1.0.1
 synopsis:            Composition trees for arbitrary monoids.
 description:         A compositions list or composition tree is a list data type where the elements are monoids, and the mconcat of any contiguous sublist can be computed in logarithmic time. A common use case of this type is in a wiki, version control system, or collaborative editor, where each change or delta would be stored in a list, and it is sometimes necessary to compute the composed delta between any two versions.
 license:             BSD3
@@ -19,7 +19,7 @@
   exposed-modules:     Data.Compositions.Internal
                        Data.Compositions
   other-extensions:    ScopedTypeVariables, DeriveFunctor, GeneralizedNewtypeDeriving
-  build-depends:       base >=4.7 && <4.8
+  build-depends:       base >=4.7 && <4.9
   default-language:    Haskell2010