matita/help/C/sec_commands.xml

   1
   2 <!-- ============ Commands ====================== -->
   3 <chapter id="sec_commands">
   4  <title>Other commands</title>
   5  <sect1 id="command_alias">
   6    <title>alias</title>
   7    <para><userinput>alias id &quot;s&quot; = &quot;def&quot;</userinput></para>
   8    <para><userinput>alias symbol &quot;s&quot; (instance n) = &quot;def&quot;</userinput></para>
   9    <para><userinput>alias num (instance n) = &quot;def&quot;</userinput></para>
  10    <para>
  11      <variablelist>
  12        <varlistentry>
  13          <term>Synopsis:</term>
  14          <listitem>
  15            <para><emphasis role="bold">alias</emphasis>
  16             [<emphasis role="bold">id</emphasis> &qstring; <emphasis role="bold">=</emphasis> &qstring;
  17             | <emphasis role="bold">symbol</emphasis> &qstring; [<emphasis role="bold">(instance</emphasis> &nat;<emphasis role="bold">)</emphasis>] <emphasis role="bold">=</emphasis> &qstring;
  18             | <emphasis role="bold">num</emphasis> [<emphasis role="bold">(instance</emphasis> &nat;<emphasis role="bold">)</emphasis>] <emphasis role="bold">=</emphasis> &qstring;
  19             ]
  20            </para>
  21          </listitem>
  22        </varlistentry>
  23        <varlistentry>
  24          <term>Action:</term>
  25          <listitem>
  26            <para>Used to give an hint to the disambiguating parser.
  27             When the parser is faced to the identifier (or symbol)
  28             <command>s</command> or to any number, it will prefer
  29             interpretations that &quot;map <command>s</command> (or the
  30             number) to <command>def</command>&quot;. For identifiers,
  31             &quot;def&quot; is the URI of the interpretation.
  32             E.g.: <command>cic:/matita/nat/nat.ind#xpointer(1/1/1)</command>
  33             for the first constructor of the first inductive type defined
  34             in the block of inductive type(s)
  35             <command>cic:/matita/nat/nat.ind</command>.
  36             For symbols and numbers, &quot;def&quot; is the label used to
  37             mark the wanted
  38             <link linkend="interpretation">interpretation</link>.
  39            </para>
  40           <para>When a symbol or a number occurs several times in the
  41            term to be parsed, it is possible to give an hint only for the
  42            instance <command>n</command>. When the instance is omitted,
  43            the hint is valid for every occurrence.
  44           </para>
  45           <para>
  46            Hints are automatically inserted in the script by Matita every
  47            time the user is interactively asked a question to disambiguate
  48            a term. This way the user won't be posed the same question twice
  49            when the script will be executed again.</para>
  50          </listitem>
  51        </varlistentry>
  52      </variablelist>
  53    </para>
  54  </sect1>
  55  <sect1 id="command_check">
  56    <title>check</title>
  57    <para><userinput>check t</userinput></para>
  58    <para>
  59      <variablelist>
  60        <varlistentry>
  61          <term>Synopsis:</term>
  62          <listitem>
  63            <para><emphasis role="bold">check</emphasis> &term;</para>
  64          </listitem>
  65        </varlistentry>
  66        <varlistentry>
  67          <term>Action:</term>
  68          <listitem>
  69            <para>Opens a CIC browser window that shows <command>t</command>
  70             together with its type. The command is immediately removed from
  71             the script.</para>
  72          </listitem>
  73        </varlistentry>
  74      </variablelist>
  75    </para>
  76  </sect1>
  77  <sect1 id="command_coercion">
  78    <title>coercion</title>
  79    <para><userinput>coercion u</userinput></para>
  80    <para>
  81      <variablelist>
  82        <varlistentry>
  83          <term>Synopsis:</term>
  84          <listitem>
  85            <para><emphasis role="bold">coercion</emphasis> &uri;</para>
  86          </listitem>
  87        </varlistentry>
  88        <varlistentry>
  89          <term>Action:</term>
  90          <listitem>
  91            <para>Declares <command>u</command> as an implicit coercion
  92             from the type of its last argument (source)
  93             to its codomain (target). Every time a term <command>x</command>
  94             of type source is used with expected type target, Matita
  95             automatically replaces <command>x</command> with
  96             <command>(u ? … ? x)</command> to avoid a typing error.</para>
  97            <para>Implicit coercions are not displayed to the user:
  98             <command>(u ? … ? x)</command> is rendered simply
  99             as <command>x</command>.</para>
 100            <para>When a coercion <command>u</command> is declared
 101             from source <command>s</command> to target <command>t</command>
 102             and there is already a coercion <command>u'</command> of
 103             target <command>s</command> or source <command>t</command>,
 104             a composite implicit coercion is automatically computed
 105             by Matita.</para>
 106          </listitem>
 107        </varlistentry>
 108      </variablelist>
 109    </para>
 110  </sect1>
 111  <sect1 id="command_default">
 112    <title>default</title>
 113    <para><userinput>default &quot;s&quot; u<subscript>1</subscript> … u<subscript>n</subscript></userinput></para>
 114    <para>
 115      <variablelist>
 116        <varlistentry>
 117          <term>Synopsis:</term>
 118          <listitem>
 119            <para><emphasis role="bold">default</emphasis>
 120             &qstring; &uri; [&uri;]…
 121            </para>
 122          </listitem>
 123        </varlistentry>
 124        <varlistentry>
 125          <term>Action:</term>
 126          <listitem>
 127            <para>It registers a cluster of related definitions and
 128             theorems to be used by tactics and the rendering engine.
 129             Some functionalities of Matita are not available when some
 130             clusters have not been registered. Overloading a cluster
 131             registration is possible: the last registration will be the
 132             default one, but the previous ones are still in effect.</para>
 133            <para>
 134             <command>s</command> is an identifier of the cluster and
 135             <command>u<subscript>1</subscript> … u<subscript>n</subscript></command>
 136             are the URIs of the definitions and theorems of the cluster.
 137             The number <command>n</command> of required URIs depends on the
 138             cluster. The following clusters are supported.
 139            </para>
 140            <table>
 141             <title>clusters</title>
 142             <tgroup cols="6">
 143             <thead>
 144              <row>
 145               <entry>name</entry>
 146               <entry>expected object for 1st URI</entry>
 147               <entry>expected object for 2nd URI</entry>
 148               <entry>expected object for 3rd URI</entry>
 149               <entry>expected object for 4th URI</entry>
 150               <entry>expected object for 5th URI</entry>
 151               <entry>expected object for 6th URI</entry>
 152               <entry>expected object for 7th URI</entry>
 153               <entry>expected object for 8th URI</entry>
 154               <entry>expected object for 9th URI</entry>
 155               <entry>expected object for 10th URI</entry>
 156               <entry>expected object for 11th URI</entry>
 157              </row>
 158             </thead>
 159             <tbody>
 160              <row>
 161               <entry>equality</entry>
 162               <entry>an inductive type (say, of type <command>eq</command>) of type ∀A:Type.A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis> with one family parameter and one constructor of type ∀x:A.eq A x</entry>
 163               <entry>a theorem of type <emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>x,y:A.eq A x y <emphasis role="bold">→</emphasis> eq A y x</entry>
 164               <entry>a theorem of type <emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>x,y,z:A.eq A x y <emphasis role="bold">→</emphasis> eq A y z <emphasis role="bold">→</emphasis> eq A x z</entry>
 165               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A x y <emphasis role="bold">→</emphasis> P y</entry>
 166               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Prop</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A y x <emphasis role="bold">→</emphasis> P y</entry>
 167               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Set</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A x y <emphasis role="bold">→</emphasis> P y</entry>
 168               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Set</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A y x <emphasis role="bold">→</emphasis> P y</entry>
 169               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Type</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A x y <emphasis role="bold">→</emphasis> P y</entry>
 170               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>a.<emphasis role="bold">∀</emphasis> P:A <emphasis role="bold">→</emphasis> <emphasis role="bold">Type</emphasis>.P x <emphasis role="bold">→</emphasis> <emphasis role="bold">∀</emphasis>y.eq A y x <emphasis role="bold">→</emphasis> P y</entry>
 171               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>B.<emphasis role="bold">∀</emphasis> f:A <emphasis role="bold">→</emphasis> B.<emphasis role="bold">∀</emphasis>x,y:A.eq A x y <emphasis role="bold">→</emphasis> eq B (f x) (f y)</entry>
 172               <entry><emphasis role="bold">∀</emphasis>A.<emphasis role="bold">∀</emphasis>B.<emphasis role="bold">∀</emphasis> f:A <emphasis role="bold">→</emphasis> B.<emphasis role="bold">∀</emphasis>x,y:A.eq A x y <emphasis role="bold">→</emphasis> eq B (f y) (f x)</entry>
 173              </row>
 174              <row>
 175               <entry>true</entry>
 176               <entry>an inductive type of type <emphasis role="bold">Prop</emphasis> with only one constructor that has no arguments</entry>
 177               <entry/>
 178               <entry/>
 179               <entry/>
 180               <entry/>
 181              </row>
 182              <row>
 183               <entry>false</entry>
 184               <entry>an inductive type of type <emphasis role="bold">Prop</emphasis> without constructors</entry>
 185               <entry/>
 186               <entry/>
 187               <entry/>
 188               <entry/>
 189              </row>
 190              <row>
 191               <entry>absurd</entry>
 192               <entry>a theorem of type <emphasis role="bold">∀</emphasis>A:Prop.<emphasis role="bold">∀</emphasis>B:Prop.A <emphasis role="bold">→</emphasis> Not A <emphasis role="bold">→</emphasis> B</entry>
 193               <entry/>
 194               <entry/>
 195               <entry/>
 196               <entry/>
 197              </row>
 198             </tbody>
 199             </tgroup>
 200            </table>
 201          </listitem>
 202        </varlistentry>
 203      </variablelist>
 204    </para>
 205  </sect1>
 206  <sect1 id="command_hint">
 207    <title>hint</title>
 208    <para><userinput>hint</userinput></para>
 209    <para>
 210      <variablelist>
 211        <varlistentry>
 212          <term>Synopsis:</term>
 213          <listitem>
 214            <para><emphasis role="bold">hint</emphasis>
 215            </para>
 216          </listitem>
 217        </varlistentry>
 218        <varlistentry>
 219          <term>Action:</term>
 220          <listitem>
 221            <para>Displays a list of theorems that can be successfully
 222             applied to the current selected sequent. The command is
 223             removed from the script, but the window that displays the
 224             theorems allow to add to the script the application of the
 225             selected theorem.
 226            </para>
 227          </listitem>
 228        </varlistentry>
 229      </variablelist>
 230    </para>
 231  </sect1>
 232  <sect1 id="command_include">
 233    <title>include</title>
 234    <para><userinput>include &quot;s&quot;</userinput></para>
 235    <para>
 236      <variablelist>
 237        <varlistentry>
 238          <term>Synopsis:</term>
 239          <listitem>
 240            <para><emphasis role="bold">include</emphasis> &qstring;</para>
 241          </listitem>
 242        </varlistentry>
 243        <varlistentry>
 244          <term>Action:</term>
 245          <listitem>
 246            <para>Every <link linkend="command_coercion">coercion</link>,
 247             <link linkend="notation">notation</link> and
 248             <link linkend="interpretation">interpretation</link> that was active
 249             when the file <command>s</command> was compiled last time
 250             is made active. The same happens for declarations of
 251             <link linkend="command_default">default definitions and
 252             theorems</link> and disambiguation
 253             hints (<link linkend="command_alias">aliases</link>).
 254             On the contrary, theorem and definitions declared in a file can be
 255            immediately used without including it.</para>
 256           <para>The file <command>s</command> is automatically compiled
 257           if it is not compiled yet.
 258           </para>
 259          </listitem>
 260        </varlistentry>
 261      </variablelist>
 262    </para>
 263  </sect1>
 264  <sect1 id="command_include_first">
 265    <title>include' &quot;s&quot;</title>
 266    <para><userinput></userinput></para>
 267    <para>
 268      <variablelist>
 269        <varlistentry>
 270          <term>Synopsis:</term>
 271          <listitem>
 272            <para><emphasis role="bold">include'</emphasis> &qstring;</para>
 273          </listitem>
 274        </varlistentry>
 275        <varlistentry>
 276          <term>Action:</term>
 277          <listitem>
 278            <para>Not documented (&TODO;), do not use it.</para>
 279          </listitem>
 280        </varlistentry>
 281      </variablelist>
 282    </para>
 283  </sect1>
 284  <sect1 id="command_whelp">
 285    <title>whelp</title>
 286    <para><userinput>whelp locate &quot;s&quot;</userinput></para>
 287    <para><userinput>whelp hint t</userinput></para>
 288    <para><userinput>whelp elim t</userinput></para>
 289    <para><userinput>whelp match t</userinput></para>
 290    <para><userinput>whelp instance t</userinput></para>
 291    <para>
 292      <variablelist>
 293        <varlistentry>
 294          <term>Synopsis:</term>
 295          <listitem>
 296            <para><emphasis role="bold">whelp</emphasis>
 297             [<emphasis role="bold">locate</emphasis> &qstring;
 298             | <emphasis role="bold">hint</emphasis> &term;
 299             | <emphasis role="bold">elim</emphasis> &term;
 300             | <emphasis role="bold">match</emphasis> &term;
 301             | <emphasis role="bold">instance</emphasis> &term;
 302             ]
 303            </para>
 304          </listitem>
 305        </varlistentry>
 306        <varlistentry>
 307          <term>Action:</term>
 308          <listitem>
 309            <para>Performs the corresponding <link linkend="whelp">query</link>,
 310             showing the result in the CIC browser. The command is removed
 311             from the script.
 312            </para>
 313          </listitem>
 314        </varlistentry>
 315      </variablelist>
 316    </para>
 317  </sect1>
 318  <sect1 id="command_qed">
 319    <title>qed</title>
 320    <para><userinput></userinput></para>
 321    <para>
 322      <variablelist>
 323        <varlistentry>
 324          <term>Synopsis:</term>
 325          <listitem>
 326            <para><emphasis role="bold">qed</emphasis>
 327            </para>
 328          </listitem>
 329        </varlistentry>
 330        <varlistentry>
 331          <term>Action:</term>
 332          <listitem>
 333            <para>Saves and indexes the current interactive theorem or
 334             definition.
 335             In order to do this, the set of sequents still to be proved
 336             must be empty.</para>
 337          </listitem>
 338        </varlistentry>
 339      </variablelist>
 340    </para>
 341  </sect1>
 342 </chapter>
 343