diff options
| author | mohring | 2003-12-21 15:47:28 +0000 |
|---|---|---|
| committer | mohring | 2003-12-21 15:47:28 +0000 |
| commit | c6376f2fc4b8d1ff87c4f95ad4e227e7d44bca25 (patch) | |
| tree | 4d481c384cb1d9ac8c090e4476e7d2c3472211f0 /doc | |
| parent | 8813fcac6b29aee2339fd3db3e81f0ee653b8635 (diff) | |
*** empty log message ***
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8435 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'doc')
| -rwxr-xr-x | doc/RefMan-cic.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/RefMan-cic.tex b/doc/RefMan-cic.tex index 7cc9061877..d9a94bb72d 100755 --- a/doc/RefMan-cic.tex +++ b/doc/RefMan-cic.tex @@ -1205,11 +1205,11 @@ The second operator for elimination is fixpoint definition. This fixpoint may involve several mutually recursive definitions. The basic concrete syntax for a recursive set of mutually recursive declarations is (with $\Gamma_i$ contexts)~: -\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with} f_n +\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with}~ f_n (\Gamma_n) :A_n:=t_n\] The terms are obtained by projections from this set of declarations and are written -\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with} f_n +\[\kw{fix}~f_1 (\Gamma_1) :A_1:=t_1~\kw{with} \ldots \kw{with}~ f_n (\Gamma_n) :A_n:=t_n~\kw{for}~f_i\] In the inference rules, we represent such a term by |