diff --git a/CHANGES b/CHANGES
--- a/CHANGES
+++ b/CHANGES
@@ -1,3 +1,7 @@
+* 0.2.0.2: 10 April 2014
+
+  - Allow semigroups-0.13
+
 * 0.2.0.1: 27 November 2013
 
   - Allow semigroups-0.12
diff --git a/dual-tree.cabal b/dual-tree.cabal
--- a/dual-tree.cabal
+++ b/dual-tree.cabal
@@ -1,11 +1,11 @@
 name:                dual-tree
-version:             0.2.0.1
+version:             0.2.0.2
 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./
                      accumulating) monoidal annotations.  This is used
-                     as the core data structure underlying the
-                     @diagrams@ framework
+                     as the core data structure underlying
+                     the @diagrams@ framework
                      (<http://projects.haskell.org/diagrams>), but
                      potentially has other applications as well.
 		     .
@@ -41,7 +41,7 @@
   exposed-modules:   Data.Tree.DUAL
                      Data.Tree.DUAL.Internal
   build-depends:     base >= 4.3 && < 4.8,
-                     semigroups >= 0.8 && < 0.13,
+                     semigroups >= 0.8 && < 0.14,
                      newtype >= 0.2 && < 0.3,
                      monoid-extras >= 0.2 && < 0.4
   hs-source-dirs:    src