aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTanaka Akira2019-02-11 14:41:05 +0900
committerTanaka Akira2019-02-11 14:41:05 +0900
commite9bec8dca7c317800227fac329c7f9b6e9b4a1dc (patch)
tree1a464547343f87ef0422d12c6af3bc326e15039b
parent4a5eb765f7c1a5795368c7cdcd2a6d85eef20256 (diff)
Remove a space before closing double-quote.
-rw-r--r--doc/sphinx/language/cic.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/sphinx/language/cic.rst b/doc/sphinx/language/cic.rst
index 38a52c00a3..acee27107b 100644
--- a/doc/sphinx/language/cic.rst
+++ b/doc/sphinx/language/cic.rst
@@ -20,7 +20,7 @@ There are types for functions (or programs), there are atomic types
(especially datatypes)... but also types for proofs and types for the
types themselves. Especially, any object handled in the formalism must
belong to a type. For instance, universal quantification is relative
-to a type and takes the form "*for all x of type T, P* ". The expression
+to a type and takes the form "*for all x of type T, P*". The expression
“x of type T” is written :g:`x:T`. Informally, :g:`x:T` can be thought as
“x belongs to T”.