From c1125bda507137c35400808c6de19acfcece0ec7 Mon Sep 17 00:00:00 2001 From: Théo Zimmermann Date: Sat, 16 May 2020 16:19:59 +0200 Subject: Use the new gdef alt-text feature in the refman. --- doc/sphinx/language/core/basic.rst | 2 +- doc/sphinx/language/core/sorts.rst | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'doc/sphinx/language') diff --git a/doc/sphinx/language/core/basic.rst b/doc/sphinx/language/core/basic.rst index 250a0f0326..68900aa0be 100644 --- a/doc/sphinx/language/core/basic.rst +++ b/doc/sphinx/language/core/basic.rst @@ -267,7 +267,7 @@ rest of the |Coq| manual: :term:`terms ` and :term:`types Intuitively, types may be viewed as sets containing terms. We say that a type is :gdef:`inhabited` if it contains at least one term (i.e. if we can find a term which is associated with this - type). We call such terms :gdef:`witness`\es. Note that deciding + type). We call such terms :gdef:`witnesses `. Note that deciding whether a type is inhabited is `undecidable `_. diff --git a/doc/sphinx/language/core/sorts.rst b/doc/sphinx/language/core/sorts.rst index 8307a02d6d..03581b95dd 100644 --- a/doc/sphinx/language/core/sorts.rst +++ b/doc/sphinx/language/core/sorts.rst @@ -22,7 +22,7 @@ Sorts | @universe_expr universe_expr ::= @universe_name {? + @num } -The types of types are called :gdef:`sort`\s. +The types of types are called :gdef:`sorts `. All sorts have a type and there is an infinite well-founded typing hierarchy of sorts whose base sorts are :math:`\SProp`, :math:`\Prop` -- cgit v1.2.3