src/Provers/eqsubst.ML
author dixon
Wed Apr 18 16:23:31 2007 +0200 (2007-04-18)
changeset 22727 473c7f67c64f
parent 22578 b0eb5652f210
child 23064 6ee131d1a618
permissions -rw-r--r--
Improved comments.
dixon@15538
     1
(*  Title:      Provers/eqsubst.ML
wenzelm@16434
     2
    ID:         $Id$
wenzelm@18598
     3
    Author:     Lucas Dixon, University of Edinburgh, lucas.dixon@ed.ac.uk
paulson@15481
     4
wenzelm@18598
     5
A proof method to perform a substiution using an equation.
wenzelm@18598
     6
*)
dixon@15538
     7
wenzelm@18591
     8
signature EQSUBST =
paulson@15481
     9
sig
dixon@19871
    10
  (* a type abriviation for match information *)
dixon@19871
    11
  type match =
dixon@19871
    12
       ((indexname * (sort * typ)) list (* type instantiations *)
dixon@19871
    13
        * (indexname * (typ * term)) list) (* term instantiations *)
dixon@19871
    14
       * (string * typ) list (* fake named type abs env *)
dixon@19871
    15
       * (string * typ) list (* type abs env *)
dixon@19871
    16
       * term (* outer term *)
dixon@19871
    17
dixon@19871
    18
  type searchinfo =
dixon@19871
    19
       theory
dixon@19871
    20
       * int (* maxidx *)
dixon@19871
    21
       * Zipper.T (* focusterm to search under *)
dixon@19871
    22
dixon@19871
    23
    exception eqsubst_occL_exp of
dixon@19871
    24
       string * int list * Thm.thm list * int * Thm.thm
dixon@19871
    25
    
dixon@19871
    26
    (* low level substitution functions *)
dixon@19871
    27
    val apply_subst_in_asm :
dixon@19871
    28
       int ->
dixon@19871
    29
       Thm.thm ->
dixon@19871
    30
       Thm.thm ->
