<sect1 id="tac_decompose">
<title><emphasis role="bold">decompose</emphasis> &id; [&id;]… &intros-spec;</title>
<titleabbrev>decompose</titleabbrev>
- <para><userinput>decompose ???</userinput></para>
+ <para><userinput>
+ decompose (T<subscript>1</subscript> ... T<subscript>n</subscript>) H hips
+ </userinput></para>
<para>
<variablelist>
<varlistentry>
<term>Pre-conditions:</term>
<listitem>
- <para>TODO.</para>
+ <para>
+ <command>H</command> must inhabit one inductive type among
+ <command>
+ T<subscript>1</subscript> ... T<subscript>n</subscript>
+ </command>
+ and the types of a predefined list.
+ </para>
</listitem>
</varlistentry>
<varlistentry>
<term>Action:</term>
<listitem>
- <para>TODO.</para>
+ <para>
+ Runs <command>elim H hyps</command>, clears H and tries to run
+ itself recursively on each new identifier introduced by
+ <command>elim</command> in the opened sequents.
+ </para>
</listitem>
</varlistentry>
<varlistentry>
<term>New sequents to prove:</term>
<listitem>
- <para>TODO.</para>
+ <para>
+ The ones generated by all the <command>elim</command> tactics run.
+ </para>
</listitem>
</varlistentry>
</variablelist>
<sect1 id="tac_lapply">
<title><emphasis role="bold">lapply</emphasis> [<emphasis role="bold">depth=</emphasis>&nat;] &sterm; [<emphasis role="bold">to</emphasis> &sterm; [&sterm;]…] [<emphasis role="bold">using</emphasis> &id;]</title>
<titleabbrev>lapply</titleabbrev>
- <para><userinput>lapply ???</userinput></para>
+ <para><userinput>
+ lapply depth=d t
+ to t<subscript>1</subscript>, ..., t<subscript>n</subscript> using H
+ </userinput></para>
<para>
<variablelist>
<varlistentry>