Fix some typos (#2964)

* Fix a typo in OCaml 5.3's release notes

* Fix occurence -> occurrence

This is probably the number 1 typo in the repo.

Author: bbatsov

data/changelog/merlin/2014-08-23-merlin-2.0.0.md

@@ -12,7 +12,7 @@ changelog: |
   * locate now works on MLI files
   * automatic reloading of .merlin files (when they are update or created), it
     is no longer necessary to restart Merlin
-  * introduced a small refactoring command: rename, who renames all occurences
+  * introduced a small refactoring command: rename, who renames all occurrences
     of an identifier.
 
   This release also contains contributions from: Yotam Barnoy, Jacques-Pascal
@@ -23,7 +23,7 @@ changelog: |
 
 After a few months of development, we are pleased to announce the
 [stable release](https://github.com/ocaml/merlin/blob/v2.0/CHANGELOG) of
-[Merlin 2.0](https://github.com/the-lambda-church/merlin).  
+[Merlin 2.0](https://github.com/the-lambda-church/merlin).
 Supported OCaml versions range from 4.00.1 to 4.02.1.
 
 ### Overview
@@ -41,12 +41,12 @@ available for [Sublime Text](https://github.com/def-lkb/sublime-text-merlin).
 ### What's new
 
 This release provides great improvements in robustness and quality of analysis.
-Files that changed on disk are now automatically reloaded. 
+Files that changed on disk are now automatically reloaded.
 The parsing process is finer grained to provide more accurate recovery and error
 messages.
 Integration with Jane Street Core and js\_of\_ocaml has also improved.
 
-Vim & Emacs are still the main targeted editors. 
+Vim & Emacs are still the main targeted editors.
 Thanks to [Luc Rocher](https://github.com/Cynddl), preliminary support for
 Sublime Text is also available, see
 [Sublime-text-merlin](https://github.com/def-lkb/sublime-text-merlin).

data/changelog/merlin/2021-11-23-merlin-4.4.md

@@ -7,7 +7,7 @@ changelog: |
     - stopped actively supporting version older than 4.12
   + merlin binary
     - Mbrowse.select_leaf: correctly ignore merlin.hide (#1376)
-    - enable `occurences` to work when looking for locally abstract types
+    - enable `occurrences` to work when looking for locally abstract types
       (#1382)
     - handle `-alert` compiler flag (#1401)
     - avoid a race condition when the process started to read a configuration

data/changelog/ocaml/2024-05-13-ocaml-5.2.0.md

@@ -97,7 +97,7 @@ In this October edition, we bring you the latest on the OCaml Platform, continui
 
 **Why:** Project-wide reference as an editor feature is a great way for developers to navigate their codebase and understand it better. It's also a feature that users expect to have coming from other ecosystems, so having support for it in Merlin and OCaml LSP will both improve OCaml editor experience and make it on par with other languages.
 
-**What:** We're adding a new `merlin single occurrences` command and support for the LSP `textDocument/references` request. To do that, we're extending the compiler's Shapes to support global occurences, building a tool that generates an index of identifiers in a codebase and adding support for it in Dune, Merlin, and OCaml LSP.
+**What:** We're adding a new `merlin single occurrences` command and support for the LSP `textDocument/references` request. To do that, we're extending the compiler's Shapes to support global occurrences, building a tool that generates an index of identifiers in a codebase and adding support for it in Dune, Merlin, and OCaml LSP.
 
 **Activities:**
 - We continued working on the compiler PR for project-wide occurrences, notably adding support for inline records' labels. The PR is now ready for the next round of reviews. -- [ocaml/ocaml#12508](https://github.com/ocaml/ocaml/pull/12508)

data/changelog/ocaml/2025-01-08-ocaml-5.3.0.md

@@ -85,7 +85,7 @@ In this November and December edition, we are excited to bring you the latest on
 **Activities:**
 <!--FROM EMILE-->
 - After merging [the PR that added support for search to `odoc`](https://github.com/ocaml/odoc/pull/972) in October, we continued work on building an `odoc`-compatible search engine based on [Sherlodoc](https://doc.sherlocode.com/). This will give a search engine with type-based search for every package that uses `odoc`. The plan is to make Sherlodoc the search engine in Dune's documentation generation. You can try an early demo on [Varray's doc](https://art-w.github.io/varray/varray/Varray) -- [art-w/sherlodoc#4](https://github.com/art-w/sherlodoc/pull/4)
-- Buiding on `odoc`'s support for search, we merged a PR that adds occurrences information to the search index. This will allows `odoc` search engines to improve the order of search results by using the number of occurences. -- [ocaml/odoc#976](https://github.com/ocaml/odoc/pull/976)
+- Buiding on `odoc`'s support for search, we merged a PR that adds occurrences information to the search index. This will allows `odoc` search engines to improve the order of search results by using the number of occurrences. -- [ocaml/odoc#976](https://github.com/ocaml/odoc/pull/976)
 
 ## **[`odoc`]** Syntax for Images and Assets in `odoc` ([W25](https://ocaml.org/docs/platform-roadmap#w25-generate-documentation))
 
@@ -152,4 +152,4 @@ In this November and December edition, we are excited to bring you the latest on
   - We've added information about the size of the major heap at the end of an `ocamlmerlin` query - [#1717](https://github.com/ocaml/merlin/pull/1717)
 - We've finished up Merlin's new Fuzzy CI, a by-product of the performance work.
     - We've opened the PRs - [#1716](https://github.com/ocaml/merlin/pull/1716) (and [#1719](https://github.com/ocaml/merlin/pull/1719))
-    -  We've written a GitHub wiki entry with a high-level description about it. - [Merlin Fuzzy CI](https://github.com/ocaml/merlin/wiki/Merlin-Fuzzy-CI)
+    -  We've written a GitHub wiki entry with a high-level description about it. - [Merlin Fuzzy CI](https://github.com/ocaml/merlin/wiki/Merlin-Fuzzy-CI)

data/news/platform/platform-2023-10.md

@@ -17,9 +17,9 @@ release of OCaml 5.1.1, some review work on occurrences analysis for
 OCaml projects and a bit of on-going work on structured logs.</p>
 
 
-  
 
-  
+
+
   <h3>OCaml 5.1.1</h3>
 <p>OCaml 5.1.0 has been released nearly three months ago, in those
 months we have discovered a few significant bugs that were impeding the
@@ -179,7 +179,7 @@ increase to a less dramatic factor 6.</p>
 experimental runtime. And while waiting for a better solution, the
 collection of bug fixes integrated in OCaml 5.1.1 should made it
 possible to use numerical code in OCaml.</p>
-<h3>Project-wide occurence index</h3>
+<h3>Project-wide occurrence index</h3>
 <p>Beyond the release of OCaml 5.1.1, I have been working on reviewing
 PRs.</p>
 <p>With Gabriel Scherer and Ulysse G&eacute;rard, we spend an afternoon reading
@@ -248,6 +248,3 @@ identifiers are as fresh as we need them to be:</p>
 <span class="k">module</span> <span class="nc">New_record</span><span class="o">(</span><span class="nc">Root</span><span class="o">:</span><span class="nc">Def</span><span class="o">)</span><span class="bp">()</span><span class="o">:</span> <span class="nc">Record</span> <span class="k">with</span> <span class="k">type</span> <span class="n">root</span> <span class="o">:=</span> <span class="nn">Root</span><span class="p">.</span><span class="n">id</span>
 <span class="k">module</span> <span class="nc">New_sum</span><span class="o">(</span><span class="nc">Root</span><span class="o">:</span><span class="nc">Def</span><span class="o">)</span><span class="bp">()</span><span class="o">:</span> <span class="nc">Sum</span> <span class="k">with</span> <span class="k">type</span> <span class="n">root</span> <span class="o">:=</span> <span class="nn">Root</span><span class="p">.</span><span class="n">id</span>
 </pre></div>
-
-
-  

data/news/platform/platform-2023-12.md

@@ -45,7 +45,7 @@ operations that are available and how to define atomic operations; and
 <p>Irmin now exposes <code>Irmin.Type</code> to create new mergeable contents more
 easily. For instance, the following type defines the property of
 simple metrics, where <code>name</code> is a human-readable name and <code>gauge</code> is a
-metric counting the number of occurences for some kind of event:</p>
+metric counting the number of occurrences for some kind of event:</p>
 <pre><code class="language-ocaml">type metric = {
   name : string;
   gauge: int64;
@@ -232,5 +232,3 @@ operations to read and write atomically. Finally, flexible first-class
 support for immutable trees has also been added.</p>
 <p>Send us feedback on the <a href="https://lists.xenproject.org/cgi-bin/mailman/listinfo/mirageos-devel">MirageOS mailing-list</a> or on the <a href="https://github.com/mirage/irmin">Irmin
 issue tracker on GitHub</a>.</p>
-
-      

data/planet/gallium/florian-compiler-weekly-11-december-2023.md

@@ -22,7 +22,7 @@ source:
     </p><div class="caption">
       Clear skies on OCamlPro's way of life.
     </div>
-  
+
 </div>
 
 <p>For 12 years now, OCamlPro has been empowering a large range of customers,
@@ -155,7 +155,7 @@ application (<a href="https://ocamlpro.com/blog/feed#cobol">COBOL</a>).</p>
     </p><div class="caption">
       The M language, designed in the 80s to compute the French Income Tax, is still being rewritten in OCaml!
     </div>
-  
+
 </div>
 
 <p>In 2022, our work on MLANG has passed a significant milestone: our work may no
@@ -188,7 +188,7 @@ post</a> on the matter.</p>
     </p><div class="caption">
       Cobol is ran in gargantuan infrastructures of many an insurance companies and banks across the globe.
     </div>
-  
+
 </div>
 
 <p>In 2022, we started contributing to <a href="https://github.com/ocamlpro/gnucobol">the GnuCOBOL
@@ -229,7 +229,7 @@ standard. More on this next year, hopefully !</p>
     </p><div class="caption">
       Kind words sent our way by Florian Gilcher (skade), managing director at Ferrous Systems!
     </div>
-  
+
 </div>
 
 <p>OCamlPro's culture is one of human values and appeal for everything scientific.</p>
@@ -257,7 +257,7 @@ contributions and missions, some of which we will share with you right now.</p>
     </p><div class="caption">
       Ecore is the code generator at the heart of the EMF Architecture.
     </div>
-  
+
 </div>
 
 <p>In 2022, we have seized the opportunity to work at the threshold between Java
@@ -296,7 +296,7 @@ future iterations of their internal projects.</p>
     </p><div class="caption">
       Ferris the Crab is the mascot of the Rust Language. No wonder why we converged as well!
     </div>
-  
+
 </div>
 
 <p>As we continue scouring the market for more and more Rust projects, and whenever
@@ -373,7 +373,7 @@ DNS provider, and strives to offer a user-friendly and easy configuration.</p>
     </p><div class="caption">
       WebAssembly is used to compile many languages to an efficient portable code for web-browsers.
     </div>
-  
+
 </div>
 
 <p>Late 2022 was finally time for us to put into practice the knowledge we have
@@ -444,7 +444,7 @@ of Paris-Saclay</a>.</p>
     </p><div class="caption">
       Alt-Ergo proves mathematical formulas corresponding to software program properties.
     </div>
-  
+
 </div>
 
 <h4>
@@ -469,7 +469,7 @@ full-time R&amp;D engineer.</p>
     </p><div class="caption">
       The dedicated members of the Club!
     </div>
-  
+
 </div>
 
 <p>This is the reason why we would like to thank our partners from the <a href="https://alt-ergo.ocamlpro.com/#club">Alt-Ergo
@@ -527,7 +527,7 @@ the Formal Methods Lab (LMF) and the ProofinUse consortium members. Stay tuned!<
     </p><div class="caption">
       Dolmens are Neolithic megalithic structures composed of menhirs and they can range from a few centimeters to several meters high!
     </div>
-  
+
 </div>
 
 <p><a href="https://github.com/Gbury/dolmen">Dolmen</a> is an OCaml Library developed by
@@ -568,7 +568,7 @@ scientists.</p>
     </p><div class="caption">
       opam, the OCaml Package Manager, remains one of OCamlPro's greatest achievements!
     </div>
-  
+
 </div>
 
 <p>2022 has been the theatre of a sustained and continuous effort from the opam
@@ -616,7 +616,7 @@ repository, OCaml tooling) and the public's feedback and vision.</p>
     </p><div class="caption">
       Flambda2 is a powerful code optimizer for the OCaml compiler strong of many years of R&amp;D.
     </div>
-  
+
 </div>
 
 <p>OCamlPro is proud to be working on Flambda2, an ambitious OCaml
@@ -667,7 +667,7 @@ OCaml distribution!</p>
     </p><div class="caption">
       Camels going to their pluri-annual OUPS Meet-up.
     </div>
-  
+
 </div>
 
 <p>Just under 10 years ago, Fabrice Le Fessant initiated the <a href="https://www.meetup.com/fr-FR/ocaml-paris/events/99222322/">very first OCaml
@@ -709,14 +709,14 @@ Foundation</a> who graciously pays for the pizzas.</p>
     </p><div class="caption">
       Toulouse also has its set of enthousiastic OCaml supporters.
     </div>
-  
+
 </div>
 
 <p>Fortunately for OCaml Users that live in the French South-West, <a href="https://www.meetup.com/ocaml-toulouse/events/288464047/">a new Meet-up
 is now available</a> to
 them. On the 11th of October 2022, the first OCaml meet-up in
 <a href="https://en.wikipedia.org/wiki/Toulouse">Toulouse</a> happened.</p>
-<p>The first occurence of the OCaml Users in Toulouse Meetup kicked off with Erik
+<p>The first occurrence of the OCaml Users in Toulouse Meetup kicked off with Erik
 Martin-Dorel (OCaml Software Foundation) presenting
 <a href="https://ocaml-sf.org/learn-ocaml/"><code>Learn-OCaml</code></a> who was then followed by
 David Declerck (OCamlPro) presenting his
@@ -742,7 +742,7 @@ OCaml.</p>
     </p><div class="caption">
       ICFP 2022 took place in the beautiful town of Ljubjana, Slovenia.
     </div>
-  
+
 </div>
 
 <p>The OCaml Workshop is an international conference that focuses on everything
@@ -771,7 +771,7 @@ editions of the conference!</p>
     </p><div class="caption">
       the JFLA'2022 took place in the beautiful Domaine d'Essendi&eacute;ras in P&eacute;rigord, France.
     </div>
-  
+
 </div>
 
 <p>Among the many scientific conferences we attend on an annual basis, the
@@ -803,4 +803,3 @@ support and collaboration throughout the year,</p>
 <p>And to you, dear reader, thank you for tagging along,</p>
 <p>Since 2011 with love,</p>
 <p>The OCamlPro Team</p>
-

data/planet/mirage/easy-distributed-analytics-with-irmin-10.md

@@ -74,7 +74,7 @@ and b = (a.v, a.v)
 </code></pre>
 <p>I have a few solutions, but not sure yet which one is best. This probably won't appear in any normal test. This bug manifests through a segmentation fault (<code>cmmgen</code> fails to compile that recursive value reasonably).</p>
 <h3>Pattern-Matching</h3>
-<p>The new passes assume that every identifier is declared only once in a given module, but this assumption can be broken on some rare pattern matching cases. I will have to dig through <code>matching.ml</code> to add a substitution in these cases. (the only non hand-built occurence that I found is in <code>ocamlnet</code>)</p>
+<p>The new passes assume that every identifier is declared only once in a given module, but this assumption can be broken on some rare pattern matching cases. I will have to dig through <code>matching.ml</code> to add a substitution in these cases. (the only non hand-built occurrence that I found is in <code>ocamlnet</code>)</p>
 <h2>Known Mis-compilations</h2>
 <ul>
 <li>since there is no cross-module information at the moment, calls to functions from other modules are always slow.
@@ -84,4 +84,3 @@ and b = (a.v, a.v)
 </ul>
 <h2>What's next ?</h2>
 <p>I would now like to add back cross-module information, and after a bit of cleanup the first series of patches should be ready to propose upstream.</p>
-

data/planet/ocamlpro/2022-at-ocamlpro.md

@@ -13,8 +13,8 @@ source:
 
 <html>
   <head>
-     
-    
+
+
     <title>Conversion</title>
   </head>
   <body>
@@ -40,9 +40,9 @@ source:
       \end{eqnarray}
       \]
     The $\textbf{semantics}$ of the the $\lambda$-calculus is defined
-    by three $\textit{conversion rules}$. To understand them 
+    by three $\textit{conversion rules}$. To understand them
     requires the terminology of $\textit{free}$ and
-    $\textit{bound}$ variables. An occurence of a variable in a
+    $\textit{bound}$ variables. An occurrence of a variable in a
     $\lambda$-expression is bound if there is an enclosing abstraction
     that binds it, and is free otherwise. For example, in $\lambda x.+\;
     ((\lambda y. +\;y\; z)\;7)\;x$, $x$ and $y$ appear bound whereas $z$
@@ -56,10 +56,10 @@ source:
       denotes the application of a particular $\lambda$-abstraction to
       the argument $4$. The result of applying a $\lambda$-abstraction
       to an argument is an instance of the body of the
-      $\lambda$-abstraction in which (free) occurences of the formal
+      $\lambda$-abstraction in which (free) occurrences of the formal
       parameter in the body are replaced with (copies of) the
       argument. Thus, $\left(\lambda x.+\;x\;1\right)\; 4 \rightarrow
-      +\;4\;1 \rightarrow 5$. In the event there are no occurences of
+      +\;4\;1 \rightarrow 5$. In the event there are no occurrences of
       the formal parameter in the abstraction body, the argument is
       discarded unused so, $(\lambda x.\;3)\;4 \rightarrow 3$. Care is
       needed when formal parameter names are not unique. For example,
@@ -86,10 +86,10 @@ source:
       <pre>
       auto add = [](int x) { return [=](int y) { return x + y; }; };
       auto sub = [](int x) { return [=](int y) { return x - y; }; };
-      [=](int x) { 
+      [=](int x) {
         return [=](int x) {
-          return add (sub (x) (1)); 
-          } (x) (3); 
+          return add (sub (x) (1));
+          } (x) (3);
       } (9) ; //is the value '11'
       </pre>
 
@@ -103,7 +103,7 @@ source:
     way to look at $\beta$ conversion is that it is saying something
     about $\lambda$-expressions that look different but mean the same
     thing.
-    
+
 
     <h4>$\alpha$-conversion</h4>
     <p>
@@ -124,7 +124,7 @@ source:
       does not occur free in $f$, then $\lambda x.f\;x
       \underset{\eta}{\leftrightarrow} f$. For example, in OCaml if we
       define <code>f</code> by
-      <code>let f x = x + 1</code> then clearly 
+      <code>let f x = x + 1</code> then clearly
       <code>fun x -&gt; f x</code> produces the same results for
       all values <code>x</code> in the domain of <code>f</code>.
     </p>
@@ -153,7 +153,6 @@ source:
     <p>
       References:<br/>
       [1] <cite>The Implementation of Functional Programming Languages</cite> by Simon L. Peyton Jones. 1987.</p>
-    
+
   </body>
 </html>
-