aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc
diff options
context:
space:
mode:
Diffstat (limited to 'doc')
-rw-r--r--doc/refman/RefMan-cic.tex1
1 files changed, 1 insertions, 0 deletions
diff --git a/doc/refman/RefMan-cic.tex b/doc/refman/RefMan-cic.tex
index c54481e87..49e164931 100644
--- a/doc/refman/RefMan-cic.tex
+++ b/doc/refman/RefMan-cic.tex
@@ -1376,6 +1376,7 @@ proving a property $\lb a x \mto P$ of type $B$.
% QUESTION: Is it necessary to explain the meaning of [I:A|B] in such a complicated way?
% Couldn't we just say that: "relation [I:A|B] defines which types can we choose as 'result types'
% with respect to the type of the matched object".
+We use this concept to formulate the hypothesis of the typing rule for the match-construct.
The case of inductive definitions in sorts \Set\ or \Type{} is simple.
There is no restriction on the sort of the predicate to be