diff --git a/GraphRewriting/Rule.hs b/GraphRewriting/Rule.hs
--- a/GraphRewriting/Rule.hs
+++ b/GraphRewriting/Rule.hs
@@ -122,7 +122,6 @@
 	ms ← amnesia $ matches r
 	exhaustive $ restrictOverlap (\hist future → future ∈ ms) r
 
--- TODO: how lazy is this? can it be done lazier?
 -- | Repeatedly apply the rules from the given list prefering earlier entries.
 -- Returns a list of indexes reporting the sequence of rules that has applied.
 benchmark ∷ [Rule n] → Rewrite n [Int]
diff --git a/graph-rewriting.cabal b/graph-rewriting.cabal
--- a/graph-rewriting.cabal
+++ b/graph-rewriting.cabal
@@ -1,5 +1,5 @@
 Name:           graph-rewriting
-Version:        0.7.1
+Version:        0.7.2
 Copyright:      (c) 2010, Jan Rochel
 License:        BSD3
 License-File:   LICENSE
@@ -16,7 +16,7 @@
 
 Library
   Build-Depends:
-    base >= 4 && < 4.6,
+    base >= 4.3 && < 4.6,
     base-unicode-symbols >= 0.2 && < 0.3,
     mtl >= 1.1 && < 2.1,
     containers >= 0.3 && < 0.5