diff --git a/comfort-array.cabal b/comfort-array.cabal
--- a/comfort-array.cabal
+++ b/comfort-array.cabal
@@ -1,5 +1,5 @@
 Name:             comfort-array
-Version:          0.5.4.1
+Version:          0.5.4.2
 License:          BSD3
 License-File:     LICENSE
 Author:           Henning Thielemann <haskell@henning-thielemann.de>
@@ -19,7 +19,7 @@
   but the index type is a type function of the shape type.
   This offers much more flexibility and type safety.
   .
-  Some examples are:
+  Some @Shape@ example types are:
   .
   * @Range@:
     Allow dynamic choice of lower and upper array bounds
@@ -57,6 +57,8 @@
   * @Set@: Use an arbitrary ordered set as index set.
   .
   * @Map@: Concatenate a set of shapes.
+    In a higher dimensional array it can be used for block matrices
+    with a dynamic number of blocks but block sizes of the same shape type.
   .
   * @Triangular@:
     A 2D array with the shape of a lower or upper triangular matrix.
@@ -79,7 +81,8 @@
   .
   * Fast Fourier Transforms using the package @comfort-fftw@
   .
-  * Fast Linear Programming using the packages @comfort-glpk@ and @coinor-clp@
+  * Fast Linear Programming using the packages
+    @comfort-glpk@, @coinor-clp@, @highs-lp@
   .
   * Efficient Array Processing via LLVM Just-In-Time code generation
     using the package @knead@.
@@ -97,7 +100,7 @@
   test-module.list
 
 Source-Repository this
-  Tag:         0.5.4.1
+  Tag:         0.5.4.2
   Type:        darcs
   Location:    https://hub.darcs.net/thielema/comfort-array/
 
@@ -164,7 +167,7 @@
   Build-Depends:
     comfort-array,
     doctest-exitcode-stdio >=0.0 && <0.1,
-    doctest-lib >=0.1 && <0.1.1,
+    doctest-lib >=0.1 && <0.1.2,
     ChasingBottoms >=1.2.2 && <1.4,
     tagged,
     containers,