X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_terms.xml;h=a1353b2f021aac59be2fe0896c2fbd827ab2795d;hb=7a9b394943d524181128816a4b02152aa79929fe;hp=bd2d8c9c9cdb8a5331487f08b8039f6e8d719589;hpb=f64818068a077b8ca8a29ebc547cc488946cf072;p=helm.git diff --git a/helm/software/matita/help/C/sec_terms.xml b/helm/software/matita/help/C/sec_terms.xml index bd2d8c9c9..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 @@ -393,6 +417,12 @@ &id; &id; [&id;]… n-ary constructor (binds the n arguments) + + + | + _ + any remaining constructor (ignoring its arguments) +
@@ -568,7 +598,7 @@ | - in match &term; + in match &path; [in [&id;[: &path;]]… [⊢ &path;]] @@ -584,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;〉〉 @@ -597,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 @@ -669,12 +719,6 @@ normalize Computes the βδιζ-normal form - - - | - reduce - Computes the βδιζ-normal form - | @@ -701,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