]> matita.cs.unibo.it Git - helm.git/commitdiff
- added some documentation on the fwd tatcic
authorFerruccio Guidi <ferruccio.guidi@unibo.it>
Tue, 20 Jun 2006 10:51:22 +0000 (10:51 +0000)
committerFerruccio Guidi <ferruccio.guidi@unibo.it>
Tue, 20 Jun 2006 10:51:22 +0000 (10:51 +0000)
- lapply concrete imput syntax fixed

components/grafite_parser/grafiteParser.ml
matita/help/C/sec_tactics.xml

index cbaed19b099d148a85805b75745fc4675e9297cc..535e396a9324703959145a1e97b662ce9fc287e8 100644 (file)
@@ -199,7 +199,7 @@ EXTEND
       depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
       what = tactic_term; 
       to_what = OPT [ "to" ; t = tactic_term_list1 -> t ];
-      ident = OPT [ IDENT "as" ; ident = IDENT -> ident ] ->
+      ident = OPT [ "as" ; ident = IDENT -> ident ] ->
         let to_what = match to_what with None -> [] | Some to_what -> to_what in
         GrafiteAst.LApply (loc, depth, to_what, what, ident)
     | IDENT "left" -> GrafiteAst.Left loc
index 712ce837a524ec2cd360fc94ad45f12e04fdf5e2..c10d2bd337aabc49384f3c7984677369e751fce8 100644 (file)
@@ -750,7 +750,7 @@ its constructor takes no arguments.</para>
   <sect1 id="tac_fwd">
     <title>fwd</title>
     <titleabbrev>fwd</titleabbrev>
-    <para><userinput>fwd ...TODO</userinput></para>
+    <para><userinput>fwd H</userinput></para>
     <para>
       <variablelist>
         <varlistentry role="tactic.synopsis">
@@ -762,19 +762,29 @@ its constructor takes no arguments.</para>
         <varlistentry>
           <term>Pre-conditions:</term>
           <listitem>
-            <para>TODO.</para>
+            <para>
+              The type of <command>H</command> must be the premise of a
+               forward simplification theorem.
+           </para>
           </listitem>
         </varlistentry>
         <varlistentry>
           <term>Action:</term>
           <listitem>
-            <para>TODO.</para>
+            <para>
+            This tactic is under development.
+             It simplifies the current context by removing
+            <command>H</command> using the following methods:
+            forward application of a suitable simplification theorem (chosen
+             automatically) of which the type of <command>H</command> is a
+             premise, decomposition, rewriting. 
+           </para>
           </listitem>
         </varlistentry>
         <varlistentry>
           <term>New sequents to prove:</term>
           <listitem>
-            <para>TODO.</para>
+            <para>None.</para>
           </listitem>
         </varlistentry>
       </variablelist>