1.1 --- a/doc-src/Ref/tactic.tex	Mon Sep 06 18:17:48 1999 +0200
     1.2 +++ b/doc-src/Ref/tactic.tex	Mon Sep 06 18:18:09 1999 +0200
     1.3 @@ -48,7 +48,7 @@
     1.4    elimination rules.  It resolves with a rule, proves its first premise by
     1.5    assumption, and finally \emph{deletes} that assumption from any new
     1.6    subgoals.  (To rotate a rule's premises,
     1.7 -  see \texttt{rotate_prems} in~\S\ref{MiscellaneousForwardRules}.)
     1.8 +  see \texttt{rotate_prems} in~{\S}\ref{MiscellaneousForwardRules}.)
     1.9  
    1.10  \item[\ttindexbold{dresolve_tac} {\it thms} {\it i}] 
    1.11    \index{forward proof}\index{destruct-resolution}
    1.12 @@ -170,12 +170,16 @@
    1.13  \index{tactics!resolution}\index{tactics!assumption}
    1.14  \index{tactics!meta-rewriting}
    1.15  \begin{ttbox} 
    1.16 -rtac     :      thm -> int -> tactic
    1.17 -etac     :      thm -> int -> tactic
    1.18 -dtac     :      thm -> int -> tactic
    1.19 -atac     :             int -> tactic
    1.20 -ares_tac : thm list -> int -> tactic
    1.21 -rewtac   :      thm ->        tactic
    1.22 +rtac     :      thm ->        int -> tactic
    1.23 +etac     :      thm ->        int -> tactic
    1.24 +dtac     :      thm ->        int -> tactic
    1.25 +ftac     :      thm ->        int -> tactic
    1.26 +atac     :                    int -> tactic
    1.27 +eatac    :      thm -> int -> int -> tactic
    1.28 +datac    :      thm -> int -> int -> tactic
    1.29 +fatac    :      thm -> int -> int -> tactic
    1.30 +ares_tac :      thm list   -> int -> tactic
    1.31 +rewtac   :      thm ->               tactic
    1.32  \end{ttbox}
    1.33  These abbreviate common uses of tactics.
    1.34  \begin{ttdescription}
    1.35 @@ -189,9 +193,25 @@
    1.36  abbreviates \hbox{\tt dresolve_tac [{\it thm}] {\it i}}, doing
    1.37  destruct-resolution.
    1.38  
    1.39 +\item[\ttindexbold{ftac} {\it thm} {\it i}] 
    1.40 +abbreviates \hbox{\tt forward_tac [{\it thm}] {\it i}}, doing
    1.41 +destruct-resolution without deleting the assumption.
    1.42 +
    1.43  \item[\ttindexbold{atac} {\it i}] 
    1.44  abbreviates \hbox{\tt assume_tac {\it i}}, doing proof by assumption.
    1.45  
    1.46 +\item[\ttindexbold{eatac} {\it thm} {\it j} {\it i}] 
    1.47 +performs \hbox{\tt etac {\it thm}} and then {\it j} times \texttt{atac}, 
    1.48 +solving additionally {\it j}~premises of the rule {\it thm} by assumption.
    1.49 +
    1.50 +\item[\ttindexbold{datac} {\it thm} {\it j} {\it i}] 
    1.51 +performs \hbox{\tt dtac {\it thm}} and then {\it j} times \texttt{atac}, 
    1.52 +solving additionally {\it j}~premises of the rule {\it thm} by assumption.
    1.53 +
    1.54 +\item[\ttindexbold{fatac} {\it thm} {\it j} {\it i}] 
    1.55 +performs \hbox{\tt ftac {\it thm}} and then {\it j} times \texttt{atac}, 
    1.56 +solving additionally {\it j}~premises of the rule {\it thm} by assumption.
    1.57 +
    1.58  \item[\ttindexbold{ares_tac} {\it thms} {\it i}] 
    1.59  tries proof by assumption and resolution; it abbreviates
    1.60  \begin{ttbox}
    1.61 @@ -224,7 +244,7 @@
    1.62  
    1.63  \item[\ttindexbold{cut_inst_tac} {\it insts} {\it thm} {\it i}]
    1.64    instantiates the {\it thm} with the instantiations {\it insts}, as
    1.65 -  described in \S\ref{res_inst_tac}.  It adds the resulting theorem as a
    1.66 +  described in {\S}\ref{res_inst_tac}.  It adds the resulting theorem as a
    1.67    new assumption to subgoal~$i$. 
    1.68  
    1.69  \item[\ttindexbold{subgoal_tac} {\it formula} {\it i}] 
    1.70 @@ -419,7 +439,7 @@
    1.71  
    1.72    Flex-flex constraints arise from difficult cases of higher-order
    1.73    unification.  To prevent this, use \ttindex{res_inst_tac} to instantiate
    1.74 -  some variables in a rule~(\S\ref{res_inst_tac}).  Normally flex-flex
    1.75 +  some variables in a rule~({\S}\ref{res_inst_tac}).  Normally flex-flex
    1.76    constraints can be ignored; they often disappear as unknowns get
    1.77    instantiated.
    1.78  \end{ttdescription}
    1.79 @@ -473,7 +493,7 @@
    1.80  
    1.81  \item[\ttindexbold{bimatch_tac}] 
    1.82  is like {\tt biresolve_tac}, but performs matching: unknowns in the
    1.83 -proof state are never updated (see~\S\ref{match_tac}).
    1.84 +proof state are never updated (see~{\S}\ref{match_tac}).
    1.85  
    1.86  \item[\ttindexbold{subgoals_of_brl}({\it flag},{\it rule})] 
    1.87  returns the number of new subgoals that bi-res\-o\-lu\-tion would yield for the