aboutsummaryrefslogtreecommitdiff
path: root/doc/sphinx/addendum/generalized-rewriting.rst
diff options
context:
space:
mode:
Diffstat (limited to 'doc/sphinx/addendum/generalized-rewriting.rst')
-rw-r--r--doc/sphinx/addendum/generalized-rewriting.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/sphinx/addendum/generalized-rewriting.rst b/doc/sphinx/addendum/generalized-rewriting.rst
index 2ea0861e47..73d9b93482 100644
--- a/doc/sphinx/addendum/generalized-rewriting.rst
+++ b/doc/sphinx/addendum/generalized-rewriting.rst
@@ -117,7 +117,7 @@ parameters is any term :math:`f \, t_1 \ldots t_n`.
.. example:: Morphisms
Continuing the previous example, let ``union: forall (A : Type), list A -> list A -> list A``
- perform the union of two sets by appending one list to the other. ``union` is a binary
+ perform the union of two sets by appending one list to the other. ``union`` is a binary
morphism parametric over ``A`` that respects the relation instance
``(set_eq A)``. The latter condition is proved by showing: