X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fhelp%2FC%2Fsec_terms.xml;h=05385f666b3a41ad4267a1977c0e8c8dac9aa4d5;hb=1be6639bbfa31fcbb49f0017016c78ebafe10453;hp=11b06b21cab7269c8bd3bd2867ed8bc48b31f1c5;hpb=27a70cc8c150c426956005e95b432b3a34ff36c0;p=helm.git
diff --git a/matita/help/C/sec_terms.xml b/matita/help/C/sec_terms.xml
index 11b06b21c..05385f666 100644
--- a/matita/help/C/sec_terms.xml
+++ b/matita/help/C/sec_terms.xml
@@ -26,6 +26,18 @@
Terms & co.
Lexical conventions
+
+ qstring
+
+
+
+ &qstring;
+ ::=
+ "â©â©any sequence of characters excluded "âªâª"
+
+
+
+
id
@@ -186,7 +198,7 @@
&rec_def;
::=
- &id; [&id;|(&id;[,&term;]⦠:&term;)]â¦
+ &id; [&id;|_|(&id;[,&id;]⦠:&term;)]â¦
@@ -194,7 +206,7 @@
- [on &nat;]
+ [on &id;]
[: &term;]
â &term;]
@@ -242,6 +254,12 @@
Set
the impredicate sort of datatypes
+
+
+ |
+ CProp
+ one fixed predicative sort of constructive propositions
+
|
@@ -267,7 +285,7 @@
|
match &term;
- [ in &term; ]
+ [ in &id; ]
[ return &term; ]
with
@@ -369,6 +387,12 @@
(&id; &id; [&id;]â¦)
n-ary constructor (binds the n arguments)
+
+
+ |
+ &id; &id; [&id;]â¦
+ n-ary constructor (binds the n arguments)
+
@@ -399,6 +423,11 @@
f must be defined by means of tactics.
Notice that the command is equivalent to theorem f: T â t.
+
+ <emphasis role="bold">letrec</emphasis> &TODO;
+ &TODO;
+ &TODO;
+
[<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;]â¦]â¦
@@ -473,7 +502,7 @@
<para>Notice that the command is equivalent to <command>definition f: T â t</command>.</para>
</sect2>
<sect2 id="variant">
- <title><emphasis role="bold">variant</emphasis> &id;[<emphasis role="bold">:</emphasis> &term;] [<emphasis role="bold">â</emphasis> &term;]
+ <emphasis role="bold">variant</emphasis> &id;<emphasis role="bold">:</emphasis> &term; <emphasis role="bold">â</emphasis> &term;
variant
variant f: T â t
Same as theorem f: T â t, but it does not
@@ -531,12 +560,98 @@
&pattern;
::=
- &TODO;
+ in
+ [&id;[: &path;]]â¦
+ [⢠&path;]]
+ simple pattern
+
+
+
+ |
+ in match &term;
+ [in
+ [&id;[: &path;]]â¦
+ [⢠&path;]]
+ full pattern
+
+
+
+
+
+ path
+
+
+
+ &path;
+ ::=
+ â©â©any &sterm; whithout occurrences of Set, Prop, CProp, Type, &id;, &uri; and user provided notation; however, % is now an additional production for &sterm;âªâª
- &TODO;
+ A path locates zero or more subterms of a given term by mimicking the term structure up to:
+
+ Occurrences of the subterms to locate that are
+ represented by %.
+ Subterms without any occurrence of subterms to locate
+ that can be represented by ?.
+
+
+ For instance, the path
+ â_,_:?.(? ? % ?)â(? ? ? %)
+ locates at once the subterms
+ x+y and x*y in the
+ term âx,y:nat.x+y=1â0=x*y
+ (where the notation A=B hides the term
+ (eq T A B) for some type T).
+
+ A simple pattern extends paths to locate
+ subterms in a whole sequent. In particular, the pattern
+ in H: p K: q ⢠r locates at once all the subterms
+ located by the pattern r in the conclusion of the
+ sequent and by the patterns p and
+ q in the hypotheses H
+ and K of the sequent.
+
+ If no list of hypotheses is provided in a simple pattern, no subterm
+ is selected in the hypothesis. If the ⢠p
+ part of the pattern is not provided, no subterm will be matched in the
+ conclusion if at least one hypothesis is provided; otherwise the whole
+ conclusion is selected.
+
+ Finally, a full pattern is interpreted in three
+ steps. In the first step the match T in
+ part is ignored and a set S of subterms is
+ located as for the case of
+ simple patterns. In the second step the term T
+ is parsed and interpreted in the context of each subterm
+ s â S. In the last term for each
+ s â S the interpreted term T
+ computed in the previous step is looked for. The final set of subterms
+ located by the full pattern is the set of occurrences of
+ the interpreted T in the subterms s.
+
+ A full pattern can always be replaced by a simple pattern,
+ often at the cost of increased verbosity or decreased readability.
+ Example: the pattern
+ ⢠in match x+y in â_,_:?.(? ? % ?)
+ locates only the first occurrence of x+y
+ in the sequent x,y: nat ⢠âz,w:nat. (x+y) * (z+w) =
+ z * (x+y) + w * (x+y). The corresponding simple pattern
+ is ⢠â_,_:?.(? ? (? % ?) ?).
+
+ Every tactic that acts on subterms of the selected sequents have
+ a pattern argument for uniformity. To automatically generate a simple
+ pattern:
+
+ Select in the current goal the subterms to pass to the
+ tactic by using the mouse. In order to perform a multiple selection of
+ subterms, hold the Ctrl key while selecting every subterm after the
+ first one.
+ From the contextual menu select "Copy".
+ From the "Edit" or the contextual menu select
+ "Paste as pattern"
+
@@ -551,11 +666,6 @@
&reduction-kind;
::=
- demodulate
-
-
-
- |
normalize
Computes the βδιζ-normal form
@@ -588,6 +698,36 @@
+
+
+ auto-params
+ &TODO;
+
+ reduction-kind
+
+
+
+ &autoparams;
+ ::=
+ depth=&nat;
+ &TODO;
+
+
+
+ |
+ width=&nat;
+ &TODO;
+
+
+
+ |
+ &TODO;
+ &TODO;
+
+
+
+
+