aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTanaka Akira2019-01-31 16:29:20 +0900
committerTanaka Akira2019-01-31 16:29:20 +0900
commit924370c88a2c5beea36f83d8ae4b36be496d31fa (patch)
tree63ae2ef07778d637bf7de776c082f76b7cae3635
parent57c808ce4ab8332bdae9b19cf97866e5ac87a31a (diff)
Move out a period and comma from :math:.
-rw-r--r--doc/sphinx/language/cic.rst4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/sphinx/language/cic.rst b/doc/sphinx/language/cic.rst
index b0bdd91ac6..18ddbe94cc 100644
--- a/doc/sphinx/language/cic.rst
+++ b/doc/sphinx/language/cic.rst
@@ -522,7 +522,7 @@ for :math:`x` an arbitrary variable name fresh in :math:`t`.
λ x:\Type(1).(f~x) \triangleright_η f
because the type of the reduced term :math:`∀ x:\Type(2),\Type(1)` would not be
- convertible to the type of the original term :math:`∀ x:\Type(1),\Type(1).`
+ convertible to the type of the original term :math:`∀ x:\Type(1),\Type(1)`.
.. _convertibility:
@@ -1376,7 +1376,7 @@ the proof of :g:`or A B` is not accepted:
From the computational point of view, the structure of the proof of
:g:`(or A B)` in this term is needed for computing the boolean value.
-In general, if :math:`I` has type :math:`\Prop` then :math:`P` cannot have type :math:`I→\Set,` because
+In general, if :math:`I` has type :math:`\Prop` then :math:`P` cannot have type :math:`I→\Set`, because
it will mean to build an informative proof of type :math:`(P~m)` doing a case
analysis over a non-computational object that will disappear in the
extracted program. But the other way is safe with respect to our