src/Pure/tactic.ML
author paulson
Fri, 16 Feb 1996 12:34:18 +0100
changeset 1501 bb7f99a0a6f0
parent 1460 5a6f2aabd538
child 1801 927a31ba4346
permissions -rw-r--r--
Elimination of fully-functorial style. Type tactic changed to a type abbrevation (from a datatype). Constructor tactic and function apply deleted.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
     1
(*  Title: 	tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
     3
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1991  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
Tactics 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
signature TACTIC =
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    10
  sig
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
  val ares_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    12
  val asm_rewrite_goal_tac:
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 191
diff changeset
    13
        bool*bool -> (meta_simpset -> tactic) -> meta_simpset -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    14
  val assume_tac: int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    15
  val atac: int ->tactic
670
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
    16
  val bimatch_from_nets_tac: 
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    17
      (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    18
  val bimatch_tac: (bool*thm)list -> int -> tactic
670
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
    19
  val biresolve_from_nets_tac: 
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    20
      (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    21
  val biresolve_tac: (bool*thm)list -> int -> tactic
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    22
  val build_net: thm list -> (int*thm) Net.net
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    23
  val build_netpair:    (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net ->
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    24
      (bool*thm)list -> (int*(bool*thm)) Net.net * (int*(bool*thm)) Net.net
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    25
  val compose_inst_tac: (string*string)list -> (bool*thm*int) -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    26
  val compose_tac: (bool * thm * int) -> int -> tactic 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    27
  val cut_facts_tac: thm list -> int -> tactic
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
    28
  val cut_inst_tac: (string*string)list -> thm -> int -> tactic   
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    29
  val dmatch_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    30
  val dresolve_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    31
  val dres_inst_tac: (string*string)list -> thm -> int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    32
  val dtac: thm -> int ->tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    33
  val etac: thm -> int ->tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    34
  val eq_assume_tac: int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    35
  val ematch_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    36
  val eresolve_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    37
  val eres_inst_tac: (string*string)list -> thm -> int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    38
  val filter_thms: (term*term->bool) -> int*term*thm list -> thm list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    39
  val filt_resolve_tac: thm list -> int -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    40
  val flexflex_tac: tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    41
  val fold_goals_tac: thm list -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    42
  val fold_tac: thm list -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    43
  val forward_tac: thm list -> int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    44
  val forw_inst_tac: (string*string)list -> thm -> int -> tactic
947
812ccc91bfa0 Put freeze into the signature TACTIC for export
lcp
parents: 922
diff changeset
    45
  val freeze: thm -> thm   
1077
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
    46
  val insert_tagged_brl:  ('a*(bool*thm)) * 
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    47
                    (('a*(bool*thm))Net.net * ('a*(bool*thm))Net.net) ->
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    48
                    ('a*(bool*thm))Net.net * ('a*(bool*thm))Net.net
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    49
  val is_fact: thm -> bool
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
  val lessb: (bool * thm) * (bool * thm) -> bool
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    51
  val lift_inst_rule: thm * int * (string*string)list * thm -> thm
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
  val make_elim: thm -> thm
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    53
  val match_from_net_tac: (int*thm) Net.net -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
  val match_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    55
  val metacut_tac: thm -> int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    56
  val net_bimatch_tac: (bool*thm) list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    57
  val net_biresolve_tac: (bool*thm) list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    58
  val net_match_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    59
  val net_resolve_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    60
  val PRIMITIVE: (thm -> thm) -> tactic  
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    61
  val PRIMSEQ: (thm -> thm Sequence.seq) -> tactic  
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    62
  val prune_params_tac: tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    63
  val rename_tac: string -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    64
  val rename_last_tac: string -> string list -> int -> tactic
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    65
  val resolve_from_net_tac: (int*thm) Net.net -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    66
  val resolve_tac: thm list -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    67
  val res_inst_tac: (string*string)list -> thm -> int -> tactic   
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    68
  val rewrite_goals_tac: thm list -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    69
  val rewrite_tac: thm list -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    70
  val rewtac: thm -> tactic
1209
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
    71
  val rotate_tac: int -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    72
  val rtac: thm -> int -> tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    73
  val rule_by_tactic: tactic -> thm -> thm
439
ad3f46c13f1e Pure/tactic/subgoals_tac: new (moved from ZF/Order.ML)
lcp
parents: 270
diff changeset
    74
  val subgoal_tac: string -> int -> tactic
ad3f46c13f1e Pure/tactic/subgoals_tac: new (moved from ZF/Order.ML)
lcp
parents: 270
diff changeset
    75
  val subgoals_tac: string list -> int -> tactic
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    76
  val subgoals_of_brl: bool * thm -> int
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    77
  val trace_goalno_tac: (int -> tactic) -> int -> tactic
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    78
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    79
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    80
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    81
structure Tactic : TACTIC = 
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    82
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    83
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    84
(*Discover which goal is chosen:  SOMEGOAL(trace_goalno_tac tac) *)
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    85
fun trace_goalno_tac tac i st =  
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    86
    case Sequence.pull(tac i st) of
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    87
	None    => Sequence.null
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    88
      | seqcell => (prs("Subgoal " ^ string_of_int i ^ " selected\n"); 
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    89
    			 Sequence.seqof(fn()=> seqcell));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    90
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    91
fun string_of (a,0) = a
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    92
  | string_of (a,i) = a ^ "_" ^ string_of_int i;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    93
947
812ccc91bfa0 Put freeze into the signature TACTIC for export
lcp
parents: 922
diff changeset
    94
(*convert all Vars in a theorem to Frees*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    95
fun freeze th =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    96
  let val fth = freezeT th
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    97
      val {prop,sign,...} = rep_thm fth
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    98
      fun mk_inst (Var(v,T)) = 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
    99
	  (cterm_of sign (Var(v,T)),
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   100
	   cterm_of sign (Free(string_of v, T)))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   101
      val insts = map mk_inst (term_vars prop)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   102
  in  instantiate ([],insts) fth  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   103
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   104
(*Makes a rule by applying a tactic to an existing rule*)
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   105
fun rule_by_tactic tac rl =
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   106
    case Sequence.pull(tac (freeze (standard rl))) of
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   107
	None        => raise THM("rule_by_tactic", 0, [rl])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   108
      | Some(rl',_) => standard rl';
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   109
 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   110
(*** Basic tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   111
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   112
(*Makes a tactic whose effect on a state is given by thmfun: thm->thm seq.*)
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   113
fun PRIMSEQ thmfun st =  thmfun st handle THM _ => Sequence.null;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   114
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   115
(*Makes a tactic whose effect on a state is given by thmfun: thm->thm.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   116
fun PRIMITIVE thmfun = PRIMSEQ (Sequence.single o thmfun);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   117
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   118
(*** The following fail if the goal number is out of range:
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   119
     thus (REPEAT (resolve_tac rules i)) stops once subgoal i disappears. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   120
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   121
(*Solve subgoal i by assumption*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   122
fun assume_tac i = PRIMSEQ (assumption i);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   123
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   124
(*Solve subgoal i by assumption, using no unification*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   125
fun eq_assume_tac i = PRIMITIVE (eq_assumption i);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   126
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   127
(** Resolution/matching tactics **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   128
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   129
(*The composition rule/state: no lifting or var renaming.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   130
  The arg = (bires_flg, orule, m) ;  see bicompose for explanation.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   131
fun compose_tac arg i = PRIMSEQ (bicompose false arg i);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   132
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   133
(*Converts a "destruct" rule like P&Q==>P to an "elimination" rule
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   134
  like [| P&Q; P==>R |] ==> R *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   135
fun make_elim rl = zero_var_indexes (rl RS revcut_rl);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   136
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   137
(*Attack subgoal i by resolution, using flags to indicate elimination rules*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   138
fun biresolve_tac brules i = PRIMSEQ (biresolution false brules i);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   139
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   140
(*Resolution: the simple case, works for introduction rules*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   141
fun resolve_tac rules = biresolve_tac (map (pair false) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   142
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   143
(*Resolution with elimination rules only*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   144
fun eresolve_tac rules = biresolve_tac (map (pair true) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   145
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   146
(*Forward reasoning using destruction rules.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   147
fun forward_tac rls = resolve_tac (map make_elim rls) THEN' assume_tac;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   148
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   149
(*Like forward_tac, but deletes the assumption after use.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   150
fun dresolve_tac rls = eresolve_tac (map make_elim rls);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   151
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   152
(*Shorthand versions: for resolution with a single theorem*)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   153
fun rtac rl = resolve_tac [rl];
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   154
fun etac rl = eresolve_tac [rl];
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   155
fun dtac rl = dresolve_tac [rl];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   156
val atac = assume_tac;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   157
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   158
(*Use an assumption or some rules ... A popular combination!*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   159
fun ares_tac rules = assume_tac  ORELSE'  resolve_tac rules;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   160
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   161
(*Matching tactics -- as above, but forbid updating of state*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   162
fun bimatch_tac brules i = PRIMSEQ (biresolution true brules i);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   163
fun match_tac rules  = bimatch_tac (map (pair false) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   164
fun ematch_tac rules = bimatch_tac (map (pair true) rules);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   165
fun dmatch_tac rls   = ematch_tac (map make_elim rls);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   166
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   167
(*Smash all flex-flex disagreement pairs in the proof state.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   168
val flexflex_tac = PRIMSEQ flexflex_rule;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   169
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   170
(*Lift and instantiate a rule wrt the given state and subgoal number *)
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   171
fun lift_inst_rule (st, i, sinsts, rule) =
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   172
let val {maxidx,sign,...} = rep_thm st
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   173
    val (_, _, Bi, _) = dest_state(st,i)
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   174
    val params = Logic.strip_params Bi	        (*params of subgoal i*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   175
    val params = rev(rename_wrt_term Bi params) (*as they are printed*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   176
    val paramTs = map #2 params
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   177
    and inc = maxidx+1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   178
    fun liftvar (Var ((a,j), T)) = Var((a, j+inc), paramTs---> incr_tvar inc T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   179
      | liftvar t = raise TERM("Variable expected", [t]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   180
    fun liftterm t = list_abs_free (params, 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   181
				    Logic.incr_indexes(paramTs,inc) t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   182
    (*Lifts instantiation pair over params*)
230
ec8a2b6aa8a7 Many other files modified as follows:
lcp
parents: 214
diff changeset
   183
    fun liftpair (cv,ct) = (cterm_fun liftvar cv, cterm_fun liftterm ct)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   184
    fun lifttvar((a,i),ctyp) =
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   185
	let val {T,sign} = rep_ctyp ctyp
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   186
	in  ((a,i+inc), ctyp_of sign (incr_tvar inc T)) end
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   187
    val rts = types_sorts rule and (types,sorts) = types_sorts st
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   188
    fun types'(a,~1) = (case assoc(params,a) of None => types(a,~1) | sm => sm)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   189
      | types'(ixn) = types ixn;
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 947
diff changeset
   190
    val used = add_term_tvarnames
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   191
                  (#prop(rep_thm st) $ #prop(rep_thm rule),[])
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 947
diff changeset
   192
    val (Tinsts,insts) = read_insts sign rts (types',sorts) used sinsts
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   193
in instantiate (map lifttvar Tinsts, map liftpair insts)
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   194
               (lift_rule (st,i) rule)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   195
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   196
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   198
(*** Resolve after lifting and instantation; may refer to parameters of the
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
     subgoal.  Fails if "i" is out of range.  ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   200
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   201
(*compose version: arguments are as for bicompose.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   202
fun compose_inst_tac sinsts (bires_flg, rule, nsubgoal) i =
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   203
  STATE ( fn st => 
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   204
	   compose_tac (bires_flg, lift_inst_rule (st, i, sinsts, rule),
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   205
			nsubgoal) i
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   206
	   handle TERM (msg,_) => (writeln msg;  no_tac)
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   207
		| THM  (msg,_,_) => (writeln msg;  no_tac) );
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   208
761
04320c295500 res_inst_tac: added comments
lcp
parents: 670
diff changeset
   209
(*"Resolve" version.  Note: res_inst_tac cannot behave sensibly if the
04320c295500 res_inst_tac: added comments
lcp
parents: 670
diff changeset
   210
  terms that are substituted contain (term or type) unknowns from the
04320c295500 res_inst_tac: added comments
lcp
parents: 670
diff changeset
   211
  goal, because it is unable to instantiate goal unknowns at the same time.
04320c295500 res_inst_tac: added comments
lcp
parents: 670
diff changeset
   212
952
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   213
  The type checker is instructed not to freezes flexible type vars that
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   214
  were introduced during type inference and still remain in the term at the
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   215
  end.  This increases flexibility but can introduce schematic type vars in
9e10962866b0 Removed an old bug which made some simultaneous instantiations fail if they
nipkow
parents: 949
diff changeset
   216
  goals.
761
04320c295500 res_inst_tac: added comments
lcp
parents: 670
diff changeset
   217
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   218
fun res_inst_tac sinsts rule i =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   219
    compose_inst_tac sinsts (false, rule, nprems_of rule) i;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   220
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   221
(*eresolve elimination version*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   222
fun eres_inst_tac sinsts rule i =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   223
    compose_inst_tac sinsts (true, rule, nprems_of rule) i;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   224
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   225
(*For forw_inst_tac and dres_inst_tac.  Preserve Var indexes of rl;
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   226
  increment revcut_rl instead.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   227
fun make_elim_preserve rl = 
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   228
  let val {maxidx,...} = rep_thm rl
922
196ca0973a6d added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
clasohm
parents: 761
diff changeset
   229
      fun cvar ixn = cterm_of Sign.proto_pure (Var(ixn,propT));
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   230
      val revcut_rl' = 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   231
	  instantiate ([],  [(cvar("V",0), cvar("V",maxidx+1)),
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   232
			     (cvar("W",0), cvar("W",maxidx+1))]) revcut_rl
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   233
      val arg = (false, rl, nprems_of rl)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   234
      val [th] = Sequence.list_of_s (bicompose false arg 1 revcut_rl')
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   235
  in  th  end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   236
  handle Bind => raise THM("make_elim_preserve", 1, [rl]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   237
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   238
(*instantiate and cut -- for a FACT, anyway...*)
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   239
fun cut_inst_tac sinsts rule = res_inst_tac sinsts (make_elim_preserve rule);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   240
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   241
(*forward tactic applies a RULE to an assumption without deleting it*)
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   242
fun forw_inst_tac sinsts rule = cut_inst_tac sinsts rule THEN' assume_tac;
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   243
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   244
(*dresolve tactic applies a RULE to replace an assumption*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   245
fun dres_inst_tac sinsts rule = eres_inst_tac sinsts (make_elim_preserve rule);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   246
270
d506ea00c825 tactic/make_elim_preserve: recoded to avoid using lift_inst_rule. Instead
lcp
parents: 230
diff changeset
   247
(*** Applications of cut_rl ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   248
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   249
(*Used by metacut_tac*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   250
fun bires_cut_tac arg i =
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   251
    resolve_tac [cut_rl] i  THEN  biresolve_tac arg (i+1) ;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   252
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   253
(*The conclusion of the rule gets assumed in subgoal i,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   254
  while subgoal i+1,... are the premises of the rule.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   255
fun metacut_tac rule = bires_cut_tac [(false,rule)];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   256
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   257
(*Recognizes theorems that are not rules, but simple propositions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   258
fun is_fact rl =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   259
    case prems_of rl of
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   260
	[] => true  |  _::_ => false;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   261
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   262
(*"Cut" all facts from theorem list into the goal as assumptions. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   263
fun cut_facts_tac ths i =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   264
    EVERY (map (fn th => metacut_tac th i) (filter is_fact ths));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   265
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   266
(*Introduce the given proposition as a lemma and subgoal*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   267
fun subgoal_tac sprop = res_inst_tac [("psi", sprop)] cut_rl;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   268
439
ad3f46c13f1e Pure/tactic/subgoals_tac: new (moved from ZF/Order.ML)
lcp
parents: 270
diff changeset
   269
(*Introduce a list of lemmas and subgoals*)
ad3f46c13f1e Pure/tactic/subgoals_tac: new (moved from ZF/Order.ML)
lcp
parents: 270
diff changeset
   270
fun subgoals_tac sprops = EVERY' (map subgoal_tac sprops);
ad3f46c13f1e Pure/tactic/subgoals_tac: new (moved from ZF/Order.ML)
lcp
parents: 270
diff changeset
   271
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   272
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   273
(**** Indexing and filtering of theorems ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   274
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   275
(*Returns the list of potentially resolvable theorems for the goal "prem",
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   276
	using the predicate  could(subgoal,concl).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   277
  Resulting list is no longer than "limit"*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   278
fun filter_thms could (limit, prem, ths) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   279
  let val pb = Logic.strip_assums_concl prem;   (*delete assumptions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   280
      fun filtr (limit, []) = []
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   281
	| filtr (limit, th::ths) =
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   282
	    if limit=0 then  []
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   283
	    else if could(pb, concl_of th)  then th :: filtr(limit-1, ths)
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   284
	    else filtr(limit,ths)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   285
  in  filtr(limit,ths)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   286
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   287
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   288
(*** biresolution and resolution using nets ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   289
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   290
(** To preserve the order of the rules, tag them with increasing integers **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   291
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   292
(*insert tags*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   293
fun taglist k [] = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   294
  | taglist k (x::xs) = (k,x) :: taglist (k+1) xs;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   295
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   296
(*remove tags and suppress duplicates -- list is assumed sorted!*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   297
fun untaglist [] = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   298
  | untaglist [(k:int,x)] = [x]
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   299
  | untaglist ((k,x) :: (rest as (k',x')::_)) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   300
      if k=k' then untaglist rest
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   301
      else    x :: untaglist rest;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   302
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   303
(*return list elements in original order*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   304
val orderlist = untaglist o sort (fn(x,y)=> #1 x < #1 y); 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   305
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   306
(*insert one tagged brl into the pair of nets*)
1077
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   307
fun insert_tagged_brl (kbrl as (k,(eres,th)), (inet,enet)) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   308
    if eres then 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   309
	case prems_of th of
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   310
	    prem::_ => (inet, Net.insert_term ((prem,kbrl), enet, K false))
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   311
	  | [] => error"insert_tagged_brl: elimination rule with no premises"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   312
    else (Net.insert_term ((concl_of th, kbrl), inet, K false), enet);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   313
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   314
(*build a pair of nets for biresolution*)
670
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   315
fun build_netpair netpair brls = 
1077
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   316
    foldr insert_tagged_brl (taglist 1 brls, netpair);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   317
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   318
(*biresolution using a pair of nets rather than rules*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   319
fun biresolution_from_nets_tac match (inet,enet) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   320
  SUBGOAL
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   321
    (fn (prem,i) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   322
      let val hyps = Logic.strip_assums_hyp prem
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   323
          and concl = Logic.strip_assums_concl prem 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   324
          val kbrls = Net.unify_term inet concl @
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   325
                      flat (map (Net.unify_term enet) hyps)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   326
      in PRIMSEQ (biresolution match (orderlist kbrls) i) end);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   327
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   328
(*versions taking pre-built nets*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   329
val biresolve_from_nets_tac = biresolution_from_nets_tac false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   330
val bimatch_from_nets_tac = biresolution_from_nets_tac true;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   331
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   332
(*fast versions using nets internally*)
670
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   333
val net_biresolve_tac =
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   334
    biresolve_from_nets_tac o build_netpair(Net.empty,Net.empty);
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   335
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   336
val net_bimatch_tac =
ff4c6691de9d Pure/tactic/build_netpair: now takes two arguments
lcp
parents: 439
diff changeset
   337
    bimatch_from_nets_tac o build_netpair(Net.empty,Net.empty);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   338
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   339
(*** Simpler version for resolve_tac -- only one net, and no hyps ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   340
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   341
(*insert one tagged rl into the net*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   342
fun insert_krl (krl as (k,th), net) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   343
    Net.insert_term ((concl_of th, krl), net, K false);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   344
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   345
(*build a net of rules for resolution*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   346
fun build_net rls = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   347
    foldr insert_krl (taglist 1 rls, Net.empty);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   348
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   349
(*resolution using a net rather than rules; pred supports filt_resolve_tac*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   350
fun filt_resolution_from_net_tac match pred net =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   351
  SUBGOAL
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   352
    (fn (prem,i) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   353
      let val krls = Net.unify_term net (Logic.strip_assums_concl prem)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   354
      in 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   355
	 if pred krls  
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   356
         then PRIMSEQ
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   357
		(biresolution match (map (pair false) (orderlist krls)) i)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   358
         else no_tac
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   359
      end);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   360
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   361
(*Resolve the subgoal using the rules (making a net) unless too flexible,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   362
   which means more than maxr rules are unifiable.      *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   363
fun filt_resolve_tac rules maxr = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   364
    let fun pred krls = length krls <= maxr
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   365
    in  filt_resolution_from_net_tac false pred (build_net rules)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   366
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   367
(*versions taking pre-built nets*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   368
val resolve_from_net_tac = filt_resolution_from_net_tac false (K true);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   369
val match_from_net_tac = filt_resolution_from_net_tac true (K true);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   370
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   371
(*fast versions using nets internally*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   372
val net_resolve_tac = resolve_from_net_tac o build_net;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   373
val net_match_tac = match_from_net_tac o build_net;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   374
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   375
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   376
(*** For Natural Deduction using (bires_flg, rule) pairs ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   377
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   378
(*The number of new subgoals produced by the brule*)
1077
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   379
fun subgoals_of_brl (true,rule)  = nprems_of rule - 1
c2df11ae8b55 Renamed insert_kbrl to insert_tagged_brl and exported it. Now
lcp
parents: 952
diff changeset
   380
  | subgoals_of_brl (false,rule) = nprems_of rule;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   381
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   382
(*Less-than test: for sorting to minimize number of new subgoals*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   383
fun lessb (brl1,brl2) = subgoals_of_brl brl1 < subgoals_of_brl brl2;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   384
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   385
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   386
(*** Meta-Rewriting Tactics ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   387
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   388
fun result1 tacf mss thm =
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   389
  case Sequence.pull(tacf mss thm) of
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   390
    None => None
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   391
  | Some(thm,_) => Some(thm);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   392
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   393
(*Rewrite subgoal i only *)
214
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 191
diff changeset
   394
fun asm_rewrite_goal_tac mode prover_tac mss i =
ed6a3e2b1a33 added new parameter to the simplification tactics which indicates if
nipkow
parents: 191
diff changeset
   395
      PRIMITIVE(rewrite_goal_rule mode (result1 prover_tac) mss i);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   396
69
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   397
(*Rewrite throughout proof state. *)
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   398
fun rewrite_tac defs = PRIMITIVE(rewrite_rule defs);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   399
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
(*Rewrite subgoals only, not main goal. *)
69
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   401
fun rewrite_goals_tac defs = PRIMITIVE (rewrite_goals_rule defs);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   402
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   403
fun rewtac def = rewrite_goals_tac [def];
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   404
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   405
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   406
(*** for folding definitions, handling critical pairs ***)
69
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   407
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   408
(*The depth of nesting in a term*)
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   409
fun term_depth (Abs(a,T,t)) = 1 + term_depth t
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   410
  | term_depth (f$t) = 1 + max [term_depth f, term_depth t]
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   411
  | term_depth _ = 0;
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   412
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   413
val lhs_of_thm = #1 o Logic.dest_equals o #prop o rep_thm;
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   414
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   415
(*folding should handle critical pairs!  E.g. K == Inl(0),  S == Inr(Inl(0))
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   416
  Returns longest lhs first to avoid folding its subexpressions.*)
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   417
fun sort_lhs_depths defs =
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   418
  let val keylist = make_keylist (term_depth o lhs_of_thm) defs
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   419
      val keys = distinct (sort op> (map #2 keylist))
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   420
  in  map (keyfilter keylist) keys  end;
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   421
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   422
fun fold_tac defs = EVERY 
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   423
    (map rewrite_tac (sort_lhs_depths (map symmetric defs)));
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   424
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   425
fun fold_goals_tac defs = EVERY 
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   426
    (map rewrite_goals_tac (sort_lhs_depths (map symmetric defs)));
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   427
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   428
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   429
(*** Renaming of parameters in a subgoal
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   430
     Names may contain letters, digits or primes and must be
e7588b53d6b0 tactic/fold_tac,fold_goals_tac: now handle critical pairs on the
lcp
parents: 0
diff changeset
   431
     separated by blanks ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   432
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   433
(*Calling this will generate the warning "Same as previous level" since
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   434
  it affects nothing but the names of bound variables!*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   435
fun rename_tac str i = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   436
  let val cs = explode str 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   437
  in  
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   438
  if !Logic.auto_rename 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   439
  then (writeln"Note: setting Logic.auto_rename := false"; 
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   440
	Logic.auto_rename := false)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   441
  else ();
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
  case #2 (take_prefix (is_letdig orf is_blank) cs) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   443
      [] => PRIMITIVE (rename_params_rule (scanwords is_letdig cs, i))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   444
    | c::_ => error ("Illegal character: " ^ c)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   445
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   446
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   447
(*Rename recent parameters using names generated from a and the suffixes,
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   448
  provided the string a, which represents a term, is an identifier. *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   449
fun rename_last_tac a sufs i = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   450
  let val names = map (curry op^ a) sufs
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   451
  in  if Syntax.is_identifier a
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   452
      then PRIMITIVE (rename_params_rule (names,i))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   453
      else all_tac
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   454
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   455
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   456
(*Prunes all redundant parameters from the proof state by rewriting*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   457
val prune_params_tac = rewrite_tac [triv_forall_equality];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   458
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   459
(*rotate_tac n i: rotate the assumptions of subgoal i by n positions, from
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   460
  right to left if n is positive, and from left to right if n is negative.*)
1209
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   461
fun rotate_tac n =
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   462
  let fun rot(n) = EVERY'(replicate n (dtac asm_rl));
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   463
  in if n >= 0 then rot n
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   464
     else SUBGOAL (fn (t,i) => rot(length(Logic.strip_assums_hyp t)+n) i)
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   465
  end;
03dc596b3a18 added rotate_tac.
nipkow
parents: 1077
diff changeset
   466
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   467
end;
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   468
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
   469
open Tactic;