diff --git a/kinds.cabal b/kinds.cabal
--- a/kinds.cabal
+++ b/kinds.cabal
@@ -1,5 +1,5 @@
 Name:          kinds
-Version:       0.0.1.1
+Version:       0.0.1.2
 Cabal-Version: >= 1.2.3
 Build-Type:    Simple
 License:       BSD3
diff --git a/src/Data/Kind.hs b/src/Data/Kind.hs
--- a/src/Data/Kind.hs
+++ b/src/Data/Kind.hs
@@ -4,73 +4,73 @@
     Imagine, we had a language extension for declaring subkinds of kind&#xA0;@*@ where a subkind
     declaration would be written as follows:
 
-    @
-    subkind /K/ = /C_1/ => /t_1/ | ... | /C_n/ => /t_n/
-    @
+@
+subkind /K/ = /C_1/ => /t_1/ | ... | /C_n/ => /t_n/
+@
 
     Thereby, @/K/@&#xA0;would be a kind identifier, the @/t_i/@ would be types and the @/C_i/@ would
     be contexts. This subkind declaration would introduce a subkind&#xA0;@/K/@ that covers all types
     that match one of the&#xA0;@/t_i/@ and fulfill the corresponding context. For example, the
     declaration
 
-    @
-    subkind Map = (Ord key) => Map key val | IntMap val
-    @
+@
+subkind Map = (Ord key) => Map key val | IntMap val
+@
 
     would declare the subkind @Map@ of all types whose values are maps. Note that the subkind @Map@
     would be different from the type @Map@.
 
     We will now see how a subkind declaration
 
-    @
-    subkind /K/ = /C_1/ => /t_1/ | ... | /C_n/ => /t_n/
-    @
+@
+subkind /K/ = /C_1/ => /t_1/ | ... | /C_n/ => /t_n/
+@
 
     can be emulated using this module. First, we declare a type&#xA0;@Kind/K/@ with a nullary data
     constructor of the same name for representing the subkind. Then we add the following instance
     declaration:
 
-    @
-    instance Kind Kind/K/ where
-    &#xA0;
-        data All Kind/K/ item = All/K/ (forall /A_1/. /C_1/ => item /t_1/)
-                                   ...
-                                   (forall /A_n/. /C_n/ => item /t_n/)
-    &#xA0;
-        closed item = All/K/ item ... item
-    @
+@
+instance Kind Kind/K/ where
+&#xA0;
+    data All Kind/K/ item = All/K/ (forall /A_1/. /C_1/ => item /t_1/)
+                               ...
+                               (forall /A_n/. /C_n/ => item /t_n/)
+&#xA0;
+    closed item = All/K/ item ... item
+@
 
     Thereby, each&#xA0;@/A_i/@ stands for a whitespace-separated sequence of the free variables
     of&#xA0;@/t_i/@. Finally, we add the following instance declaration for every&#xA0;@/i/@ between
     @1@&#xA0;and&#xA0;@/n/@:
 
-    @
-    instance /C_i/ => Inhabitant Kind/K/ /t_i/ where
-    &#xA0;
-        specialize (All/K/ _ ... _ item _ ... _) = item
-    @
+@
+instance /C_i/ => Inhabitant Kind/K/ /t_i/ where
+&#xA0;
+    specialize (All/K/ _ ... _ item _ ... _) = item
+@
 
     Thereby, the number of wildcard patterns before and after @item@ is @/i/ - 1@ and @/n/ - /i/@,
     respectively. The above subkind declaration for @Map@ can be emulated with the following code:
 
-    @
-    data KindMap = KindMap
-    &#xA0;
-    instance Kind KindMap where
-    &#xA0;
-        data All KindMap item = AllMap (forall key val. (Ord key) => item (Map key val))
-                                       (forall val.                  item (IntMap val))
-    &#xA0;
-        closed item = AllMap item item
-    &#xA0;
-    instance (Ord key) => Inhabitant KindMap (Map key val) where
-    &#xA0;
-        specialize (AllMap item _) = item
-    &#xA0;
-    instance Inhabitant KindMap (IntMap val) where
-    &#xA0;
-        specialize (AllMap _ item) = item
-    @
+@
+data KindMap = KindMap
+&#xA0;
+instance Kind KindMap where
+&#xA0;
+    data All KindMap item = AllMap (forall key val. (Ord key) => item (Map key val))
+                                   (forall val.                  item (IntMap val))
+&#xA0;
+    closed item = AllMap item item
+&#xA0;
+instance (Ord key) => Inhabitant KindMap (Map key val) where
+&#xA0;
+    specialize (AllMap item _) = item
+&#xA0;
+instance Inhabitant KindMap (IntMap val) where
+&#xA0;
+    specialize (AllMap _ item) = item
+@
 -}
 module Data.Kind (
 
