diff options
| author | Matej Kosik | 2015-11-03 11:27:35 +0100 |
|---|---|---|
| committer | Hugo Herbelin | 2015-12-10 09:35:12 +0100 |
| commit | 8b559623f8f2539836069a7352498a5e2c4784e6 (patch) | |
| tree | 03d237fdae556a0eed7e19e387d2aa9071063383 | |
| parent | 4570133034c9457a4d641449a522c29a8f029a55 (diff) | |
COMMENT: to do
| -rw-r--r-- | doc/refman/RefMan-cic.tex | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/doc/refman/RefMan-cic.tex b/doc/refman/RefMan-cic.tex index d3b4f3af7c..f7a6470f9c 100644 --- a/doc/refman/RefMan-cic.tex +++ b/doc/refman/RefMan-cic.tex @@ -184,6 +184,7 @@ More precisely the language of the {\em Calculus of Inductive The notion of free variables is defined as usual. In the expressions $\lb x:T\mto U$ and $\forall x:T, U$ the occurrences of $x$ in $U$ are bound. +% TODO: what is the best play to say that "terms are considered equal up to α-conversion"? \paragraph[Substitution.]{Substitution.\index{Substitution}} The notion of substituting a term $t$ to free occurrences of a |