typos

Author: dlesbre

README.md

@@ -1,6 +1,6 @@
 # Patricia Tree
 
-[![Latest version](https://img.shields.io/badge/version-0.10.0-yellow)](https://github.com/codex-semantics-library/patricia-tree/releases)
+[![Latest version](https://img.shields.io/badge/version-0.11.0-yellow)](https://github.com/codex-semantics-library/patricia-tree/releases)
 [![OCaml Version](https://img.shields.io/badge/OCaml-4.14_--_5.2-blue?logo=ocaml&logoColor=white)](https://github.com/codex-semantics-library/patricia-tree/blob/main/dune-project)
 [![GitHub License](https://img.shields.io/github/license/codex-semantics-library/patricia-tree)](https://github.com/codex-semantics-library/patricia-tree/blob/main/LICENSE)
 [![GitHub Actions Workflow Status](https://img.shields.io/github/actions/workflow/status/codex-semantics-library/patricia-tree/ocaml.yml)](https://github.com/codex-semantics-library/patricia-tree/actions/workflows/ocaml.yml)

src/index.mld

@@ -85,7 +85,7 @@ See the {{!examples}examples} to jump right into using this library.
   be extended to store size information in nodes if needed.}
 {li Exposes a common interface ({!type:PatriciaTree.NODE.view}) to allow users to write their own pattern
   matching on the tree structure without depending on the {{!PatriciaTree.NODE}[NODE]} being used.}
-{li Additionally, hashconsed versions of heterogeneous/homogeneous maps/sets are
+{li Additionally, hash-consed versions of heterogeneous/homogeneous maps/sets are
   available. These provide constant time equality and comparison, and ensure
   maps/set with the same constants are always physically equal. It comes at the cost
   of a constant overhead in memory usage (at worst, as hash-consing may allow
@@ -210,7 +210,7 @@ Here is a small example of a non-generic map:
     let to_int x = x (* to_int must be injective and fast *)
   end
   ]}}
-{li Use it to instanciate the map/set functors:
+{li Use it to instantiate the map/set functors:
   {[
   module IMap : PatriciaTree.MAP with type key = int
               = PatriciaTree.MakeMap(IntKey)
@@ -353,7 +353,7 @@ liberty of having a generic type as a key.
     Note the full polymorphic equality, that returns a GADT term {!PatriciaTree.cmp}
     which, when equal ({{!PatriciaTree.Eq}[Eq]}), is a proof of type equality
     between the type parameters.}
-{li We can now instanciate our map functor. Note that in the heterogeneous case,
+{li We can now instantiate our map functor. Note that in the heterogeneous case,
     we must also specify the value type (second functor argument) and how it depends
     on the key type (first parameter) and the map type (second parameter).
     Here the value only depends on the type of the key, not that of the map