X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fhelp%2FC%2Fsec_terms.xml;h=11b06b21cab7269c8bd3bd2867ed8bc48b31f1c5;hb=648d1495bb71b72169bc67c78071600b82a5bfda;hp=e9c1c054cc0201704491cbc5bc09cc56dc309842;hpb=55676f08ab60b802d00ed47e8089d8622bc3dadb;p=helm.git
diff --git a/matita/help/C/sec_terms.xml b/matita/help/C/sec_terms.xml
index e9c1c054c..11b06b21c 100644
--- a/matita/help/C/sec_terms.xml
+++ b/matita/help/C/sec_terms.xml
@@ -5,65 +5,111 @@
Syntax
To describe syntax in this manual we use the following conventions:
- Non terminal symbols are emphasized and have a link to their definition. E.g.: &term;
- Terminal symbols are in bold. E.g.: theorem
- Optional sequences of elements are put in square brackets.
- E.g.: [in &term;]
- Alternatives are put in square brakets and they are separated
- by vertical bars. E.g.: [<|>]
- Repetition of sequences of elements are given by putting the
- first sequence in square brackets, that are followed by three dots.
- E.g.: [and &term;]â¦
+ Non terminal symbols are emphasized and have a link to their
+ definition. E.g.: &term;
+ Terminal symbols are in bold. E.g.:
+ theorem
+ Optional sequences of elements are put in square brackets.
+ E.g.: [in &term;]
+ Alternatives are put in square brakets and they are
+ separated by vertical bars. E.g.: [<|>]
+ Repetitions of a sequence of elements are given by putting the
+ sequence in square brackets, that are followed by three dots. The empty
+ sequence is a valid repetition.
+ E.g.: [and &term;]â¦
+ Characters belonging to a set of characters are given
+ by listing the set elements in square brackets. Hyphens are used to
+ specify ranges of characters in the set.
+ E.g.: [a-zA-Z0-9_-]
Terms & co.
Lexical conventions
-
-
-
-
-
- &id;
- ::=
- â©â©&TODO;âªâª
-
-
-
-
-
-
-
-
-
- &nat;
- ::=
- â©â©&TODO;âªâª
-
-
-
-
-
-
-
-
-
- &uri;
- ::=
- â©â©&TODO;âªâª
-
-
-
-
+
+ id
+
+
+
+ &id;
+ ::=
+ â©â©any sequence of letters, underscores or valid XML digits prefixed by a latin letter ([a-zA-Z]) and post-fixed by a possible empty sequence of decorators ([?'`])âªâª
+
+
+
+
+
+ nat
+
+
+
+ &nat;
+ ::=
+ â©â©any sequence of valid XML digitsâªâª
+
+
+
+
+
+ char
+
+
+
+ &char;
+ ::=
+ [a-zA-Z0-9_-]
+
+
+
+
+
+ uri-step
+
+
+
+ &uri-step;
+ ::=
+ &char;[&char;]â¦
+
+
+
+
+
+ uri
+
+
+
+ &uri;
+ ::=
+ [cic:/|theory:/]&uri-step;[/&uri-step;]â¦.&id;[.&id;]â¦[#xpointer(&nat;/&nat;[/&nat;]â¦)]
+
+
+
+
Terms
-
+
+
+
+
+
+
+ Terms
-
- &term;
+ &term;
::=
&sterm;
simple or delimited term
@@ -107,11 +153,10 @@
|
- let
- [co]rec
- &id; [&id;|(&id;[,&term;]⦠:&term;)]⦠[on &nat;]
- [: &term;]
- â &term;
+
+ let
+ [co]rec
+ &rec_def;
(co)recursive definitions
@@ -119,10 +164,7 @@
- [and
- [&id;|(&id;[,&term;]⦠:&term;)]⦠[on &nat;]
- [: &term;]
- â &term;]â¦
+ [and &rec_def;]â¦
@@ -140,16 +182,34 @@
â¦
user provided notation
+
+ &rec_def;
+ ::=
+
+ &id; [&id;|(&id;[,&term;]⦠:&term;)]â¦
+
+
+
+
+
+
+
+ [on &nat;]
+ [: &term;]
+ â &term;]
+
+
+
-
+
+ Simple terms
-
- &sterm;
+ &sterm;
::=
(&term;)
@@ -218,11 +278,9 @@
[
- &match_pattern; â &term;
- [
- |
- &match_pattern; â &term;
- ]â¦]
+ &match_branch;[|&match_branch;]â¦
+ ]
+
@@ -241,12 +299,12 @@
-
+
+ Arguments
-
- &args;
+ &args;
::=
_[: &term;]
@@ -273,16 +331,8 @@
(&id;[,&id;]â¦[: &term;])
-
-
-
-
-
-
-
-
- &args2;
+ &args2;
::=
&id;
@@ -297,12 +347,18 @@
-
+
+ Pattern matching
-
-
- &match_pattern;
+
+ &match_branch;
+ ::=
+ &match_pattern; â &term;
+
+
+
+ &match_pattern;
::=
&id;
0-ary constructor
@@ -316,6 +372,7 @@
+
@@ -343,9 +400,30 @@
Notice that the command is equivalent to theorem f: T â t.
- [co]inductive &id; (of inductive types)
+ [<emphasis role="bold">inductive</emphasis>|<emphasis role="bold">coinductive</emphasis>] &id; [&args2;]⦠<emphasis role="bold">:</emphasis> &term; <emphasis role="bold">â</emphasis> [<emphasis role="bold">|</emphasis>] [&id;<emphasis role="bold">:</emphasis>&term;] [<emphasis role="bold">|</emphasis> &id;<emphasis role="bold">:</emphasis>&term;]â¦
+[<emphasis role="bold">with</emphasis> &id; <emphasis role="bold">:</emphasis> &term; <emphasis role="bold">â</emphasis> [<emphasis role="bold">|</emphasis>] [&id;<emphasis role="bold">:</emphasis>&term;] [<emphasis role="bold">|</emphasis> &id;<emphasis role="bold">:</emphasis>&term;]â¦]â¦
+
(co)inductive types declaration
- &TODO;
+ inductive i x y z: S â k1:T1 | ⦠| kn:Tn with i' : S' â k1':T1' | ⦠| km':Tm'
+ Declares a family of two mutually inductive types
+ i and i' whose types are
+ S and S', which must be convertible
+ to sorts.
+ The constructors ki of type Ti
+ and ki' of type Ti' are also
+ simultaneously declared. The declared types i and
+ i' may occur in the types of the constructors, but
+ only in strongly positive positions according to the rules of the
+ calculus.
+ The whole family is parameterized over the arguments x,y,z.
+ If the keyword coinductive is used, the declared
+ types are considered mutually coinductive.
+ Elimination principles for the record are automatically generated
+ by Matita, if allowed by the typing rules of the calculus according to
+ the sort S. If generated,
+ they are named i_ind, i_rec and
+ i_rect according to the sort of their induction
+ predicate.
<emphasis role="bold">record</emphasis> &id; [&args2;]⦠<emphasis role="bold">:</emphasis> &term; <emphasis role="bold">â</emphasis><emphasis role="bold">{</emphasis>[&id; [<emphasis role="bold">:</emphasis>|<emphasis role="bold">:></emphasis>] &term;] [<emphasis role="bold">;</emphasis>&id; [<emphasis role="bold">:</emphasis>|<emphasis role="bold">:></emphasis>] &term;]â¦<emphasis role="bold">}</emphasis>
@@ -360,8 +438,8 @@
Elimination principles for the record are automatically generated
by Matita, if allowed by the typing rules of the calculus according to
the sort S. If generated,
- they are named id_ind, id_rec and
- id_rect according to the sort of their induction
+ they are named i_ind, i_rec and
+ i_rect according to the sort of their induction
predicate.
For each field fi a record projection
fi is also automatically generated if projection
@@ -422,5 +500,95 @@
+
+ Tactic arguments
+ This section documents the syntax of some recurring arguments for
+ tactics.
+
+
+ intros-spec
+
+ intros-spec
+
+
+
+ &intros-spec;
+ ::=
+ [&nat;] [([&id;]â¦)]
+
+
+
+
+ The natural number is the number of new hypotheses to be introduced. The list of identifiers gives the name for the first hypotheses.
+
+
+
+ pattern
+
+ pattern
+
+
+
+ &pattern;
+ ::=
+ &TODO;
+
+
+
+
+ &TODO;
+
+
+
+ reduction-kind
+ Reduction kinds are normalization functions that transform a term
+ to a convertible but simpler one. Each reduction kind can be used both
+ as a tactic argument and as a stand-alone tactic.
+
+ reduction-kind
+
+
+
+ &reduction-kind;
+ ::=
+ demodulate
+
+
+
+ |
+ normalize
+ Computes the βδιζ-normal form
+
+
+
+ |
+ reduce
+ Computes the βδιζ-normal form
+
+
+
+ |
+ simplify
+ Computes a form supposed to be simpler
+
+
+
+ |
+ unfold [&sterm;]
+ δ-reduces the constant or variable if specified, or that
+ in head position
+
+
+
+ |
+ whd
+ Computes the βδιζ-weak-head normal form
+
+
+
+
+
+
+