diff --git a/IntervalMap.cabal b/IntervalMap.cabal
--- a/IntervalMap.cabal
+++ b/IntervalMap.cabal
@@ -1,5 +1,5 @@
 Name:                IntervalMap
-Version:             0.3.0.2
+Version:             0.3.0.3
 Stability:           experimental
 Synopsis:            Maps from Intervals to values, with efficient search.
 Homepage:            http://www.chr-breitkopf.de/comp/IntervalMap
@@ -8,18 +8,18 @@
 Author:              Christoph Breitkopf
 Maintainer:          Christoph Breitkopf <chbreitkopf@gmail.com>
 bug-reports:         mailto:chbreitkopf@gmail.com
-Copyright:           Copyright 2011 Christoph Breitkopf
+Copyright:           2011-2014 Christoph Breitkopf
 Category:            Data
 Build-type:          Simple
 Cabal-version:       >= 1.8
-Tested-With:         GHC==7.6.3, GHC==7.4.2, GHC==7.0.4, GHC==6.12.1
+Tested-With:         GHC==7.8.3, GHC==7.6.3, GHC==7.4.2, GHC==7.0.4, GHC==6.12.1
 Description:
                      A map from intervals to values, with efficient search
                      for all keys containing a point or overlapping an interval.
                      See the example code on the home page for a quick introduction.
 
 extra-source-files:
-  README
+  README.md
   test/*.hs
   examples/*.lhs
 
@@ -52,7 +52,7 @@
   main-is:            BenchAll.hs
   Build-depends:      base >= 4 && < 5,
                       containers, random, deepseq,
-                      criterion >= 0.6
+                      criterion >= 1.0
   ghc-options: -Wall
 
 source-repository head
diff --git a/LICENSE b/LICENSE
--- a/LICENSE
+++ b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (c)2011, Christoph Breitkopf
+Copyright (c) 2011-2014, Christoph Breitkopf
 
 All rights reserved.
 
diff --git a/README b/README
deleted file mode 100644
--- a/README
+++ /dev/null
@@ -1,18 +0,0 @@
-Maps with intervals as keys offering efficient search.
-
-Home page:
-http://www.chr-breitkopf.de/comp/haskell/index.html#IntervalMap
-
-
-Install from hackage with cabal install.
-
-To run the tests, do extract the archive, and do
-
-$ cabal configure --enable-tests
-$ cabal build
-$ cabal test
-
---
-Christoph Breitkopf <chbreitkopf@gmail.com>
-Last edit: 2011-12-09
-
diff --git a/README.md b/README.md
new file mode 100644
--- /dev/null
+++ b/README.md
@@ -0,0 +1,20 @@
+# IntervalMap
+
+Maps with intervals as keys offering efficient search.
+
+Home page and documentation: [http://www.chr-breitkopf.de/comp/IntervalMap/index.html](http://www.chr-breitkopf.de/comp/IntervalMap/index.html)
+
+
+Install from hackage with cabal install.
+
+To run the tests, do extract the archive, and do
+
+    $ cabal configure --enable-tests
+    $ cabal build
+    $ cabal test
+
+-------
+
+Christoph Breitkopf <chbreitkopf@gmail.com>
+
+Last edit: 2014-07-30
diff --git a/bench/BenchAll.hs b/bench/BenchAll.hs
--- a/bench/BenchAll.hs
+++ b/bench/BenchAll.hs
@@ -1,5 +1,5 @@
 import Criterion.Main
-import Criterion.Config
+import Criterion.Types (Config(..))
 
 import Control.DeepSeq
 import Prelude hiding (lookup, max, foldr)
@@ -40,7 +40,7 @@
 
 -- always write a report to bench-all.html.
 benchConfig :: Config
-benchConfig =  defaultConfig { cfgReport = ljust "bench-all.html" }
+benchConfig =  defaultConfig { reportFile = Just "bench-all.html" }
 
 cDATA_SIZE :: Int
 cDATA_SIZE =  10000
@@ -59,7 +59,7 @@
       dMapSmall <- ensure $ D.fromList [(ClosedInterval lo hi, lo) | (lo,hi) <- ivs2]
       dIvMapSmall <- ensure $ M.fromList [(ClosedInterval lo hi, lo) | (lo,hi) <- ivs2]
       rndInts <- ensure (genRandomInts 1 cDATA_SIZE cDATA_SIZE)
-      defaultMainWith benchConfig (return ()) [
+      defaultMainWith benchConfig [
          bgroup "fromList (insert)" [
            bench "Data.Map"        $ nf D.fromList ivsP,
            bench "IntervalMap"     $ nf M.fromList ivsP