More typos

Author: dlesbre

README.md

@@ -282,7 +282,7 @@ These are smaller and closer to OCaml's built-in Map and Set, however:
 - Our library allows using any type `key` that comes with an injective `to_int`
   function, instead of requiring `key = int`.
 - We support generic (heterogeneous) types for keys/elements.
-- We support operation between sets and maps of different types.
+- We support operations between sets and maps of different types.
 - We use a big-endian representation, allowing easy access to min/max elements of
   maps and trees.
 - Our interface and implementation tries to maximize the sharing between different
@@ -298,8 +298,11 @@ Additionally, there is a dependent map library: [dmap](https://gitlab.inria.fr/b
 It allows creating type safe dependent maps similar to our heterogeneous maps.
 However, its maps aren't Patricia trees. They are binary trees build using a
 (polymorphic) comparison function, similarly to the maps of the standard library.
-Another difference is that the type of values in the map is independent from the type of the keys,
-(allowing keys to be associated with different values in different maps).
+
+Another difference is that the type of values in the map is independent of the type of the keys,
+allowing keys to be associated with different values in different maps. i.e.
+we map `'a key` to any `('a, 'b) value` type, whereas dmap only maps `'a key`
+to `'a`.
 
 `dmap` also works with OCaml `>= 4.12`, whereas we require OCaml `>= 4.14`.
 

RELEASE_CHECKLIST.md

@@ -22,7 +22,7 @@ Step-by-step guide to creating and publishing a new release.
    ```bash
    git push origin vX.Y.Z
    ```
-   Check that github-action succeeds (build, tests and documentation).
+   Check that [github-action](https://github.com/codex-semantics-library/patricia-tree/actions) succeeds (build, tests and documentation).
    It should create a new folder `vX.Y.Z` on the `gh-pages` branch.
 
 5. On the `gh-pages` branch, edit `index.html` to add a link to the new version

index.mld

@@ -258,7 +258,8 @@ away as we would like a bit more time using this library before doing so.
 {1 Known issues}
 
 There is a bug in the OCaml typechecker which prevents us from directly
-defining non-generic maps as instances of generic maps. To avoid this, non-generic maps use a separate value type (instead of just using `'b`)
+defining non-generic maps as instances of generic maps. To avoid this, non-generic maps
+use a separate value type (instead of just using ['b])
 {[
 type (_, 'b) snd = Snd of 'b [@@unboxed]
 ]}
@@ -278,7 +279,7 @@ These are smaller and closer to OCaml's built-in [Map] and [Set], however:
 - Our library allows using any type [key] that comes with an injective [to_int]
   function, instead of requiring [key = int].
 - We support generic types for keys/elements.
-- We support operation between sets and maps of different types.
+- We support operations between sets and maps of different types.
 - We use a big-endian representation, allowing easy access to min/max elements of
   maps and trees.
 - Our interface and implementation tries to maximize the sharing between different
@@ -294,8 +295,11 @@ Additionally, there is a dependent map library: {{: https://gitlab.inria.fr/bmon
 It allows creating type safe dependent maps similar to our heterogeneous maps.
 However, its maps aren't Patricia trees. They are binary trees build using a
 (polymorphic) comparison function, similarly to the maps of the standard library.
-Another difference is that the type of values in the map is independent from the type of the keys,
-(allowing keys to be associated with different values in different maps).
+
+Another difference is that the type of values in the map is independent from the
+type of the keys, allowing keys to be associated with different values in different maps.
+i.e. we map ['a key] to any [('a, 'b) value] type, whereas dmap only maps ['a key]
+to ['a].
 
 [dmap] also works with OCaml [>= 4.12], whereas we require OCaml [>= 4.14].