From 0690df26640cd825f45e62bb10fc6721712bf858 Mon Sep 17 00:00:00 2001
From: Tanaka Akira
Date: Thu, 31 Jan 2019 18:00:33 +0900
Subject: Use \Match for match construct.

---
 doc/sphinx/language/cic.rst | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/sphinx/language/cic.rst b/doc/sphinx/language/cic.rst
index 2083eb99a2..4cdc61acc3 100644
--- a/doc/sphinx/language/cic.rst
+++ b/doc/sphinx/language/cic.rst
@@ -1309,7 +1309,7 @@ inference rules, we use a more compact notation:
 
 .. _Allowed-elimination-sorts:
 
-**Allowed elimination sorts.** An important question for building the typing rule for match is what
+**Allowed elimination sorts.** An important question for building the typing rule for :math:`\Match` is what
 can be the type of :math:`λ a x . P` with respect to the type of :math:`m`. If :math:`m:I`
 and :math:`I:A` and :math:`λ a x . P : B` then by :math:`[I:A|B]` we mean that one can use
 :math:`λ a x . P` with :math:`m` in the above match-construct.
-- 
cgit v1.2.3