diff --git a/CHANGES b/CHANGES
--- a/CHANGES
+++ b/CHANGES
@@ -1,3 +1,7 @@
+* 0.2.0.7: 16 September 2015
+
+  - Allow semigroups-0.17
+
 * 0.2.0.6: 3 April 2015
 
   - Allow base-4.8
diff --git a/LICENSE b/LICENSE
--- a/LICENSE
+++ b/LICENSE
@@ -1,5 +1,6 @@
 Copyright (c) 2011-2013, dual-tree team:
 
+  Christopher Chalmers <c.chalmers@me.com>
   Jeffrey Rosenbluth <Jeffrey.Rosenbluth@gmail.com>
   Ryan Yates <fryguybob@gmail.com>
   Brent Yorgey <byorgey@gmail.com>
diff --git a/dual-tree.cabal b/dual-tree.cabal
--- a/dual-tree.cabal
+++ b/dual-tree.cabal
@@ -1,5 +1,5 @@
 name:                dual-tree
-version:             0.2.0.6
+version:             0.2.0.7
 synopsis:            Rose trees with cached and accumulating monoidal annotations
 description:         Rose (n-ary) trees with both upwards- (/i.e./
                      cached) and downwards-traveling (/i.e./
@@ -31,7 +31,7 @@
 build-type:          Simple
 cabal-version:       >=1.10
 bug-reports:         https://github.com/diagrams/dual-tree/issues
-
+tested-with:         GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.1
 source-repository head
   type: git
   location: https://github.com/diagrams/dual-tree.git
@@ -41,7 +41,7 @@
   exposed-modules:   Data.Tree.DUAL
                      Data.Tree.DUAL.Internal
   build-depends:     base >= 4.3 && < 4.9,
-                     semigroups >= 0.8 && < 0.17,
+                     semigroups >= 0.8 && < 0.18,
                      newtype >= 0.2 && < 0.3,
                      monoid-extras >= 0.2 && < 0.5
   hs-source-dirs:    src