X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fhelp%2FC%2Fsec_terms.xml;h=082a5bb75f47b79d26820ac30506c11ceeb7abdd;hb=275a432d33c455d75725d5991e82b62e7d01f68d;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..082a5bb75 100644 --- a/helm/software/matita/help/C/sec_terms.xml +++ b/helm/software/matita/help/C/sec_terms.xml @@ -98,6 +98,18 @@ + + csymbol + + + + &csymbol; + ::= + '&id; + + + +
Terms @@ -285,7 +297,7 @@ | match &term; - [ in &term; ] + [ in &id; ] [ return &term; ] with @@ -387,6 +399,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 +444,7 @@ <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;]… @@ -561,7 +586,7 @@ <row> <entry/> <entry>|</entry> - <entry><emphasis role="bold">in match</emphasis> &term; + <entry><emphasis role="bold">in match</emphasis> &path; [<emphasis role="bold">in</emphasis> [&id;[<emphasis role="bold">:</emphasis> &path;]]… [<emphasis role="bold">⊢</emphasis> &path;]]</entry> @@ -577,7 +602,7 @@ <row> <entry id="grammar.path">&path;</entry> <entry>::=</entry> - <entry><emphasis>〈〈any &sterm; whithout occurrences of <emphasis role="bold">Set</emphasis>, <emphasis role="bold">Prop</emphasis>, <emphasis role="bold">CProp</emphasis>, <emphasis role="bold">Type</emphasis>, &id;, &uri; and user provided notation; however, <emphasis role="bold">%</emphasis> is now an additional production for &sterm;〉〉</emphasis></entry> + <entry><emphasis>〈〈any &sterm; without occurrences of <emphasis role="bold">Set</emphasis>, <emphasis role="bold">Prop</emphasis>, <emphasis role="bold">CProp</emphasis>, <emphasis role="bold">Type</emphasis>, &id;, &uri; and user provided notation; however, <emphasis role="bold">%</emphasis> is now an additional production for &sterm;〉〉</emphasis></entry> </row> </tbody> </tgroup> @@ -590,6 +615,26 @@ that can be represented by <emphasis role="bold">?</emphasis>. </para></listitem> </orderedlist> + <para>Warning: the format for a path for a <emphasis role="bold">match</emphasis> … <emphasis role="bold">with</emphasis> + expression is restricted to: <emphasis role="bold">match</emphasis> &path; + <emphasis role="bold">with</emphasis> + <emphasis role="bold">[</emphasis> + <emphasis role="bold">_</emphasis> + <emphasis role="bold">⇒</emphasis> + &path; + <emphasis role="bold">|</emphasis> … + <emphasis role="bold">|</emphasis> + <emphasis role="bold">_</emphasis> + <emphasis role="bold">⇒</emphasis> + &path; + <emphasis role="bold">]</emphasis> + Its semantics is the following: the n-th + "<emphasis role="bold">_</emphasis> + <emphasis role="bold">⇒</emphasis> + &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. + </para> <para>For instance, the path <userinput>∀_,_:?.(? ? % ?)→(? ? ? %)</userinput> locates at once the subterms @@ -662,12 +707,6 @@ <entry><emphasis role="bold">normalize</emphasis></entry> <entry>Computes the βδιζ-normal form</entry> </row> - <row> - <entry/> - <entry>|</entry> - <entry><emphasis role="bold">reduce</emphasis></entry> - <entry>Computes the βδιζ-normal form</entry> - </row> <row> <entry/> <entry>|</entry> @@ -694,28 +733,87 @@ <sect2 id="auto-params"> <title>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 + + + + + | + timeout=&nat; + Timeout in seconds + + + + +
+
+ + + justification + + justification + + + + &justification; + ::= + using &term; + Proof term manually provided | - &TODO; - &TODO; + &autoparams; + Call automation