diff --git a/CHANGELOG.txt b/CHANGELOG.txt
--- a/CHANGELOG.txt
+++ b/CHANGELOG.txt
@@ -1,3 +1,6 @@
+2015-04-03, 0.6.1:
+	Fixed build on base < 4.8.
+
 2015-03-28, 0.6.0:
 	Updated dependencies for GHC 7.10.
 
diff --git a/Data/ListTrie/Base/Map.hs b/Data/ListTrie/Base/Map.hs
--- a/Data/ListTrie/Base/Map.hs
+++ b/Data/ListTrie/Base/Map.hs
@@ -12,18 +12,14 @@
 import Control.Monad       (liftM, liftM2)
 import Data.Foldable       (Foldable(..))
 import Data.Function       (on)
-import Data.List           ( foldl1'
-                           , mapAccumL, nubBy, partition
-                           , sort, sortBy
-                           )
+import Data.List           (foldl1', mapAccumL, nubBy, partition, sort, sortBy)
 import Data.Ord            (comparing)
 import Data.Traversable    (Traversable(..), mapAccumR)
 import qualified Data.IntMap as IM
 import qualified Data.Map    as M
 
-import Prelude hiding ( mapM,sequence
-                      , null,lookup,filter -- for Haddock
-                      , toList
+import Prelude hiding ( filter, foldl, foldl1, foldr, foldr1, lookup, null
+                      , mapM, sequence, toList
                       )
 import qualified Prelude
 
diff --git a/LICENSE.txt b/LICENSE.txt
--- a/LICENSE.txt
+++ b/LICENSE.txt
@@ -2,7 +2,7 @@
 are held by whoever wrote the code in question: see CREDITS.txt for a list of
 authors.
 
-Copyright (c) 2008-2014 <authors>
+Copyright (c) 2008-2015 <authors>
 All rights reserved.
 
 Redistribution and use in source and binary forms, with or without
diff --git a/list-tries.cabal b/list-tries.cabal
--- a/list-tries.cabal
+++ b/list-tries.cabal
@@ -1,7 +1,7 @@
 Cabal-Version: >= 1.6
 
 Name:        list-tries
-Version:     0.6.0
+Version:     0.6.1
 Homepage:    http://iki.fi/matti.niemenmaa/list-tries/
 Synopsis:    Tries and Patricia tries: finite sets and maps for list keys
 Category:    Data, Data Structures