diff --git a/CHANGELOG.txt b/CHANGELOG.txt
--- a/CHANGELOG.txt
+++ b/CHANGELOG.txt
@@ -1,3 +1,10 @@
+2013-05-10, 0.5.1:
+	Fix cabal build.
+
+	Minor documentation clarification.
+
+	Update binary dependency.
+
 2013-05-09, 0.5:
 	Added the 'lookupPrefix' and 'deleteSuffixes' functions, of which especially
 	the former was an embarrassing omission:
diff --git a/Data/ListTrie/Map.hs b/Data/ListTrie/Map.hs
--- a/Data/ListTrie/Map.hs
+++ b/Data/ListTrie/Map.hs
@@ -1043,8 +1043,7 @@
 -- contains less than two keys, this function will return an empty map.
 --
 -- If the longest common prefix of all keys in the trie is the empty list, this
--- function is equivalent to 'children'. Otherwise, the result will always be a
--- single-element map.
+-- function is equivalent to 'children'.
 --
 -- Examples:
 --
diff --git a/Data/ListTrie/Patricia/Map.hs b/Data/ListTrie/Patricia/Map.hs
--- a/Data/ListTrie/Patricia/Map.hs
+++ b/Data/ListTrie/Patricia/Map.hs
@@ -1061,8 +1061,7 @@
 -- contains less than two keys, this function will return an empty map.
 --
 -- If the longest common prefix of all keys in the trie is the empty list, this
--- function is equivalent to 'children'. Otherwise, the result will always be a
--- single-element map.
+-- function is equivalent to 'children'.
 --
 -- Examples:
 --
diff --git a/Data/ListTrie/Patricia/Set.hs b/Data/ListTrie/Patricia/Set.hs
--- a/Data/ListTrie/Patricia/Set.hs
+++ b/Data/ListTrie/Patricia/Set.hs
@@ -428,8 +428,7 @@
 -- contains less than two keys, this function will return an empty map.
 --
 -- If the longest common prefix of all keys in the trie is the empty list, this
--- function is equivalent to 'children'. Otherwise, the result will always be a
--- single-element map.
+-- function is equivalent to 'children'.
 --
 -- Examples:
 --
diff --git a/Data/ListTrie/Set.hs b/Data/ListTrie/Set.hs
--- a/Data/ListTrie/Set.hs
+++ b/Data/ListTrie/Set.hs
@@ -423,8 +423,7 @@
 -- contains less than two keys, this function will return an empty map.
 --
 -- If the longest common prefix of all keys in the trie is the empty list, this
--- function is equivalent to 'children'. Otherwise, the result will always be a
--- single-element map.
+-- function is equivalent to 'children'.
 --
 -- Examples:
 --
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.5
+Version:     0.5.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
@@ -41,12 +41,10 @@
   default: False
 
 Library
-   Extensions: CPP
-
    Build-Depends: base       >= 3   && < 4.7
                 , containers >= 0.3 && < 0.6
                 , dlist      >= 0.4 && < 0.6
-                , binary     >= 0.5 && < 0.7
+                , binary     >= 0.5 && < 0.8
 
    Exposed-Modules: Data.ListTrie.Base.Map
                     Data.ListTrie.Map
@@ -79,12 +77,11 @@
 
    main-is: Main.hs
    hs-source-dirs: ., tests
-   Extensions: CPP
 
    Build-Depends: base       >= 3   && < 4.7
                 , containers >= 0.3 && < 0.6
                 , dlist      >= 0.4 && < 0.6
-                , binary     >= 0.5 && < 0.7
+                , binary     >= 0.5 && < 0.8
 
    if flag(testing)
      Build-Depends: template-haskell           >= 2.3 && < 2.9