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