diff options
| author | Matej Kosik | 2015-11-05 19:33:33 +0100 |
|---|---|---|
| committer | Hugo Herbelin | 2015-12-10 09:35:16 +0100 |
| commit | 0e7a91379a49be9874ce1669f3058fa0ae1194bb (patch) | |
| tree | 90cf64fcae33e6a14044fc0647a97f0ef658e805 | |
| parent | c3973cc972cd1474fb4bad308197d64634a518dc (diff) | |
COMMENT: question
| -rw-r--r-- | doc/refman/RefMan-cic.tex | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/doc/refman/RefMan-cic.tex b/doc/refman/RefMan-cic.tex index 9e11d66ab5..6cd84cfc6e 100644 --- a/doc/refman/RefMan-cic.tex +++ b/doc/refman/RefMan-cic.tex @@ -1396,6 +1396,10 @@ $I$. \end{description} % QUESTION: What kind of value is represented by "x" in the "numerator"? % There, "x" is unbound. Isn't it? +% The rule does not fully justify the following (plausible) argument: +% +% http://matej-kosik.github.io/www/doc/coq/notes/26__allowed_elimination_sorts.html +% % NOTE: Above, "Set" is subsumed in "Type(0)" so, strictly speaking, we wouldn't need to mention in explicitely. The case of Inductive definitions of sort \Prop{} is a bit more |