[fixes #2175] Documentation misc. typos etc. for RC1

.github/workflows/ci-ubuntu.yml

@@ -8,6 +8,7 @@ on:
     branches:
       - master
       - experimental
+  merge_group:
 
 ########################################################################
 ## CONFIGURATION

.github/workflows/haskell-ci.yml

@@ -32,6 +32,7 @@ on:
       - agda-stdlib-utils.cabal
       - cabal.haskell-ci
       - "*.hs"
+  merge_group:
 jobs:
   linux:
     name: Haskell-CI - Linux - ${{ matrix.compiler }}

CHANGELOG.md

@@ -504,7 +504,7 @@ Non-backwards compatible changes
   and `Codata.Guarded.Stream.Relation.Binary.Pointwise`, the proofs
   called `lookup` have been renamed `lookup⁺`.
 
-#### Changes to `Data.(Nat/Integer/Rational)` proofs of `NonZero`/`Positive`/`Negative` to instance arguments
+#### Changes to `Data.(Nat/Integer/Rational)` proofs of `NonZero`/`Positive`/`Negative` to use instance arguments
 
 * Many numeric operations in the library require their arguments to be non-zero,
   and various proofs require their arguments to be non-zero/positive/negative etc.
@@ -2761,7 +2761,7 @@ Additions to existing modules
 * Added new definitions and proofs to `Data.Nat.Primality`:
   ```agda
   Composite        : ℕ → Set
-  composite?       : Decidable composite
+  composite?       : Decidable Composite
   composite⇒¬prime : Composite n → ¬ Prime n
   ¬composite⇒prime : 2 ≤ n → ¬ Composite n → Prime n
   prime⇒¬composite : Prime n → ¬ Composite n

README.agda

@@ -7,7 +7,7 @@ module README where
 --
 -- Authors: Nils Anders Danielsson, Matthew Daggitt, Guillaume Allais
 -- with contributions from Andreas Abel, Stevan Andjelkovic,
--- Jean-Philippe Bernardy, Peter Berry, Bradley Hardy Joachim Breitner,
+-- Jean-Philippe Bernardy, Peter Berry, Bradley Hardy, Joachim Breitner,
 -- Samuel Bronson, Daniel Brown, Jacques Carette, James Chapman,
 -- Liang-Ting Chen, Dominique Devriese, Dan Doel, Érdi Gergő,
 -- Zack Grannan, Helmut Grohne, Simon Foster, Liyang Hu, Jason Hu,

notes/installation-guide.md

@@ -3,19 +3,19 @@ Installation instructions
 
 Note: the full story on installing Agda libraries can be found at [readthedocs](http://agda.readthedocs.io/en/latest/tools/package-system.html).
 
-Use version v1.7.2 of the standard library with Agda 2.6.3.
+Use version v2.0 of the standard library with Agda 2.6.4.
 
 1. Navigate to a suitable directory `$HERE` (replace appropriately) where
    you would like to install the library.
 
-2. Download the tarball of v1.7.2 of the standard library. This can either be
+2. Download the tarball of v2.0 of the standard library. This can either be
    done manually by visiting the Github repository for the library, or via the
    command line as follows:
    ```
-   wget -O agda-stdlib.tar https://github.com/agda/agda-stdlib/archive/v1.7.2.tar.gz
+   wget -O agda-stdlib.tar https://github.com/agda/agda-stdlib/archive/v2.0.tar.gz
    ```
    Note that you can replace `wget` with other popular tools such as `curl` and that
-   you can replace `1.7.2` with any other version of the library you desire.
+   you can replace `2.0` with any other version of the library you desire.
 
 3. Extract the standard library from the tarball. Again this can either be
    done manually or via the command line as follows:
@@ -26,7 +26,7 @@ Use version v1.7.2 of the standard library with Agda 2.6.3.
 4. [ OPTIONAL ] If using [cabal](https://www.haskell.org/cabal/) then run
    the commands to install via cabal:
    ```
-   cd agda-stdlib-1.7.2
+   cd agda-stdlib-2.0
    cabal install
    ```
 
@@ -40,7 +40,7 @@ Use version v1.7.2 of the standard library with Agda 2.6.3.
 6. Register the standard library with Agda's package system by adding
    the following line to `$HOME/.agda/libraries`:
    ```
-   $HERE/agda-stdlib-1.7.2/standard-library.agda-lib
+   $HERE/agda-stdlib-2.0/standard-library.agda-lib
    ```
 
 Now, the standard library is ready to be used either:

src/Relation/Nullary/Decidable/Core.agda

@@ -35,8 +35,8 @@ private
 -- reflects the boolean result. This definition allows the boolean
 -- part of the decision procedure to compute independently from the
 -- proof. This leads to better computational behaviour when we only care
--- about the result and not the proof. See README.Decidability for
--- further details.
+-- about the result and not the proof. See README.Design.Decidability
+-- for further details.
 
 infix 2 _because_