doc-src/Ref/tactic.tex
author oheimb
Wed, 12 Nov 1997 18:58:50 +0100
changeset 4223 f60e3d2c81d3
parent 3950 e9d5bcae8351
child 4276 a770eae2cdb0
permissions -rw-r--r--
added thin_refl to hyp_subst_tac
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
     1
%% $Id$
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
     2
\chapter{Tactics} \label{tactics}
3108
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
     3
\index{tactics|(} Tactics have type \mltydx{tactic}.  This is just an
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
     4
abbreviation for functions from theorems to theorem sequences, where
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
     5
the theorems represent states of a backward proof.  Tactics seldom
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
     6
need to be coded from scratch, as functions; instead they are
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
     7
expressed using basic tactics and tacticals.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
     8
2039
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
     9
This chapter only presents the primitive tactics.  Substantial proofs require
3950
e9d5bcae8351 \label{simp-chap} -> chap:simplification
nipkow
parents: 3561
diff changeset
    10
the power of simplification (Chapter~\ref{chap:simplification}) and classical
e9d5bcae8351 \label{simp-chap} -> chap:simplification
nipkow
parents: 3561
diff changeset
    11
reasoning (Chapter~\ref{chap:classical}).
2039
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
    12
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    13
\section{Resolution and assumption tactics}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    14
{\bf Resolution} is Isabelle's basic mechanism for refining a subgoal using
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    15
a rule.  {\bf Elim-resolution} is particularly suited for elimination
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    16
rules, while {\bf destruct-resolution} is particularly suited for
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    17
destruction rules.  The {\tt r}, {\tt e}, {\tt d} naming convention is
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    18
maintained for several different kinds of resolution tactics, as well as
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    19
the shortcuts in the subgoal module.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    20
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    21
All the tactics in this section act on a subgoal designated by a positive
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    22
integer~$i$.  They fail (by returning the empty sequence) if~$i$ is out of
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    23
range.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    24
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    25
\subsection{Resolution tactics}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    26
\index{resolution!tactics}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    27
\index{tactics!resolution|bold}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    28
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    29
resolve_tac  : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    30
eresolve_tac : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    31
dresolve_tac : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    32
forward_tac  : thm list -> int -> tactic 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    33
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    34
These perform resolution on a list of theorems, $thms$, representing a list
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    35
of object-rules.  When generating next states, they take each of the rules
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    36
in the order given.  Each rule may yield several next states, or none:
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    37
higher-order resolution may yield multiple resolvents.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    38
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    39
\item[\ttindexbold{resolve_tac} {\it thms} {\it i}] 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    40
  refines the proof state using the rules, which should normally be
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    41
  introduction rules.  It resolves a rule's conclusion with
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    42
  subgoal~$i$ of the proof state.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    43
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    44
\item[\ttindexbold{eresolve_tac} {\it thms} {\it i}] 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    45
  \index{elim-resolution}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    46
  performs elim-resolution with the rules, which should normally be
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    47
  elimination rules.  It resolves with a rule, solves its first premise by
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    48
  assumption, and finally {\em deletes\/} that assumption from any new
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    49
  subgoals.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    50
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    51
\item[\ttindexbold{dresolve_tac} {\it thms} {\it i}] 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    52
  \index{forward proof}\index{destruct-resolution}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    53
  performs destruct-resolution with the rules, which normally should
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    54
  be destruction rules.  This replaces an assumption by the result of
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    55
  applying one of the rules.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    56
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    57
\item[\ttindexbold{forward_tac}]\index{forward proof}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    58
  is like {\tt dresolve_tac} except that the selected assumption is not
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    59
  deleted.  It applies a rule to an assumption, adding the result as a new
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    60
  assumption.
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    61
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    62
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    63
\subsection{Assumption tactics}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    64
\index{tactics!assumption|bold}\index{assumptions!tactics for}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    65
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    66
assume_tac    : int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    67
eq_assume_tac : int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    68
\end{ttbox} 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    69
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    70
\item[\ttindexbold{assume_tac} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    71
attempts to solve subgoal~$i$ by assumption.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    72
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    73
\item[\ttindexbold{eq_assume_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    74
is like {\tt assume_tac} but does not use unification.  It succeeds (with a
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    75
{\em unique\/} next state) if one of the assumptions is identical to the
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    76
subgoal's conclusion.  Since it does not instantiate variables, it cannot
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    77
make other subgoals unprovable.  It is intended to be called from proof
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    78
strategies, not interactively.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    79
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    80
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    81
\subsection{Matching tactics} \label{match_tac}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    82
\index{tactics!matching}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    83
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    84
match_tac  : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    85
ematch_tac : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    86
dmatch_tac : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    87
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    88
These are just like the resolution tactics except that they never
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    89
instantiate unknowns in the proof state.  Flexible subgoals are not updated
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    90
willy-nilly, but are left alone.  Matching --- strictly speaking --- means
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    91
treating the unknowns in the proof state as constants; these tactics merely
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    92
discard unifiers that would update the proof state.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    93
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    94
\item[\ttindexbold{match_tac} {\it thms} {\it i}] 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
    95
refines the proof state using the rules, matching a rule's
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    96
conclusion with subgoal~$i$ of the proof state.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    97
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    98
\item[\ttindexbold{ematch_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
    99
is like {\tt match_tac}, but performs elim-resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   100
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   101
\item[\ttindexbold{dmatch_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   102
is like {\tt match_tac}, but performs destruct-resolution.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   103
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   105
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   106
\subsection{Resolution with instantiation} \label{res_inst_tac}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   107
\index{tactics!instantiation}\index{instantiation}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   108
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   109
res_inst_tac  : (string*string)list -> thm -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   110
eres_inst_tac : (string*string)list -> thm -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   111
dres_inst_tac : (string*string)list -> thm -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   112
forw_inst_tac : (string*string)list -> thm -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   113
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   114
These tactics are designed for applying rules such as substitution and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   115
induction, which cause difficulties for higher-order unification.  The
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   116
tactics accept explicit instantiations for unknowns in the rule ---
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   117
typically, in the rule's conclusion.  Each instantiation is a pair
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   118
{\tt($v$,$e$)}, where $v$ is an unknown {\em without\/} its leading
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   119
question mark!
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   120
\begin{itemize}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   121
\item If $v$ is the type unknown {\tt'a}, then
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   122
the rule must contain a type unknown \verb$?'a$ of some
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   123
sort~$s$, and $e$ should be a type of sort $s$.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   124
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   125
\item If $v$ is the unknown {\tt P}, then
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   126
the rule must contain an unknown \verb$?P$ of some type~$\tau$,
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   127
and $e$ should be a term of some type~$\sigma$ such that $\tau$ and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   128
$\sigma$ are unifiable.  If the unification of $\tau$ and $\sigma$
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   129
instantiates any type unknowns in $\tau$, these instantiations
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   130
are recorded for application to the rule.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   131
\end{itemize}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   132
Types are instantiated before terms.  Because type instantiations are
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   133
inferred from term instantiations, explicit type instantiations are seldom
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   134
necessary --- if \verb$?t$ has type \verb$?'a$, then the instantiation list
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   135
\verb$[("'a","bool"),("t","True")]$ may be simplified to
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   136
\verb$[("t","True")]$.  Type unknowns in the proof state may cause
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   137
failure because the tactics cannot instantiate them.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   138
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   139
The instantiation tactics act on a given subgoal.  Terms in the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   140
instantiations are type-checked in the context of that subgoal --- in
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   141
particular, they may refer to that subgoal's parameters.  Any unknowns in
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   142
the terms receive subscripts and are lifted over the parameters; thus, you
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   143
may not refer to unknowns in the subgoal.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   144
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   145
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   146
\item[\ttindexbold{res_inst_tac} {\it insts} {\it thm} {\it i}]
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   147
instantiates the rule {\it thm} with the instantiations {\it insts}, as
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   148
described above, and then performs resolution on subgoal~$i$.  Resolution
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   149
typically causes further instantiations; you need not give explicit
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   150
instantiations for every unknown in the rule.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   151
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   152
\item[\ttindexbold{eres_inst_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   153
is like {\tt res_inst_tac}, but performs elim-resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   154
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   155
\item[\ttindexbold{dres_inst_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   156
is like {\tt res_inst_tac}, but performs destruct-resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   157
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   158
\item[\ttindexbold{forw_inst_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   159
is like {\tt dres_inst_tac} except that the selected assumption is not
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   160
deleted.  It applies the instantiated rule to an assumption, adding the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   161
result as a new assumption.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   162
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   163
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   164
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   165
\section{Other basic tactics}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   166
\subsection{Tactic shortcuts}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   167
\index{shortcuts!for tactics}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   168
\index{tactics!resolution}\index{tactics!assumption}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   169
\index{tactics!meta-rewriting}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   170
\begin{ttbox} 
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   171
rtac     :      thm -> int -> tactic
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   172
etac     :      thm -> int -> tactic
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   173
dtac     :      thm -> int -> tactic
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   174
atac     :             int -> tactic
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   175
ares_tac : thm list -> int -> tactic
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   176
rewtac   :      thm ->        tactic
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   177
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   178
These abbreviate common uses of tactics.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   179
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   180
\item[\ttindexbold{rtac} {\it thm} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   181
abbreviates \hbox{\tt resolve_tac [{\it thm}] {\it i}}, doing resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   182
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   183
\item[\ttindexbold{etac} {\it thm} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   184
abbreviates \hbox{\tt eresolve_tac [{\it thm}] {\it i}}, doing elim-resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   185
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   186
\item[\ttindexbold{dtac} {\it thm} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   187
abbreviates \hbox{\tt dresolve_tac [{\it thm}] {\it i}}, doing
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   188
destruct-resolution.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   189
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   190
\item[\ttindexbold{atac} {\it i}] 
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   191
abbreviates \hbox{\tt assume_tac {\it i}}, doing proof by assumption.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   192
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   193
\item[\ttindexbold{ares_tac} {\it thms} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   194
tries proof by assumption and resolution; it abbreviates
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   195
\begin{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   196
assume_tac {\it i} ORELSE resolve_tac {\it thms} {\it i}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   197
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   198
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   199
\item[\ttindexbold{rewtac} {\it def}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   200
abbreviates \hbox{\tt rewrite_goals_tac [{\it def}]}, unfolding a definition.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   201
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   202
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   203
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   204
\subsection{Inserting premises and facts}\label{cut_facts_tac}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   205
\index{tactics!for inserting facts}\index{assumptions!inserting}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   206
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   207
cut_facts_tac : thm list -> int -> tactic
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   208
cut_inst_tac  : (string*string)list -> thm -> int -> tactic
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   209
subgoal_tac   : string -> int -> tactic
457
8577bc1c4e1b documented subgoals_tac
lcp
parents: 332
diff changeset
   210
subgoal_tacs  : string list -> int -> tactic
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   211
\end{ttbox}
2039
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   212
These tactics add assumptions to a subgoal.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   213
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   214
\item[\ttindexbold{cut_facts_tac} {\it thms} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   215
  adds the {\it thms} as new assumptions to subgoal~$i$.  Once they have
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   216
  been inserted as assumptions, they become subject to tactics such as {\tt
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   217
    eresolve_tac} and {\tt rewrite_goals_tac}.  Only rules with no premises
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   218
  are inserted: Isabelle cannot use assumptions that contain $\Imp$
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   219
  or~$\Forall$.  Sometimes the theorems are premises of a rule being
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   220
  derived, returned by~{\tt goal}; instead of calling this tactic, you
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   221
  could state the goal with an outermost meta-quantifier.
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   222
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   223
\item[\ttindexbold{cut_inst_tac} {\it insts} {\it thm} {\it i}]
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   224
  instantiates the {\it thm} with the instantiations {\it insts}, as
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   225
  described in \S\ref{res_inst_tac}.  It adds the resulting theorem as a
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   226
  new assumption to subgoal~$i$. 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   227
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   228
\item[\ttindexbold{subgoal_tac} {\it formula} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   229
adds the {\it formula} as a assumption to subgoal~$i$, and inserts the same
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   230
{\it formula} as a new subgoal, $i+1$.
457
8577bc1c4e1b documented subgoals_tac
lcp
parents: 332
diff changeset
   231
8577bc1c4e1b documented subgoals_tac
lcp
parents: 332
diff changeset
   232
\item[\ttindexbold{subgoals_tac} {\it formulae} {\it i}] 
8577bc1c4e1b documented subgoals_tac
lcp
parents: 332
diff changeset
   233
  uses {\tt subgoal_tac} to add the members of the list of {\it
8577bc1c4e1b documented subgoals_tac
lcp
parents: 332
diff changeset
   234
    formulae} as assumptions to subgoal~$i$. 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   235
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   236
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   237
2039
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   238
\subsection{``Putting off'' a subgoal}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   239
\begin{ttbox} 
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   240
defer_tac : int -> tactic
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   241
\end{ttbox}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   242
\begin{ttdescription}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   243
\item[\ttindexbold{defer_tac} {\it i}] 
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   244
  moves subgoal~$i$ to the last position in the proof state.  It can be
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   245
  useful when correcting a proof script: if the tactic given for subgoal~$i$
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   246
  fails, calling {\tt defer_tac} instead will let you continue with the rest
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   247
  of the script.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   248
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   249
  The tactic fails if subgoal~$i$ does not exist or if the proof state
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   250
  contains type unknowns. 
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   251
\end{ttdescription}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   252
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   253
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   254
\subsection{Definitions and meta-level rewriting}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   255
\index{tactics!meta-rewriting|bold}\index{meta-rewriting|bold}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   256
\index{definitions}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   257
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   258
Definitions in Isabelle have the form $t\equiv u$, where $t$ is typically a
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   259
constant or a constant applied to a list of variables, for example $\it
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   260
sqr(n)\equiv n\times n$.  (Conditional definitions, $\phi\Imp t\equiv u$,
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   261
are not supported.)  {\bf Unfolding} the definition ${t\equiv u}$ means using
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   262
it as a rewrite rule, replacing~$t$ by~$u$ throughout a theorem.  {\bf
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   263
Folding} $t\equiv u$ means replacing~$u$ by~$t$.  Rewriting continues until
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   264
no rewrites are applicable to any subterm.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   265
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   266
There are rules for unfolding and folding definitions; Isabelle does not do
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   267
this automatically.  The corresponding tactics rewrite the proof state,
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   268
yielding a single next state.  See also the {\tt goalw} command, which is the
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   269
easiest way of handling definitions.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   270
\begin{ttbox} 
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   271
rewrite_goals_tac : thm list -> tactic
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   272
rewrite_tac       : thm list -> tactic
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   273
fold_goals_tac    : thm list -> tactic
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   274
fold_tac          : thm list -> tactic
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   275
\end{ttbox}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   276
\begin{ttdescription}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   277
\item[\ttindexbold{rewrite_goals_tac} {\it defs}]  
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   278
unfolds the {\it defs} throughout the subgoals of the proof state, while
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   279
leaving the main goal unchanged.  Use \ttindex{SELECT_GOAL} to restrict it to a
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   280
particular subgoal.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   281
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   282
\item[\ttindexbold{rewrite_tac} {\it defs}]  
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   283
unfolds the {\it defs} throughout the proof state, including the main goal
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   284
--- not normally desirable!
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   285
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   286
\item[\ttindexbold{fold_goals_tac} {\it defs}]  
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   287
folds the {\it defs} throughout the subgoals of the proof state, while
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   288
leaving the main goal unchanged.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   289
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   290
\item[\ttindexbold{fold_tac} {\it defs}]  
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   291
folds the {\it defs} throughout the proof state.
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   292
\end{ttdescription}
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   293
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   294
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   295
\subsection{Theorems useful with tactics}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   296
\index{theorems!of pure theory}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   297
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   298
asm_rl: thm 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   299
cut_rl: thm 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   300
\end{ttbox}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   301
\begin{ttdescription}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   302
\item[\tdx{asm_rl}] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   303
is $\psi\Imp\psi$.  Under elim-resolution it does proof by assumption, and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   304
\hbox{\tt eresolve_tac (asm_rl::{\it thms}) {\it i}} is equivalent to
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   305
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   306
assume_tac {\it i}  ORELSE  eresolve_tac {\it thms} {\it i}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   307
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   308
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   309
\item[\tdx{cut_rl}] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   310
is $\List{\psi\Imp\theta,\psi}\Imp\theta$.  It is useful for inserting
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   311
assumptions; it underlies {\tt forward_tac}, {\tt cut_facts_tac}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   312
and {\tt subgoal_tac}.
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   313
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   314
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   315
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   316
\section{Obscure tactics}
1212
7059356e18e0 added rotate_tac
nipkow
parents: 457
diff changeset
   317
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   318
\subsection{Renaming parameters in a goal} \index{parameters!renaming}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   319
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   320
rename_tac        : string -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   321
rename_last_tac   : string -> string list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   322
Logic.set_rename_prefix : string -> unit
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   323
Logic.auto_rename       : bool ref      \hfill{\bf initially false}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   324
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   325
When creating a parameter, Isabelle chooses its name by matching variable
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   326
names via the object-rule.  Given the rule $(\forall I)$ formalized as
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   327
$\left(\Forall x. P(x)\right) \Imp \forall x.P(x)$, Isabelle will note that
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   328
the $\Forall$-bound variable in the premise has the same name as the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   329
$\forall$-bound variable in the conclusion.  
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   330
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   331
Sometimes there is insufficient information and Isabelle chooses an
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   332
arbitrary name.  The renaming tactics let you override Isabelle's choice.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   333
Because renaming parameters has no logical effect on the proof state, the
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   334
{\tt by} command prints the message {\tt Warning:\ same as previous
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   335
level}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   336
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   337
Alternatively, you can suppress the naming mechanism described above and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   338
have Isabelle generate uniform names for parameters.  These names have the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   339
form $p${\tt a}, $p${\tt b}, $p${\tt c},~\ldots, where $p$ is any desired
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   340
prefix.  They are ugly but predictable.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   341
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   342
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   343
\item[\ttindexbold{rename_tac} {\it str} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   344
interprets the string {\it str} as a series of blank-separated variable
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   345
names, and uses them to rename the parameters of subgoal~$i$.  The names
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   346
must be distinct.  If there are fewer names than parameters, then the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   347
tactic renames the innermost parameters and may modify the remaining ones
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   348
to ensure that all the parameters are distinct.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   349
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   350
\item[\ttindexbold{rename_last_tac} {\it prefix} {\it suffixes} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   351
generates a list of names by attaching each of the {\it suffixes\/} to the 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   352
{\it prefix}.  It is intended for coding structural induction tactics,
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   353
where several of the new parameters should have related names.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   354
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   355
\item[\ttindexbold{Logic.set_rename_prefix} {\it prefix};] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   356
sets the prefix for uniform renaming to~{\it prefix}.  The default prefix
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   357
is {\tt"k"}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   358
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   359
\item[\ttindexbold{Logic.auto_rename} := true;] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   360
makes Isabelle generate uniform names for parameters. 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   361
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   362
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   363
2612
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   364
\subsection{Manipulating assumptions}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   365
\index{assumptions!rotating}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   366
\begin{ttbox} 
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   367
thin_tac   : string -> int -> tactic
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   368
rotate_tac : int -> int -> tactic
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   369
\end{ttbox}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   370
\begin{ttdescription}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   371
\item[\ttindexbold{thin_tac} {\it formula} $i$]  
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   372
\index{assumptions!deleting}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   373
deletes the specified assumption from subgoal $i$.  Often the assumption
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   374
can be abbreviated, replacing subformul{\ae} by unknowns; the first matching
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   375
assumption will be deleted.  Removing useless assumptions from a subgoal
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   376
increases its readability and can make search tactics run faster.
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   377
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   378
\item[\ttindexbold{rotate_tac} $n$ $i$]  
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   379
\index{assumptions!rotating}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   380
rotates the assumptions of subgoal $i$ by $n$ positions: from right to left
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   381
if $n$ is positive, and from left to right if $n$ is negative.  This is 
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   382
sometimes necessary in connection with \ttindex{asm_full_simp_tac}, which 
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   383
processes assumptions from left to right.
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   384
\end{ttdescription}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   385
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   386
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   387
\subsection{Tidying the proof state}
3400
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   388
\index{duplicate subgoals!removing}
2612
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   389
\index{parameters!removing unused}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   390
\index{flex-flex constraints}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   391
\begin{ttbox} 
3400
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   392
distinct_subgoals_tac : tactic
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   393
prune_params_tac      : tactic
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   394
flexflex_tac          : tactic
2612
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   395
\end{ttbox}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   396
\begin{ttdescription}
3400
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   397
\item[\ttindexbold{distinct_subgoals_tac}]  
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   398
  removes duplicate subgoals from a proof state.  (These arise especially
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   399
  in \ZF{}, where the subgoals are essentially type constraints.)
80c979e0d42f Documented the new distinct_subgoals_tac
paulson
parents: 3108
diff changeset
   400
2612
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   401
\item[\ttindexbold{prune_params_tac}]  
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   402
  removes unused parameters from all subgoals of the proof state.  It works
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   403
  by rewriting with the theorem $(\Forall x. V)\equiv V$.  This tactic can
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   404
  make the proof state more readable.  It is used with
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   405
  \ttindex{rule_by_tactic} to simplify the resulting theorem.
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   406
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   407
\item[\ttindexbold{flexflex_tac}]  
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   408
  removes all flex-flex pairs from the proof state by applying the trivial
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   409
  unifier.  This drastic step loses information, and should only be done as
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   410
  the last step of a proof.
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   411
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   412
  Flex-flex constraints arise from difficult cases of higher-order
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   413
  unification.  To prevent this, use \ttindex{res_inst_tac} to instantiate
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   414
  some variables in a rule~(\S\ref{res_inst_tac}).  Normally flex-flex
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   415
  constraints can be ignored; they often disappear as unknowns get
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   416
  instantiated.
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   417
\end{ttdescription}
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   418
28232396b60e Documented thin_tac
paulson
parents: 2039
diff changeset
   419
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   420
\subsection{Composition: resolution without lifting}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   421
\index{tactics!for composition}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   422
\begin{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   423
compose_tac: (bool * thm * int) -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   424
\end{ttbox}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   425
{\bf Composing} two rules means resolving them without prior lifting or
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   426
renaming of unknowns.  This low-level operation, which underlies the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   427
resolution tactics, may occasionally be useful for special effects.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   428
A typical application is \ttindex{res_inst_tac}, which lifts and instantiates a
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   429
rule, then passes the result to {\tt compose_tac}.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   430
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   431
\item[\ttindexbold{compose_tac} ($flag$, $rule$, $m$) $i$] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   432
refines subgoal~$i$ using $rule$, without lifting.  The $rule$ is taken to
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   433
have the form $\List{\psi@1; \ldots; \psi@m} \Imp \psi$, where $\psi$ need
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   434
not be atomic; thus $m$ determines the number of new subgoals.  If
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   435
$flag$ is {\tt true} then it performs elim-resolution --- it solves the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   436
first premise of~$rule$ by assumption and deletes that assumption.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   437
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   438
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   439
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   440
\section{Managing lots of rules}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   441
These operations are not intended for interactive use.  They are concerned
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   442
with the processing of large numbers of rules in automatic proof
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   443
strategies.  Higher-order resolution involving a long list of rules is
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   444
slow.  Filtering techniques can shorten the list of rules given to
2039
79c86b966257 Documented defer_tac and moved back the obsolete tactics like fold_tac
paulson
parents: 1212
diff changeset
   445
resolution, and can also detect whether a subgoal is too flexible,
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   446
with too many rules applicable.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   447
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   448
\subsection{Combined resolution and elim-resolution} \label{biresolve_tac}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   449
\index{tactics!resolution}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   450
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   451
biresolve_tac   : (bool*thm)list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   452
bimatch_tac     : (bool*thm)list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   453
subgoals_of_brl : bool*thm -> int
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   454
lessb           : (bool*thm) * (bool*thm) -> bool
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   455
\end{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   456
{\bf Bi-resolution} takes a list of $\it (flag,rule)$ pairs.  For each
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   457
pair, it applies resolution if the flag is~{\tt false} and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   458
elim-resolution if the flag is~{\tt true}.  A single tactic call handles a
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   459
mixture of introduction and elimination rules.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   460
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   461
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   462
\item[\ttindexbold{biresolve_tac} {\it brls} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   463
refines the proof state by resolution or elim-resolution on each rule, as
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   464
indicated by its flag.  It affects subgoal~$i$ of the proof state.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   465
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   466
\item[\ttindexbold{bimatch_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   467
is like {\tt biresolve_tac}, but performs matching: unknowns in the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   468
proof state are never updated (see~\S\ref{match_tac}).
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   469
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   470
\item[\ttindexbold{subgoals_of_brl}({\it flag},{\it rule})] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   471
returns the number of new subgoals that bi-resolution would yield for the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   472
pair (if applied to a suitable subgoal).  This is $n$ if the flag is
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   473
{\tt false} and $n-1$ if the flag is {\tt true}, where $n$ is the number
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   474
of premises of the rule.  Elim-resolution yields one fewer subgoal than
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   475
ordinary resolution because it solves the major premise by assumption.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   476
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   477
\item[\ttindexbold{lessb} ({\it brl1},{\it brl2})] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   478
returns the result of 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   479
\begin{ttbox}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   480
subgoals_of_brl{\it brl1} < subgoals_of_brl{\it brl2}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   481
\end{ttbox}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   482
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   483
Note that \hbox{\tt sort lessb {\it brls}} sorts a list of $\it
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   484
(flag,rule)$ pairs by the number of new subgoals they will yield.  Thus,
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   485
those that yield the fewest subgoals should be tried first.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   486
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   487
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   488
\subsection{Discrimination nets for fast resolution}\label{filt_resolve_tac}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   489
\index{discrimination nets|bold}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   490
\index{tactics!resolution}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   491
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   492
net_resolve_tac  : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   493
net_match_tac    : thm list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   494
net_biresolve_tac: (bool*thm) list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   495
net_bimatch_tac  : (bool*thm) list -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   496
filt_resolve_tac : thm list -> int -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   497
could_unify      : term*term->bool
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   498
filter_thms      : (term*term->bool) -> int*term*thm list -> thm list
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   499
\end{ttbox}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   500
The module {\tt Net} implements a discrimination net data structure for
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   501
fast selection of rules \cite[Chapter 14]{charniak80}.  A term is
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   502
classified by the symbol list obtained by flattening it in preorder.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   503
The flattening takes account of function applications, constants, and free
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   504
and bound variables; it identifies all unknowns and also regards
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   505
\index{lambda abs@$\lambda$-abstractions}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   506
$\lambda$-abstractions as unknowns, since they could $\eta$-contract to
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   507
anything.  
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   508
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   509
A discrimination net serves as a polymorphic dictionary indexed by terms.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   510
The module provides various functions for inserting and removing items from
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   511
nets.  It provides functions for returning all items whose term could match
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   512
or unify with a target term.  The matching and unification tests are
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   513
overly lax (due to the identifications mentioned above) but they serve as
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   514
useful filters.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   515
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   516
A net can store introduction rules indexed by their conclusion, and
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   517
elimination rules indexed by their major premise.  Isabelle provides
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   518
several functions for `compiling' long lists of rules into fast
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   519
resolution tactics.  When supplied with a list of theorems, these functions
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   520
build a discrimination net; the net is used when the tactic is applied to a
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   521
goal.  To avoid repeatedly constructing the nets, use currying: bind the
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   522
resulting tactics to \ML{} identifiers.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   523
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   524
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   525
\item[\ttindexbold{net_resolve_tac} {\it thms}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   526
builds a discrimination net to obtain the effect of a similar call to {\tt
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   527
resolve_tac}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   528
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   529
\item[\ttindexbold{net_match_tac} {\it thms}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   530
builds a discrimination net to obtain the effect of a similar call to {\tt
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   531
match_tac}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   532
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   533
\item[\ttindexbold{net_biresolve_tac} {\it brls}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   534
builds a discrimination net to obtain the effect of a similar call to {\tt
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   535
biresolve_tac}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   536
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   537
\item[\ttindexbold{net_bimatch_tac} {\it brls}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   538
builds a discrimination net to obtain the effect of a similar call to {\tt
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   539
bimatch_tac}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   540
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   541
\item[\ttindexbold{filt_resolve_tac} {\it thms} {\it maxr} {\it i}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   542
uses discrimination nets to extract the {\it thms} that are applicable to
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   543
subgoal~$i$.  If more than {\it maxr\/} theorems are applicable then the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   544
tactic fails.  Otherwise it calls {\tt resolve_tac}.  
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   545
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   546
This tactic helps avoid runaway instantiation of unknowns, for example in
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   547
type inference.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   548
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   549
\item[\ttindexbold{could_unify} ({\it t},{\it u})] 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   550
returns {\tt false} if~$t$ and~$u$ are `obviously' non-unifiable, and
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   551
otherwise returns~{\tt true}.  It assumes all variables are distinct,
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   552
reporting that {\tt ?a=?a} may unify with {\tt 0=1}.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   553
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   554
\item[\ttindexbold{filter_thms} $could\; (limit,prem,thms)$] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   555
returns the list of potentially resolvable rules (in {\it thms\/}) for the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   556
subgoal {\it prem}, using the predicate {\it could\/} to compare the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   557
conclusion of the subgoal with the conclusion of each rule.  The resulting list
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   558
is no longer than {\it limit}.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   559
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   560
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   561
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   562
\section{Programming tools for proof strategies}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   563
Do not consider using the primitives discussed in this section unless you
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   564
really need to code tactics from scratch.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   565
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   566
\subsection{Operations on type {\tt tactic}}
3561
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   567
\index{tactics!primitives for coding} A tactic maps theorems to sequences of
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   568
theorems.  The type constructor for sequences (lazy lists) is called
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   569
\mltydx{Sequence.seq}.  To simplify the types of tactics and tacticals,
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   570
Isabelle defines a type abbreviation:
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   571
\begin{ttbox} 
3108
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
   572
type tactic = thm -> thm Sequence.seq
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   573
\end{ttbox} 
3108
335efc3f5632 misc updates, tuning, cleanup;
wenzelm
parents: 2612
diff changeset
   574
The following operations provide means for coding tactics in a clean style.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   575
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   576
PRIMITIVE :                  (thm -> thm) -> tactic  
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   577
SUBGOAL   : ((term*int) -> tactic) -> int -> tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   578
\end{ttbox} 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   579
\begin{ttdescription}
3561
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   580
\item[\ttindexbold{PRIMITIVE} $f$] packages the meta-rule~$f$ as a tactic that
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   581
  applies $f$ to the proof state and returns the result as a one-element
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   582
  sequence.  If $f$ raises an exception, then the tactic's result is the empty
329441e7eeee Removal of tactical STATE
paulson
parents: 3400
diff changeset
   583
  sequence.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   584
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   585
\item[\ttindexbold{SUBGOAL} $f$ $i$] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   586
extracts subgoal~$i$ from the proof state as a term~$t$, and computes a
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   587
tactic by calling~$f(t,i)$.  It applies the resulting tactic to the same
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   588
state.  The tactic body is expressed using tactics and tacticals, but may
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   589
peek at a particular subgoal:
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   590
\begin{ttbox} 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   591
SUBGOAL (fn (t,i) => {\it tactic-valued expression})
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   592
\end{ttbox} 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   593
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   594
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   595
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   596
\subsection{Tracing}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   597
\index{tactics!tracing}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   598
\index{tracing!of tactics}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   599
\begin{ttbox} 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   600
pause_tac: tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   601
print_tac: tactic
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   602
\end{ttbox}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   603
These tactics print tracing information when they are applied to a proof
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   604
state.  Their output may be difficult to interpret.  Note that certain of
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   605
the searching tacticals, such as {\tt REPEAT}, have built-in tracing
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   606
options.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   607
\begin{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   608
\item[\ttindexbold{pause_tac}] 
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   609
prints {\footnotesize\tt** Press RETURN to continue:} and then reads a line
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   610
from the terminal.  If this line is blank then it returns the proof state
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   611
unchanged; otherwise it fails (which may terminate a repetition).
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   612
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   613
\item[\ttindexbold{print_tac}] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   614
returns the proof state unchanged, with the side effect of printing it at
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   615
the terminal.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   616
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   617
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   618
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   619
\section{Sequences}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   620
\index{sequences (lazy lists)|bold}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   621
The module {\tt Sequence} declares a type of lazy lists.  It uses
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   622
Isabelle's type \mltydx{option} to represent the possible presence
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   623
(\ttindexbold{Some}) or absence (\ttindexbold{None}) of
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   624
a value:
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   625
\begin{ttbox}
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   626
datatype 'a option = None  |  Some of 'a;
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   627
\end{ttbox}
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   628
For clarity, the module name {\tt Sequence} is omitted from the signature
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   629
specifications below; for instance, {\tt null} appears instead of {\tt
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   630
  Sequence.null}.
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   631
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   632
\subsection{Basic operations on sequences}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   633
\begin{ttbox} 
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   634
null   : 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   635
seqof  : (unit -> ('a * 'a seq) option) -> 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   636
single : 'a -> 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   637
pull   : 'a seq -> ('a * 'a seq) option
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   638
\end{ttbox}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   639
\begin{ttdescription}
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   640
\item[Sequence.null] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   641
is the empty sequence.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   642
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   643
\item[\tt Sequence.seqof (fn()=> Some($x$,$s$))] 
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   644
constructs the sequence with head~$x$ and tail~$s$, neither of which is
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   645
evaluated.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   646
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   647
\item[Sequence.single $x$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   648
constructs the sequence containing the single element~$x$.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   649
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   650
\item[Sequence.pull $s$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   651
returns {\tt None} if the sequence is empty and {\tt Some($x$,$s'$)} if the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   652
sequence has head~$x$ and tail~$s'$.  Warning: calling \hbox{Sequence.pull
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   653
$s$} again will {\it recompute\/} the value of~$x$; it is not stored!
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   654
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   655
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   656
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   657
\subsection{Converting between sequences and lists}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   658
\begin{ttbox} 
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   659
chop      : int * 'a seq -> 'a list * 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   660
list_of_s : 'a seq -> 'a list
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   661
s_of_list : 'a list -> 'a seq
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   662
\end{ttbox}
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   663
\begin{ttdescription}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   664
\item[Sequence.chop($n$,$s$)] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   665
returns the first~$n$ elements of~$s$ as a list, paired with the remaining
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   666
elements of~$s$.  If $s$ has fewer than~$n$ elements, then so will the
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   667
list.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   668
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   669
\item[Sequence.list_of_s $s$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   670
returns the elements of~$s$, which must be finite, as a list.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   671
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   672
\item[Sequence.s_of_list $l$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   673
creates a sequence containing the elements of~$l$.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   674
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   675
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   676
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   677
\subsection{Combining sequences}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   678
\begin{ttbox} 
286
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   679
append     : 'a seq * 'a seq -> 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   680
interleave : 'a seq * 'a seq -> 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   681
flats      : 'a seq seq -> 'a seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   682
maps       : ('a -> 'b) -> 'a seq -> 'b seq
e7efbf03562b first draft of Springer book
lcp
parents: 104
diff changeset
   683
filters    : ('a -> bool) -> 'a seq -> 'a seq
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   684
\end{ttbox} 
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   685
\begin{ttdescription}
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   686
\item[Sequence.append($s@1$,$s@2$)] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   687
concatenates $s@1$ to $s@2$.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   688
332
01b87a921967 final Springer copy
lcp
parents: 323
diff changeset
   689
\item[Sequence.interleave($s@1$,$s@2$)] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   690
joins $s@1$ with $s@2$ by interleaving their elements.  The result contains
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   691
all the elements of the sequences, even if both are infinite.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   692
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   693
\item[Sequence.flats $ss$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   694
concatenates a sequence of sequences.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   695
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   696
\item[Sequence.maps $f$ $s$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   697
applies $f$ to every element of~$s=x@1,x@2,\ldots$, yielding the sequence
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   698
$f(x@1),f(x@2),\ldots$.
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   699
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   700
\item[Sequence.filters $p$ $s$] 
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   701
returns the sequence consisting of all elements~$x$ of~$s$ such that $p(x)$
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   702
is {\tt true}.
323
361a71713176 penultimate Springer draft
lcp
parents: 286
diff changeset
   703
\end{ttdescription}
104
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   704
d8205bb279a7 Initial revision
lcp
parents:
diff changeset
   705
\index{tactics|)}