X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_terms.xml;h=a1353b2f021aac59be2fe0896c2fbd827ab2795d;hb=f4f44aa85f6d8ad07c44ce5890bd447f04b9c8a2;hp=65000b9ba8d0859ae25f08d1b04d8febfc12fe04;hpb=774c8d18f41e71ae7e26a90d726d10a6f95de1fe;p=helm.git
diff --git a/helm/software/matita/help/C/sec_terms.xml b/helm/software/matita/help/C/sec_terms.xml
index 65000b9ba..a1353b2f0 100644
--- a/helm/software/matita/help/C/sec_terms.xml
+++ b/helm/software/matita/help/C/sec_terms.xml
@@ -98,6 +98,30 @@
+
+ csymbol
+
+
+
+ &csymbol;
+ ::=
+ '&id;
+
+
+
+
+
+ symbol
+
+
+
+ &symbol;
+ ::=
+ â©â©None of the aboveâªâª
+
+
+
+
Terms
@@ -116,7 +140,7 @@
-->
-
+
Terms
@@ -285,7 +309,7 @@
|
match &term;
- [ in &term; ]
+ [ in &id; ]
[ return &term; ]
with
@@ -387,6 +411,18 @@
(&id; &id; [&id;]â¦)
n-ary constructor (binds the n arguments)
+
+
+ |
+ &id; &id; [&id;]â¦
+ n-ary constructor (binds the n arguments)
+
+
+
+ |
+ _
+ any remaining constructor (ignoring its arguments)
+
@@ -420,6 +456,7 @@
letrec &TODO;
&TODO;
+ &TODO;
[inductive|coinductive] &id; [&args2;]⦠: &term; â [|] [&id;:&term;] [| &id;:&term;]â¦
@@ -561,7 +598,7 @@
|
- in match &term;
+ in match &path;
[in
[&id;[: &path;]]â¦
[⢠&path;]]
@@ -577,7 +614,7 @@
&path;
::=
- â©â©any &sterm; whithout occurrences of Set, Prop, CProp, Type, &id;, &uri; and user provided notation; however, % is now an additional production for &sterm;âªâª
+ â©â©any &sterm; without occurrences of Set, Prop, CProp, Type, &id;, &uri; and user provided notation; however, % is now an additional production for &sterm;âªâª
@@ -590,6 +627,26 @@
that can be represented by ?.
+ Warning: the format for a path for a match ⦠with
+ expression is restricted to: match &path;
+ with
+ [
+ _
+ â
+ &path;
+ | â¦
+ |
+ _
+ â
+ &path;
+ ]
+ Its semantics is the following: the n-th
+ "_
+ â
+ &path;" branch is matched against the n-th constructor of the
+ inductive data type. The head λ-abstractions of &path; are matched
+ against the corresponding constructor arguments.
+
For instance, the path
â_,_:?.(? ? % ?)â(? ? ? %)
locates at once the subterms
@@ -662,12 +719,6 @@
normalize
Computes the βδιζ-normal form
-
-
- |
- reduce
- Computes the βδιζ-normal form
-
|
@@ -694,28 +745,93 @@
auto-params
- &TODO;
- reduction-kind
+ auto-params
&autoparams;
::=
+ [&simpleautoparam;]â¦
+ [by
+ &term; [,&term;]â¦]
+
+
+
+
+
+
+ simple-auto-param
+
+
+
+ &simpleautoparam;
+ ::=
depth=&nat;
- &TODO;
+ Give a bound to the depth of the search tree
|
width=&nat;
- &TODO;
+ The maximal width of the search tree
+
+
+
+ |
+ library
+ Search everywhere (not only in included files)
+
+
+
+ |
+ type
+ Try to close also goals of sort Type, otherwise only goals
+ living in sort Prop are attacked.
+
+
+
+
+ |
+ paramodulation
+ Try to close the goal performing unit-equality paramodulation
+
+
+
+
+ |
+ size=&nat;
+ The maximal number of nodes in the proof
+
+
+
+ |
+ timeout=&nat;
+ Timeout in seconds
+
+
+
+
+
+
+
+
+ justification
+
+ justification
+
+
+
+ &justification;
+ ::=
+ using &term;
+ Proof term manually provided
|
- &TODO;
- &TODO;
+ &autoparams;
+ Call automation