dixon@19871
    31
       (Thm.cterm list * int * 'a * Thm.thm) * match -> Thm.thm Seq.seq
dixon@19871
    32
    val apply_subst_in_concl :
dixon@19871
    33
       int ->
dixon@19871
    34
       Thm.thm ->
dixon@19871
    35
       Thm.cterm list * Thm.thm ->
dixon@19871
    36
       Thm.thm -> match -> Thm.thm Seq.seq
dixon@19871
    37
dixon@19871
    38
    (* matching/unification within zippers *)
dixon@19871
    39
    val clean_match_z :
dixon@19871
    40
       Context.theory -> Term.term -> Zipper.T -> match option
dixon@19871
    41
    val clean_unify_z :
dixon@19871
    42
       Context.theory -> int -> Term.term -> Zipper.T -> match Seq.seq
dixon@19871
    43
dixon@19871
    44
    (* skipping things in seq seq's *)
dixon@19871
    45
dixon@19871
    46
   (* skipping non-empty sub-sequences but when we reach the end
dixon@19871
    47
      of the seq, remembering how much we have left to skip. *)
dixon@19871
    48
    datatype 'a skipseq = SkipMore of int
dixon@19871
    49
      | SkipSeq of 'a Seq.seq Seq.seq;
dixon@19871
    50
dixon@19871
    51
    val skip_first_asm_occs_search :
dixon@19871
    52
       ('a -> 'b -> 'c Seq.seq Seq.seq) ->
dixon@19871
    53
       'a -> int -> 'b -> 'c skipseq
dixon@19871
    54
    val skip_first_occs_search :
dixon@19871
    55
       int -> ('a -> 'b -> 'c Seq.seq Seq.seq) -> 'a -> 'b -> 'c Seq.seq
dixon@19871
    56
    val skipto_skipseq : int -> 'a Seq.seq Seq.seq -> 'a skipseq
dixon@19871
    57
dixon@19871
    58
    (* tactics *)
dixon@19871
    59
    val eqsubst_asm_tac :
dixon@19871
    60
       Proof.context ->
dixon@19871
    61
       int list -> Thm.thm list -> int -> Thm.thm -> Thm.thm Seq.seq
dixon@19871
    62
    val eqsubst_asm_tac' :
dixon@19871
    63
       Proof.context ->
dixon@19871
    64
       (searchinfo -> int -> Term.term -> match skipseq) ->
dixon@19871
    65
       int -> Thm.thm -> int -> Thm.thm -> Thm.thm Seq.seq
dixon@19871
    66
    val eqsubst_tac :
dixon@19871
    67
       Proof.context ->
dixon@22727
    68
       int list -> (* list of occurences to rewrite, use [0] for any *)
dixon@22727
    69
       Thm.thm list -> int -> Thm.thm -> Thm.thm Seq.seq
dixon@19871
    70
    val eqsubst_tac' :
dixon@22727
    71
       Proof.context -> (* proof context *)
dixon@22727
    72
       (searchinfo -> Term.term -> match Seq.seq) (* search function *)
dixon@22727
    73
       -> Thm.thm (* equation theorem to rewrite with *)
dixon@22727
    74
       -> int (* subgoal number in goal theorem *)
dixon@22727
    75
       -> Thm.thm (* goal theorem *)
dixon@22727
    76
       -> Thm.thm Seq.seq (* rewritten goal theorem *)
dixon@19871
    77
dixon@19871
    78
dixon@19871
    79
    val fakefree_badbounds :
dixon@19871
    80
       (string * Term.typ) list ->
dixon@19871
    81
       Term.term ->
dixon@19871
    82
       (string * Term.typ) list * (string * Term.typ) list * Term.term
dixon@19871
    83
dixon@19871
    84
    val mk_foo_match :
dixon@19871
    85
       (Term.term -> Term.term) ->
dixon@19871
    86
       ('a * Term.typ) list -> Term.term -> Term.term
dixon@19871
    87
dixon@19871
    88
    (* preparing substitution *)
dixon@19871
    89
    val prep_meta_eq : Proof.context -> Thm.thm -> Thm.thm list
dixon@19871
    90
    val prep_concl_subst :
dixon@19871
    91
       int -> Thm.thm -> (Thm.cterm list * Thm.thm) * searchinfo
dixon@19871
    92
    val prep_subst_in_asm :
dixon@19871
    93
       int -> Thm.thm -> int ->
dixon@19871
    94
       (Thm.cterm list * int * int * Thm.thm) * searchinfo
dixon@19871
    95
    val prep_subst_in_asms :
dixon@19871
    96
       int -> Thm.thm ->
dixon@19871
    97
       ((Thm.cterm list * int * int * Thm.thm) * searchinfo) list
dixon@19871
    98
    val prep_zipper_match :
dixon@19871
    99
       Zipper.T -> Term.term * ((string * Term.typ) list * (string * Term.typ) list * Term.term)
dixon@19871
   100
dixon@19871
   101
    (* search for substitutions *)
dixon@19871
   102
    val valid_match_start : Zipper.T -> bool
dixon@19871
   103
    val search_lr_all : Zipper.T -> Zipper.T Seq.seq
dixon@19871
   104
    val search_lr_valid : (Zipper.T -> bool) -> Zipper.T -> Zipper.T Seq.seq
dixon@19871
   105
    val searchf_lr_unify_all :
dixon@19871
   106
       searchinfo -> Term.term -> match Seq.seq Seq.seq
dixon@19871
   107
    val searchf_lr_unify_valid :
dixon@19871
   108
       searchinfo -> Term.term -> match Seq.seq Seq.seq
dixon@19871
   109
dixon@19871
   110
dixon@19871
   111
    (* syntax tools *)
dixon@19871
   112
    val ith_syntax : Args.T list -> int list * Args.T list
dixon@19871
   113
    val options_syntax : Args.T list -> bool * Args.T list
dixon@19871
   114
dixon@19871
   115
    (* Isar level hooks *)
wenzelm@20289
   116
    val eqsubst_asm_meth : Proof.context -> int list -> Thm.thm list -> Proof.method
wenzelm@20289
   117
    val eqsubst_meth : Proof.context -> int list -> Thm.thm list -> Proof.method
wenzelm@20289
   118
    val subst_meth : Method.src -> Proof.context -> Proof.method
dixon@19871
   119
    val setup : theory -> theory
dixon@19871
   120
paulson@15481
   121
end;
paulson@15481
   122
dixon@19835
   123
structure EqSubst
dixon@19871
   124
: EQSUBST
dixon@19835
   125
= struct
dixon@16004
   126
dixon@19835
   127
structure Z = Zipper;
dixon@19835
   128
dixon@19835
   129
(* changes object "=" to meta "==" which prepares a given rewrite rule *)
wenzelm@18598
   130
fun prep_meta_eq ctxt =
wenzelm@18598
   131
  let val (_, {mk_rews = {mk, ...}, ...}) = Simplifier.rep_ss (Simplifier.local_simpset_of ctxt)
wenzelm@18598
   132
  in mk #> map Drule.zero_var_indexes end;
wenzelm@18598
   133
paulson@15481
   134
dixon@15915
   135
  (* a type abriviation for match information *)
wenzelm@16978
   136
  type match =
wenzelm@16978
   137
       ((indexname * (sort * typ)) list (* type instantiations *)
wenzelm@16978
   138
        * (indexname * (typ * term)) list) (* term instantiations *)
wenzelm@16978
   139
       * (string * typ) list (* fake named type abs env *)
wenzelm@16978
   140
       * (string * typ) list (* type abs env *)
wenzelm@16978
   141
       * term (* outer term *)
dixon@15550
   142
wenzelm@16978
   143
  type searchinfo =
wenzelm@18598
   144
       theory
dixon@16004
   145
       * int (* maxidx *)
dixon@19835
   146
       * Zipper.T (* focusterm to search under *)
dixon@19835
   147
dixon@19835
   148
dixon@19835
   149
(* skipping non-empty sub-sequences but when we reach the end
dixon@19835
   150
   of the seq, remembering how much we have left to skip. *)
dixon@19835
   151
datatype 'a skipseq = SkipMore of int
dixon@19835
   152
  | SkipSeq of 'a Seq.seq Seq.seq;
dixon@19835
   153
(* given a seqseq, skip the first m non-empty seq's, note deficit *)
dixon@19835
   154
fun skipto_skipseq m s = 
dixon@19835
   155
    let 
dixon@19835
   156
      fun skip_occs n sq = 
dixon@19835
   157
          case Seq.pull sq of 
dixon@19835
   158
            NONE => SkipMore n
dixon@19835
   159
          | SOME (h,t) => 
dixon@19835
   160
            (case Seq.pull h of NONE => skip_occs n t
dixon@19835
   161
             | SOME _ => if n <= 1 then SkipSeq (Seq.cons h t)
dixon@19835
   162
                         else skip_occs (n - 1) t)
dixon@19835
   163
    in (skip_occs m s) end;
dixon@19835
   164
dixon@19835
   165
(* note: outerterm is the taget with the match replaced by a bound 
dixon@19835
   166
         variable : ie: "P lhs" beocmes "%x. P x" 
dixon@19835
   167
         insts is the types of instantiations of vars in lhs
dixon@19835
   168
         and typinsts is the type instantiations of types in the lhs
dixon@19835
   169
         Note: Final rule is the rule lifted into the ontext of the 
dixon@19835
   170
         taget thm. *)
dixon@19835
   171
fun mk_foo_match mkuptermfunc Ts t = 
dixon@19835
   172
    let 
dixon@19835
   173
      val ty = Term.type_of t
dixon@19835
   174
      val bigtype = (rev (map snd Ts)) ---> ty
dixon@19835
   175
      fun mk_foo 0 t = t
dixon@19835
   176
        | mk_foo i t = mk_foo (i - 1) (t $ (Bound (i - 1)))
dixon@19835
   177
      val num_of_bnds = (length Ts)
dixon@19835
   178
      (* foo_term = "fooabs y0 ... yn" where y's are local bounds *)
dixon@19835
   179
      val foo_term = mk_foo num_of_bnds (Bound num_of_bnds)
dixon@19835
   180
    in Abs("fooabs", bigtype, mkuptermfunc foo_term) end;
dixon@19835
   181
dixon@19835
   182
(* T is outer bound vars, n is number of locally bound vars *)
dixon@19835
   183
(* THINK: is order of Ts correct...? or reversed? *)
dixon@19835
   184
fun fakefree_badbounds Ts t = 
dixon@19835
   185
    let val (FakeTs,Ts,newnames) = 
dixon@19835
   186
            List.foldr (fn ((n,ty),(FakeTs,Ts,usednames)) => 
wenzelm@20071
   187
                           let val newname = Name.variant usednames n
dixon@19835
   188
                           in ((RWTools.mk_fake_bound_name newname,ty)::FakeTs,
dixon@19835
   189
                               (newname,ty)::Ts, 
dixon@19835
   190
                               newname::usednames) end)
dixon@19835
   191
                       ([],[],[])
dixon@19835
   192
                       Ts
dixon@19835
   193
    in (FakeTs, Ts, Term.subst_bounds (map Free FakeTs, t)) end;
dixon@19835
   194
dixon@19835
   195
(* before matching we need to fake the bound vars that are missing an
dixon@19835
   196
abstraction. In this function we additionally construct the
dixon@19835
   197
abstraction environment, and an outer context term (with the focus
dixon@19835
   198
abstracted out) for use in rewriting with RWInst.rw *)
dixon@19835
   199
fun prep_zipper_match z = 
dixon@19835
   200
    let 
dixon@19835
   201
      val t = Z.trm z  
dixon@19835
   202
      val c = Z.ctxt z
dixon@19835
   203
      val Ts = Z.C.nty_ctxt c
dixon@19835
   204
      val (FakeTs', Ts', t') = fakefree_badbounds Ts t
dixon@19835
   205
      val absterm = mk_foo_match (Z.C.apply c) Ts' t'
dixon@19835
   206
    in
dixon@19835
   207
      (t', (FakeTs', Ts', absterm))
dixon@19835
   208
    end;
dixon@19835
   209
dixon@19835
   210
(* Matching and Unification with exception handled *)
dixon@19835
   211
fun clean_match thy (a as (pat, t)) =
dixon@19835
   212
  let val (tyenv, tenv) = Pattern.match thy a (Vartab.empty, Vartab.empty)
dixon@19835
   213
  in SOME (Vartab.dest tyenv, Vartab.dest tenv)
dixon@19835
   214
  end handle Pattern.MATCH => NONE;
dixon@19835
   215
(* given theory, max var index, pat, tgt; returns Seq of instantiations *)
dixon@19835
   216
fun clean_unify sgn ix (a as (pat, tgt)) =
dixon@19835
   217
    let
dixon@19835
   218
      (* type info will be re-derived, maybe this can be cached
dixon@19835
   219
         for efficiency? *)
dixon@19835
   220
      val pat_ty = Term.type_of pat;
dixon@19835
   221
      val tgt_ty = Term.type_of tgt;
dixon@19835
   222
      (* is it OK to ignore the type instantiation info?
dixon@19835
   223
         or should I be using it? *)
dixon@19835
   224
      val typs_unify =
dixon@19835
   225
          SOME (Sign.typ_unify sgn (pat_ty, tgt_ty) (Term.Vartab.empty, ix))
dixon@19835
   226
            handle Type.TUNIFY => NONE;
dixon@19835
   227
    in
dixon@19835
   228
      case typs_unify of
dixon@19835
   229
        SOME (typinsttab, ix2) =>
dixon@19835
   230
        let
dixon@19835
   231
      (* is it right to throw away the flexes?
dixon@19835
   232
         or should I be using them somehow? *)
dixon@19835
   233
          fun mk_insts env =
dixon@19835
   234
            (Vartab.dest (Envir.type_env env),
dixon@19835
   235
             Envir.alist_of env);
dixon@19835
   236
          val initenv = Envir.Envir {asol = Vartab.empty,
dixon@19835
   237
                                     iTs = typinsttab, maxidx = ix2};
wenzelm@19861
   238
          val useq = Unify.smash_unifiers sgn [a] initenv
dixon@19835
   239
	            handle UnequalLengths => Seq.empty
dixon@19835
   240
		               | Term.TERM _ => Seq.empty;
dixon@19835
   241
          fun clean_unify' useq () =
dixon@19835
   242
              (case (Seq.pull useq) of
dixon@19835
   243
                 NONE => NONE
dixon@19835
   244
               | SOME (h,t) => SOME (mk_insts h, Seq.make (clean_unify' t)))
dixon@19835
   245
	      handle UnequalLengths => NONE
dixon@19835
   246
                   | Term.TERM _ => NONE;
dixon@19835
   247
        in
dixon@19835
   248
          (Seq.make (clean_unify' useq))
dixon@19835
   249
        end
dixon@19835
   250
      | NONE => Seq.empty
dixon@19835
   251
    end;
dixon@19835
   252
dixon@19835
   253
(* Matching and Unification for zippers *)
dixon@19835
   254
(* Note: Ts is a modified version of the original names of the outer
dixon@19835
   255
bound variables. New names have been introduced to make sure they are
dixon@19835
   256
unique w.r.t all names in the term and each other. usednames' is
dixon@19835
   257
oldnames + new names. *)
dixon@19835
   258
fun clean_match_z thy pat z = 
dixon@19835
   259
    let val (t, (FakeTs,Ts,absterm)) = prep_zipper_match z in
dixon@19835
   260
      case clean_match thy (pat, t) of 
dixon@19835
   261
        NONE => NONE 
dixon@19835
   262
      | SOME insts => SOME (insts, FakeTs, Ts, absterm) end;
dixon@19835
   263
(* ix = max var index *)
dixon@19835
   264
fun clean_unify_z sgn ix pat z = 
dixon@19835
   265
    let val (t, (FakeTs, Ts,absterm)) = prep_zipper_match z in
dixon@19835
   266
    Seq.map (fn insts => (insts, FakeTs, Ts, absterm)) 
dixon@19835
   267
            (clean_unify sgn ix (t, pat)) end;
dixon@19835
   268
dixon@15550
   269
dixon@15538
   270
(* FOR DEBUGGING...
dixon@15538
   271
type trace_subst_errT = int (* subgoal *)
wenzelm@16978
   272
        * thm (* thm with all goals *)
dixon@15538
   273
        * (Thm.cterm list (* certified free var placeholders for vars *)
wenzelm@16978
   274
           * thm)  (* trivial thm of goal concl *)
dixon@15538
   275
            (* possible matches/unifiers *)
wenzelm@16978
   276
        * thm (* rule *)
wenzelm@16978
   277
        * (((indexname * typ) list (* type instantiations *)
wenzelm@16978
   278
              * (indexname * term) list ) (* term instantiations *)
wenzelm@16978
   279
             * (string * typ) list (* Type abs env *)
wenzelm@16978
   280
             * term) (* outer term *);
dixon@15538
   281
dixon@15538
   282
val trace_subst_err = (ref NONE : trace_subst_errT option ref);
dixon@15538
   283
val trace_subst_search = ref false;
dixon@15538
   284
exception trace_subst_exp of trace_subst_errT;
dixon@19835
   285
*)
dixon@19835
   286
dixon@19835
   287
dixon@19835
   288
fun bot_left_leaf_of (l $ r) = bot_left_leaf_of l
dixon@19835
   289
  | bot_left_leaf_of (Abs(s,ty,t)) = bot_left_leaf_of t
dixon@19835
   290
  | bot_left_leaf_of x = x;
dixon@15538
   291
dixon@19975
   292
(* Avoid considering replacing terms which have a var at the head as
dixon@19975
   293
   they always succeed trivially, and uninterestingly. *)
dixon@19835
   294
fun valid_match_start z =
dixon@19835
   295
    (case bot_left_leaf_of (Z.trm z) of 
dixon@19975
   296
      Var _ => false 
dixon@19975
   297
      | _ => true);
dixon@19975
   298
dixon@15814
   299
(* search from top, left to right, then down *)
dixon@19871
   300
val search_lr_all = ZipperSearch.all_bl_ur;
paulson@15481
   301
dixon@15814
   302
(* search from top, left to right, then down *)
dixon@19871
   303
fun search_lr_valid validf =
dixon@19835
   304
    let 
dixon@19835
   305
      fun sf_valid_td_lr z = 
dixon@19835
   306
          let val here = if validf z then [Z.Here z] else [] in
dixon@19835
   307
            case Z.trm z 
dixon@19871
   308
             of _ $ _ => [Z.LookIn (Z.move_down_left z)] 
dixon@19871
   309
                         @ here 
dixon@19871
   310
                         @ [Z.LookIn (Z.move_down_right z)]
dixon@19835
   311
              | Abs _ => here @ [Z.LookIn (Z.move_down_abs z)]
dixon@19835
   312
              | _ => here
dixon@19835
   313
          end;
dixon@19835
   314
    in Z.lzy_search sf_valid_td_lr end;
dixon@15814
   315
dixon@15814
   316
(* search all unifications *)
dixon@19871
   317
fun searchf_lr_unify_all (sgn, maxidx, z) lhs =
dixon@19835
   318
    Seq.map (clean_unify_z sgn maxidx lhs) 
dixon@19871
   319
            (Z.limit_apply search_lr_all z);
paulson@15481
   320
dixon@15814
   321
(* search only for 'valid' unifiers (non abs subterms and non vars) *)
dixon@19871
   322
fun searchf_lr_unify_valid (sgn, maxidx, z) lhs  =
dixon@19835
   323
    Seq.map (clean_unify_z sgn maxidx lhs) 
dixon@19871
   324
            (Z.limit_apply (search_lr_valid valid_match_start) z);
dixon@15929
   325
dixon@15814
   326
dixon@15538
   327
(* apply a substitution in the conclusion of the theorem th *)
dixon@15538
   328
(* cfvs are certified free var placeholders for goal params *)
dixon@15538
   329
(* conclthm is a theorem of for just the conclusion *)
dixon@15538
   330
(* m is instantiation/match information *)
dixon@15538
   331
(* rule is the equation for substitution *)
wenzelm@16978
   332
fun apply_subst_in_concl i th (cfvs, conclthm) rule m =
dixon@15538
   333
    (RWInst.rw m rule conclthm)
dixon@15855
   334
      |> IsaND.unfix_frees cfvs
dixon@15915
   335
      |> RWInst.beta_eta_contract
dixon@15538
   336
      |> (fn r => Tactic.rtac r i th);
paulson@15481
   337
paulson@15481
   338
(* substitute within the conclusion of goal i of gth, using a meta
dixon@15538
   339
equation rule. Note that we assume rule has var indicies zero'd *)
wenzelm@16978
   340
fun prep_concl_subst i gth =
wenzelm@16978
   341
    let
paulson@15481
   342
      val th = Thm.incr_indexes 1 gth;
paulson@15481
   343
      val tgt_term = Thm.prop_of th;
paulson@15481
   344
wenzelm@22578
   345
      val sgn = Thm.theory_of_thm th;
paulson@15481
   346
      val ctermify = Thm.cterm_of sgn;
paulson@15481
   347
      val trivify = Thm.trivial o ctermify;
paulson@15481
   348
paulson@15481
   349
      val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
paulson@15481
   350
      val cfvs = rev (map ctermify fvs);
paulson@15481
   351
dixon@15538
   352
      val conclterm = Logic.strip_imp_concl fixedbody;
dixon@15538
   353
      val conclthm = trivify conclterm;
dixon@15538
   354
      val maxidx = Term.maxidx_of_term conclterm;
dixon@19835
   355
      val ft = ((Z.move_down_right (* ==> *)
dixon@19835
   356
                 o Z.move_down_left (* Trueprop *)
dixon@19835
   357
                 o Z.mktop
dixon@16004
   358
                 o Thm.prop_of) conclthm)
paulson@15481
   359
    in
dixon@16004
   360
      ((cfvs, conclthm), (sgn, maxidx, ft))
paulson@15481
   361
    end;
paulson@15481
   362
paulson@15481
   363
(* substitute using an object or meta level equality *)
wenzelm@18598
   364
fun eqsubst_tac' ctxt searchf instepthm i th =
wenzelm@16978
   365
    let
dixon@16004
   366
      val (cvfsconclthm, searchinfo) = prep_concl_subst i th;
wenzelm@18598
   367
      val stepthms = Seq.of_list (prep_meta_eq ctxt instepthm);
dixon@15538
   368
      fun rewrite_with_thm r =
dixon@15538
   369
          let val (lhs,_) = Logic.dest_equals (Thm.concl_of r);
wenzelm@18598
   370
          in searchf searchinfo lhs
wenzelm@18598
   371
             |> Seq.maps (apply_subst_in_concl i th cvfsconclthm r) end;
wenzelm@18598
   372
    in stepthms |> Seq.maps rewrite_with_thm end;
dixon@15538
   373
dixon@15538
   374
wenzelm@19047
   375
(* distinct subgoals *)
dixon@15959
   376
fun distinct_subgoals th =
wenzelm@19047
   377
  the_default th (SINGLE distinct_subgoals_tac th);
dixon@15538
   378
wenzelm@19047
   379
(* General substitution of multiple occurances using one of
dixon@15936
   380
   the given theorems*)
dixon@19835
   381
dixon@19835
   382
wenzelm@16978
   383
exception eqsubst_occL_exp of
wenzelm@16978
   384
          string * (int list) * (thm list) * int * thm;
wenzelm@16978
   385
fun skip_first_occs_search occ srchf sinfo lhs =
dixon@19835
   386
    case (skipto_skipseq occ (srchf sinfo lhs)) of
dixon@19835
   387
      SkipMore _ => Seq.empty
dixon@19835
   388
    | SkipSeq ss => Seq.flat ss;
dixon@16004
   389
dixon@22727
   390
(* The occL is a list of integers indicating which occurence
dixon@22727
   391
w.r.t. the search order, to rewrite. Backtracking will also find later
dixon@22727
   392
occurences, but all earlier ones are skipped. Thus you can use [0] to
dixon@22727
   393
just find all rewrites. *)
dixon@22727
   394
wenzelm@18598
   395
fun eqsubst_tac ctxt occL thms i th =
dixon@15936
   396
    let val nprems = Thm.nprems_of th in
dixon@15936
   397
      if nprems < i then Seq.empty else
wenzelm@16978
   398
      let val thmseq = (Seq.of_list thms)
wenzelm@16978
   399
        fun apply_occ occ th =
wenzelm@18598
   400
            thmseq |> Seq.maps
dixon@19835
   401
                    (fn r => eqsubst_tac' 
dixon@19835
   402
                               ctxt 
dixon@19835
   403
                               (skip_first_occs_search
dixon@19871
   404
                                  occ searchf_lr_unify_valid) r
dixon@15936
   405
                                 (i + ((Thm.nprems_of th) - nprems))
dixon@15936
   406
                                 th);
wenzelm@16978
   407
        val sortedoccL =
dixon@16004
   408
            Library.sort (Library.rev_order o Library.int_ord) occL;
dixon@15936
   409
      in
dixon@16004
   410
        Seq.map distinct_subgoals (Seq.EVERY (map apply_occ sortedoccL) th)
dixon@15936
   411
      end
dixon@15959
   412
    end
dixon@15959
   413
    handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
dixon@15959
   414
paulson@15481
   415
paulson@15481
   416
(* inthms are the given arguments in Isar, and treated as eqstep with
paulson@15481
   417
   the first one, then the second etc *)
wenzelm@18598
   418
fun eqsubst_meth ctxt occL inthms =
wenzelm@21588
   419
    Method.SIMPLE_METHOD' (eqsubst_tac ctxt occL inthms);
paulson@15481
   420
dixon@16004
   421
(* apply a substitution inside assumption j, keeps asm in the same place *)
wenzelm@16978
   422
fun apply_subst_in_asm i th rule ((cfvs, j, ngoalprems, pth),m) =
wenzelm@16978
   423
    let
dixon@16004
   424
      val th2 = Thm.rotate_rule (j - 1) i th; (* put premice first *)
wenzelm@16978
   425
      val preelimrule =
dixon@16004
   426
          (RWInst.rw m rule pth)
wenzelm@21708
   427
            |> (Seq.hd o prune_params_tac)
dixon@16004
   428
            |> Thm.permute_prems 0 ~1 (* put old asm first *)
dixon@16004
   429
            |> IsaND.unfix_frees cfvs (* unfix any global params *)
dixon@16004
   430
            |> RWInst.beta_eta_contract; (* normal form *)
wenzelm@16978
   431
  (*    val elimrule =
dixon@16004
   432
          preelimrule
dixon@16004
   433
            |> Tactic.make_elim (* make into elim rule *)
dixon@16004
   434
            |> Thm.lift_rule (th2, i); (* lift into context *)
dixon@16007
   435
   *)
dixon@16004
   436
    in
dixon@16004
   437
      (* ~j because new asm starts at back, thus we subtract 1 *)
dixon@16007
   438
      Seq.map (Thm.rotate_rule (~j) ((Thm.nprems_of rule) + i))
dixon@16007
   439
      (Tactic.dtac preelimrule i th2)
dixon@16007
   440
wenzelm@16978
   441
      (* (Thm.bicompose
dixon@16004
   442
                 false (* use unification *)
dixon@16004
   443
                 (true, (* elim resolution *)
dixon@16007
   444
                  elimrule, (2 + (Thm.nprems_of rule)) - ngoalprems)
dixon@16007
   445
                 i th2) *)
dixon@16004
   446
    end;
paulson@15481
   447
paulson@15481
   448
dixon@15538
   449
(* prepare to substitute within the j'th premise of subgoal i of gth,
dixon@15538
   450
using a meta-level equation. Note that we assume rule has var indicies
dixon@15538
   451
zero'd. Note that we also assume that premt is the j'th premice of
dixon@15538
   452
subgoal i of gth. Note the repetition of work done for each
dixon@15538
   453
assumption, i.e. this can be made more efficient for search over
dixon@15538
   454
multiple assumptions.  *)
wenzelm@16978
   455
fun prep_subst_in_asm i gth j =
wenzelm@16978
   456
    let
paulson@15481
   457
      val th = Thm.incr_indexes 1 gth;
paulson@15481
   458
      val tgt_term = Thm.prop_of th;
paulson@15481
   459
wenzelm@22578
   460
      val sgn = Thm.theory_of_thm th;
paulson@15481
   461
      val ctermify = Thm.cterm_of sgn;
paulson@15481
   462
      val trivify = Thm.trivial o ctermify;
paulson@15481
   463
paulson@15481
   464
      val (fixedbody, fvs) = IsaND.fix_alls_term i tgt_term;
paulson@15481
   465
      val cfvs = rev (map ctermify fvs);
paulson@15481
   466
haftmann@18011
   467
      val asmt = nth (Logic.strip_imp_prems fixedbody) (j - 1);
dixon@15538
   468
      val asm_nprems = length (Logic.strip_imp_prems asmt);
dixon@15538
   469
dixon@15538
   470
      val pth = trivify asmt;
dixon@15538
   471
      val maxidx = Term.maxidx_of_term asmt;
dixon@15538
   472
dixon@19835
   473
      val ft = ((Z.move_down_right (* trueprop *)
dixon@19835
   474
                 o Z.mktop
dixon@16004
   475
                 o Thm.prop_of) pth)
dixon@16004
   476
    in ((cfvs, j, asm_nprems, pth), (sgn, maxidx, ft)) end;
paulson@15481
   477
dixon@15538
   478
(* prepare subst in every possible assumption *)
wenzelm@16978
   479
fun prep_subst_in_asms i gth =
dixon@16004
   480
    map (prep_subst_in_asm i gth)
dixon@19835
   481
        ((fn l => Library.upto (1, length l))
dixon@16004
   482
           (Logic.prems_of_goal (Thm.prop_of gth) i));
dixon@15538
   483
dixon@15538
   484
dixon@15538
   485
(* substitute in an assumption using an object or meta level equality *)
wenzelm@18598
   486
fun eqsubst_asm_tac' ctxt searchf skipocc instepthm i th =
wenzelm@16978
   487
    let
dixon@16004
   488
      val asmpreps = prep_subst_in_asms i th;
wenzelm@18598
   489
      val stepthms = Seq.of_list (prep_meta_eq ctxt instepthm);
dixon@16004
   490
      fun rewrite_with_thm r =
dixon@16004
   491
          let val (lhs,_) = Logic.dest_equals (Thm.concl_of r)
dixon@16004
   492
            fun occ_search occ [] = Seq.empty
dixon@16004
   493
              | occ_search occ ((asminfo, searchinfo)::moreasms) =
wenzelm@16978
   494
                (case searchf searchinfo occ lhs of
dixon@19835
   495
                   SkipMore i => occ_search i moreasms
dixon@19835
   496
                 | SkipSeq ss =>
wenzelm@19861
   497
                   Seq.append (Seq.map (Library.pair asminfo) (Seq.flat ss))
wenzelm@19861
   498
                               (occ_search 1 moreasms))
dixon@16004
   499
                              (* find later substs also *)
wenzelm@16978
   500
          in
wenzelm@18598
   501
            occ_search skipocc asmpreps |> Seq.maps (apply_subst_in_asm i th r)
dixon@16004
   502
          end;
wenzelm@18598
   503
    in stepthms |> Seq.maps rewrite_with_thm end;
dixon@15538
   504
dixon@16004
   505
wenzelm@16978
   506
fun skip_first_asm_occs_search searchf sinfo occ lhs =
dixon@19835
   507
    skipto_skipseq occ (searchf sinfo lhs);
dixon@16004
   508
wenzelm@18598
   509
fun eqsubst_asm_tac ctxt occL thms i th =
wenzelm@16978
   510
    let val nprems = Thm.nprems_of th
dixon@15538
   511
    in
dixon@16004
   512
      if nprems < i then Seq.empty else
wenzelm@16978
   513
      let val thmseq = (Seq.of_list thms)
wenzelm@16978
   514
        fun apply_occ occK th =
wenzelm@18598
   515
            thmseq |> Seq.maps
wenzelm@16978
   516
                    (fn r =>
wenzelm@18598
   517
                        eqsubst_asm_tac' ctxt (skip_first_asm_occs_search
dixon@19871
   518
                                            searchf_lr_unify_valid) occK r
dixon@16004
   519
                                         (i + ((Thm.nprems_of th) - nprems))
dixon@16004
   520
                                         th);
wenzelm@16978
   521
        val sortedoccs =
dixon@16004
   522
            Library.sort (Library.rev_order o Library.int_ord) occL
dixon@16004
   523
      in
dixon@16004
   524
        Seq.map distinct_subgoals
dixon@16004
   525
                (Seq.EVERY (map apply_occ sortedoccs) th)
dixon@16004
   526
      end
dixon@16004
   527
    end
dixon@16004
   528
    handle THM _ => raise eqsubst_occL_exp ("THM",occL,thms,i,th);
paulson@15481
   529
paulson@15481
   530
(* inthms are the given arguments in Isar, and treated as eqstep with
paulson@15481
   531
   the first one, then the second etc *)
wenzelm@18598
   532
fun eqsubst_asm_meth ctxt occL inthms =
wenzelm@21588
   533
    Method.SIMPLE_METHOD' (eqsubst_asm_tac ctxt occL inthms);
paulson@15481
   534
paulson@15481
   535
(* syntax for options, given "(asm)" will give back true, without
paulson@15481
   536
   gives back false *)
paulson@15481
   537
val options_syntax =
paulson@15481
   538
    (Args.parens (Args.$$$ "asm") >> (K true)) ||
paulson@15481
   539
     (Scan.succeed false);
dixon@15936
   540
dixon@15929
   541
val ith_syntax =
dixon@15936
   542
    (Args.parens (Scan.repeat Args.nat))
dixon@15936
   543
      || (Scan.succeed [0]);
paulson@15481
   544
wenzelm@18598
   545
(* combination method that takes a flag (true indicates that subst
wenzelm@18598
   546
should be done to an assumption, false = apply to the conclusion of
wenzelm@18598
   547
the goal) as well as the theorems to use *)
wenzelm@18598
   548
fun subst_meth src =
wenzelm@18988
   549
  Method.syntax ((Scan.lift options_syntax) -- (Scan.lift ith_syntax) -- Attrib.thms) src
haftmann@21879
   550
  #> (fn (((asmflag, occL), inthms), ctxt) =>
wenzelm@18598
   551
    (if asmflag then eqsubst_asm_meth else eqsubst_meth) ctxt occL inthms);
paulson@15481
   552
wenzelm@18598
   553
wenzelm@16978
   554
val setup =
wenzelm@18833
   555
  Method.add_method ("subst", subst_meth, "single-step substitution");
paulson@15481
   556
wenzelm@16978
   557
end;