src/Pure/meta_simplifier.ML
author wenzelm
Thu Apr 22 10:52:32 2004 +0200 (2004-04-22)
changeset 14643 130076a81b84
parent 14330 eb8b8241ef5b
child 14981 e73f8140af78
permissions -rw-r--r--
tuned;
berghofe@10413
     1
(*  Title:      Pure/meta_simplifier.ML
berghofe@10413
     2
    ID:         $Id$
wenzelm@11672
     3
    Author:     Tobias Nipkow and Stefan Berghofer
wenzelm@12783
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
berghofe@10413
     5
wenzelm@11672
     6
Meta-level Simplification.
berghofe@10413
     7
*)
berghofe@10413
     8
wenzelm@11672
     9
signature BASIC_META_SIMPLIFIER =
wenzelm@11672
    10
sig
wenzelm@11672
    11
  val trace_simp: bool ref
wenzelm@11672
    12
  val debug_simp: bool ref
nipkow@13828
    13
  val simp_depth_limit: int ref
wenzelm@11672
    14
end;
wenzelm@11672
    15
berghofe@10413
    16
signature META_SIMPLIFIER =
berghofe@10413
    17
sig
wenzelm@11672
    18
  include BASIC_META_SIMPLIFIER
berghofe@10413
    19
  exception SIMPLIFIER of string * thm
wenzelm@13486
    20
  exception SIMPROC_FAIL of string * exn
berghofe@10413
    21
  type meta_simpset
wenzelm@12603
    22
  val dest_mss          : meta_simpset ->
berghofe@10413
    23
    {simps: thm list, congs: thm list, procs: (string * cterm list) list}
berghofe@10413
    24
  val empty_mss         : meta_simpset
wenzelm@12603
    25
  val clear_mss         : meta_simpset -> meta_simpset
wenzelm@12603
    26
  val merge_mss         : meta_simpset * meta_simpset -> meta_simpset
berghofe@10413
    27
  val add_simps         : meta_simpset * thm list -> meta_simpset
berghofe@10413
    28
  val del_simps         : meta_simpset * thm list -> meta_simpset
berghofe@10413
    29
  val mss_of            : thm list -> meta_simpset
berghofe@10413
    30
  val add_congs         : meta_simpset * thm list -> meta_simpset
berghofe@10413
    31
  val del_congs         : meta_simpset * thm list -> meta_simpset
wenzelm@12603
    32
  val add_simprocs      : meta_simpset *
berghofe@10413
    33
    (string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp) list
berghofe@10413
    34
      -> meta_simpset
wenzelm@12603
    35
  val del_simprocs      : meta_simpset *
berghofe@10413
    36
    (string * cterm list * (Sign.sg -> thm list -> term -> thm option) * stamp) list
berghofe@10413
    37
      -> meta_simpset
berghofe@10413
    38
  val add_prems         : meta_simpset * thm list -> meta_simpset
berghofe@10413
    39
  val prems_of_mss      : meta_simpset -> thm list
berghofe@10413
    40
  val set_mk_rews       : meta_simpset * (thm -> thm list) -> meta_simpset
berghofe@10413
    41
  val set_mk_sym        : meta_simpset * (thm -> thm option) -> meta_simpset
berghofe@10413
    42
  val set_mk_eq_True    : meta_simpset * (thm -> thm option) -> meta_simpset
skalberg@14242
    43
  val get_mk_rews       : meta_simpset -> thm -> thm list
skalberg@14242
    44
  val get_mk_sym        : meta_simpset -> thm -> thm option
skalberg@14242
    45
  val get_mk_eq_True    : meta_simpset -> thm -> thm option
berghofe@10413
    46
  val set_termless      : meta_simpset * (term * term -> bool) -> meta_simpset
wenzelm@12779
    47
  val beta_eta_conversion: cterm -> thm
wenzelm@11672
    48
  val rewrite_cterm: bool * bool * bool ->
wenzelm@11672
    49
    (meta_simpset -> thm -> thm option) -> meta_simpset -> cterm -> thm
berghofe@11736
    50
  val goals_conv        : (int -> bool) -> (cterm -> thm) -> cterm -> thm
berghofe@11736
    51
  val forall_conv       : (cterm -> thm) -> cterm -> thm
berghofe@11736
    52
  val fconv_rule        : (cterm -> thm) -> thm -> thm
wenzelm@11767
    53
  val rewrite_aux       : (meta_simpset -> thm -> thm option) -> bool -> thm list -> cterm -> thm
wenzelm@11767
    54
  val simplify_aux      : (meta_simpset -> thm -> thm option) -> bool -> thm list -> thm -> thm
berghofe@10413
    55
  val rewrite_thm       : bool * bool * bool
berghofe@10413
    56
                          -> (meta_simpset -> thm -> thm option)
berghofe@10413
    57
                          -> meta_simpset -> thm -> thm
berghofe@10413
    58
  val rewrite_goals_rule_aux: (meta_simpset -> thm -> thm option) -> thm list -> thm -> thm
berghofe@10413
    59
  val rewrite_goal_rule : bool* bool * bool
berghofe@10413
    60
                          -> (meta_simpset -> thm -> thm option)
berghofe@10413
    61
                          -> meta_simpset -> int -> thm -> thm
berghofe@13196
    62
  val rewrite_term: Sign.sg -> thm list -> (term -> term option) list -> term -> term
berghofe@10413
    63
end;
berghofe@10413
    64
berghofe@10413
    65
structure MetaSimplifier : META_SIMPLIFIER =
berghofe@10413
    66
struct
berghofe@10413
    67
berghofe@10413
    68
(** diagnostics **)
berghofe@10413
    69
berghofe@10413
    70
exception SIMPLIFIER of string * thm;
wenzelm@13486
    71
exception SIMPROC_FAIL of string * exn;
berghofe@10413
    72
nipkow@11505
    73
val simp_depth = ref 0;
nipkow@13828
    74
val simp_depth_limit = ref 1000;
nipkow@11505
    75
wenzelm@12603
    76
local
wenzelm@12603
    77
wenzelm@12603
    78
fun println a =
wenzelm@12603
    79
  tracing ((case ! simp_depth of 0 => "" | n => "[" ^ string_of_int n ^ "]") ^ a);
nipkow@11505
    80
nipkow@11505
    81
fun prnt warn a = if warn then warning a else println a;
wenzelm@12603
    82
fun prtm warn a sign t = prnt warn (a ^ "\n" ^ Sign.string_of_term sign t);
wenzelm@12603
    83
fun prctm warn a t = prnt warn (a ^ "\n" ^ Display.string_of_cterm t);
berghofe@10413
    84
wenzelm@12603
    85
in
berghofe@10413
    86
wenzelm@12603
    87
fun prthm warn a = prctm warn a o Thm.cprop_of;
berghofe@10413
    88
berghofe@10413
    89
val trace_simp = ref false;
berghofe@10413
    90
val debug_simp = ref false;
berghofe@10413
    91
berghofe@10413
    92
fun trace warn a = if !trace_simp then prnt warn a else ();
berghofe@10413
    93
fun debug warn a = if !debug_simp then prnt warn a else ();
berghofe@10413
    94
berghofe@10413
    95
fun trace_term warn a sign t = if !trace_simp then prtm warn a sign t else ();
berghofe@10413
    96
fun trace_cterm warn a t = if !trace_simp then prctm warn a t else ();
berghofe@10413
    97
fun debug_term warn a sign t = if !debug_simp then prtm warn a sign t else ();
berghofe@10413
    98
nipkow@13569
    99
fun trace_thm a thm =
berghofe@10413
   100
  let val {sign, prop, ...} = rep_thm thm
nipkow@13569
   101
  in trace_term false a sign prop end;
nipkow@13569
   102
berghofe@13607
   103
fun trace_named_thm a (thm, name) =
berghofe@13607
   104
  trace_thm (a ^ (if name = "" then "" else " " ^ quote name) ^ ":") thm;
berghofe@10413
   105
wenzelm@12603
   106
end;
berghofe@10413
   107
berghofe@10413
   108
berghofe@10413
   109
(** meta simp sets **)
berghofe@10413
   110
berghofe@10413
   111
(* basic components *)
berghofe@10413
   112
berghofe@13607
   113
type rrule = {thm: thm, name: string, lhs: term, elhs: cterm, fo: bool, perm: bool};
berghofe@10413
   114
(* thm: the rewrite rule
berghofe@13607
   115
   name: name of theorem from which rewrite rule was extracted
berghofe@10413
   116
   lhs: the left-hand side
berghofe@10413
   117
   elhs: the etac-contracted lhs.
berghofe@10413
   118
   fo:  use first-order matching
berghofe@10413
   119
   perm: the rewrite rule is permutative
wenzelm@12603
   120
Remarks:
berghofe@10413
   121
  - elhs is used for matching,
berghofe@10413
   122
    lhs only for preservation of bound variable names.
berghofe@10413
   123
  - fo is set iff
berghofe@10413
   124
    either elhs is first-order (no Var is applied),
berghofe@10413
   125
           in which case fo-matching is complete,
berghofe@10413
   126
    or elhs is not a pattern,
berghofe@10413
   127
       in which case there is nothing better to do.
berghofe@10413
   128
*)
berghofe@10413
   129
type cong = {thm: thm, lhs: cterm};
berghofe@10413
   130
type simproc =
berghofe@10413
   131
 {name: string, proc: Sign.sg -> thm list -> term -> thm option, lhs: cterm, id: stamp};
berghofe@10413
   132
berghofe@10413
   133
fun eq_rrule ({thm = thm1, ...}: rrule, {thm = thm2, ...}: rrule) =
berghofe@10413
   134
  #prop (rep_thm thm1) aconv #prop (rep_thm thm2);
berghofe@10413
   135
wenzelm@12603
   136
fun eq_cong ({thm = thm1, ...}: cong, {thm = thm2, ...}: cong) =
berghofe@10413
   137
  #prop (rep_thm thm1) aconv #prop (rep_thm thm2);
berghofe@10413
   138
berghofe@10413
   139
fun eq_prem (thm1, thm2) =
berghofe@10413
   140
  #prop (rep_thm thm1) aconv #prop (rep_thm thm2);
berghofe@10413
   141
berghofe@10413
   142
fun eq_simproc ({id = s1, ...}:simproc, {id = s2, ...}:simproc) = (s1 = s2);
berghofe@10413
   143
berghofe@10413
   144
fun mk_simproc (name, proc, lhs, id) =
berghofe@10413
   145
  {name = name, proc = proc, lhs = lhs, id = id};
berghofe@10413
   146
berghofe@10413
   147
berghofe@10413
   148
(* datatype mss *)
berghofe@10413
   149
berghofe@10413
   150
(*
berghofe@10413
   151
  A "mss" contains data needed during conversion:
berghofe@10413
   152
    rules: discrimination net of rewrite rules;
berghofe@10413
   153
    congs: association list of congruence rules and
berghofe@10413
   154
           a list of `weak' congruence constants.
berghofe@10413
   155
           A congruence is `weak' if it avoids normalization of some argument.
berghofe@10413
   156
    procs: discrimination net of simplification procedures
berghofe@10413
   157
      (functions that prove rewrite rules on the fly);
berghofe@10413
   158
    bounds: names of bound variables already used
berghofe@10413
   159
      (for generating new names when rewriting under lambda abstractions);
berghofe@10413
   160
    prems: current premises;
berghofe@10413
   161
    mk_rews: mk: turns simplification thms into rewrite rules;
berghofe@10413
   162
             mk_sym: turns == around; (needs Drule!)
berghofe@10413
   163
             mk_eq_True: turns P into P == True - logic specific;
berghofe@10413
   164
    termless: relation for ordered rewriting;
nipkow@11504
   165
    depth: depth of conditional rewriting;
berghofe@10413
   166
*)
berghofe@10413
   167
berghofe@10413
   168
datatype meta_simpset =
berghofe@10413
   169
  Mss of {
berghofe@10413
   170
    rules: rrule Net.net,
berghofe@10413
   171
    congs: (string * cong) list * string list,
berghofe@10413
   172
    procs: simproc Net.net,
berghofe@10413
   173
    bounds: string list,
berghofe@10413
   174
    prems: thm list,
berghofe@10413
   175
    mk_rews: {mk: thm -> thm list,
berghofe@10413
   176
              mk_sym: thm -> thm option,
berghofe@10413
   177
              mk_eq_True: thm -> thm option},
nipkow@11504
   178
    termless: term * term -> bool,
nipkow@11504
   179
    depth: int};
berghofe@10413
   180
nipkow@11504
   181
fun mk_mss (rules, congs, procs, bounds, prems, mk_rews, termless, depth) =
berghofe@10413
   182
  Mss {rules = rules, congs = congs, procs = procs, bounds = bounds,
nipkow@11504
   183
       prems=prems, mk_rews=mk_rews, termless=termless, depth=depth};
berghofe@10413
   184
nipkow@11504
   185
fun upd_rules(Mss{rules,congs,procs,bounds,prems,mk_rews,termless,depth}, rules') =
nipkow@11504
   186
  mk_mss(rules',congs,procs,bounds,prems,mk_rews,termless,depth);
berghofe@10413
   187
berghofe@10413
   188
val empty_mss =
berghofe@10413
   189
  let val mk_rews = {mk = K [], mk_sym = K None, mk_eq_True = K None}
nipkow@11504
   190
  in mk_mss (Net.empty, ([], []), Net.empty, [], [], mk_rews, Term.termless, 0) end;
berghofe@10413
   191
berghofe@10413
   192
fun clear_mss (Mss {mk_rews, termless, ...}) =
nipkow@11504
   193
  mk_mss (Net.empty, ([], []), Net.empty, [], [], mk_rews, termless,0);
berghofe@10413
   194
nipkow@11504
   195
fun incr_depth(Mss{rules,congs,procs,bounds,prems,mk_rews,termless,depth}) =
nipkow@13828
   196
  let val depth1 = depth+1
nipkow@13828
   197
  in if depth1 > !simp_depth_limit
nipkow@13828
   198
     then (warning "simp_depth_limit exceeded - giving up"; None)
kleing@14040
   199
     else (if depth1 mod 10 = 0
nipkow@13828
   200
           then warning("Simplification depth " ^ string_of_int depth1)
nipkow@13828
   201
           else ();
nipkow@13828
   202
           Some(mk_mss(rules,congs,procs,bounds,prems,mk_rews,termless,depth1))
nipkow@13828
   203
          )
nipkow@13828
   204
  end;
berghofe@10413
   205
berghofe@10413
   206
berghofe@10413
   207
(** simpset operations **)
berghofe@10413
   208
berghofe@10413
   209
(* term variables *)
berghofe@10413
   210
berghofe@10413
   211
val add_term_varnames = foldl_aterms (fn (xs, Var (x, _)) => ins_ix (x, xs) | (xs, _) => xs);
berghofe@10413
   212
fun term_varnames t = add_term_varnames ([], t);
berghofe@10413
   213
berghofe@10413
   214
berghofe@10413
   215
(* dest_mss *)
berghofe@10413
   216
berghofe@10413
   217
fun dest_mss (Mss {rules, congs, procs, ...}) =
berghofe@10413
   218
  {simps = map (fn (_, {thm, ...}) => thm) (Net.dest rules),
berghofe@10413
   219
   congs = map (fn (_, {thm, ...}) => thm) (fst congs),
berghofe@10413
   220
   procs =
berghofe@10413
   221
     map (fn (_, {name, lhs, id, ...}) => ((name, lhs), id)) (Net.dest procs)
berghofe@10413
   222
     |> partition_eq eq_snd
berghofe@10413
   223
     |> map (fn ps => (#1 (#1 (hd ps)), map (#2 o #1) ps))
berghofe@10413
   224
     |> Library.sort_wrt #1};
berghofe@10413
   225
berghofe@10413
   226
wenzelm@12603
   227
(* merge_mss *)       (*NOTE: ignores mk_rews, termless and depth of 2nd mss*)
berghofe@10413
   228
berghofe@10413
   229
fun merge_mss
berghofe@10413
   230
 (Mss {rules = rules1, congs = (congs1,weak1), procs = procs1,
nipkow@11504
   231
       bounds = bounds1, prems = prems1, mk_rews, termless, depth},
berghofe@10413
   232
  Mss {rules = rules2, congs = (congs2,weak2), procs = procs2,
berghofe@10413
   233
       bounds = bounds2, prems = prems2, ...}) =
berghofe@10413
   234
      mk_mss
berghofe@10413
   235
       (Net.merge (rules1, rules2, eq_rrule),
wenzelm@12285
   236
        (gen_merge_lists (eq_cong o pairself snd) congs1 congs2,
berghofe@10413
   237
        merge_lists weak1 weak2),
berghofe@10413
   238
        Net.merge (procs1, procs2, eq_simproc),
berghofe@10413
   239
        merge_lists bounds1 bounds2,
wenzelm@12285
   240
        gen_merge_lists eq_prem prems1 prems2,
nipkow@11504
   241
        mk_rews, termless, depth);
berghofe@10413
   242
berghofe@10413
   243
berghofe@10413
   244
(* add_simps *)
berghofe@10413
   245
berghofe@13607
   246
fun mk_rrule2{thm, name, lhs, elhs, perm} =
berghofe@10413
   247
  let val fo = Pattern.first_order (term_of elhs) orelse not(Pattern.pattern (term_of elhs))
berghofe@13607
   248
  in {thm=thm, name=name, lhs=lhs, elhs=elhs, fo=fo, perm=perm} end
berghofe@10413
   249
berghofe@13607
   250
fun insert_rrule quiet (mss as Mss {rules,...},
berghofe@13607
   251
                 rrule as {thm,name,lhs,elhs,perm}) =
berghofe@13607
   252
  (trace_named_thm "Adding rewrite rule" (thm, name);
berghofe@10413
   253
   let val rrule2 as {elhs,...} = mk_rrule2 rrule
berghofe@10413
   254
       val rules' = Net.insert_term ((term_of elhs, rrule2), rules, eq_rrule)
berghofe@10413
   255
   in upd_rules(mss,rules') end
berghofe@13607
   256
   handle Net.INSERT => if quiet then mss else
berghofe@10413
   257
     (prthm true "Ignoring duplicate rewrite rule:" thm; mss));
berghofe@10413
   258
berghofe@10413
   259
fun vperm (Var _, Var _) = true
berghofe@10413
   260
  | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
berghofe@10413
   261
  | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
berghofe@10413
   262
  | vperm (t, u) = (t = u);
berghofe@10413
   263
berghofe@10413
   264
fun var_perm (t, u) =
berghofe@10413
   265
  vperm (t, u) andalso eq_set (term_varnames t, term_varnames u);
berghofe@10413
   266
berghofe@10413
   267
(* FIXME: it seems that the conditions on extra variables are too liberal if
berghofe@10413
   268
prems are nonempty: does solving the prems really guarantee instantiation of
berghofe@10413
   269
all its Vars? Better: a dynamic check each time a rule is applied.
berghofe@10413
   270
*)
berghofe@10413
   271
fun rewrite_rule_extra_vars prems elhs erhs =
berghofe@10413
   272
  not (term_varnames erhs subset foldl add_term_varnames (term_varnames elhs, prems))
berghofe@10413
   273
  orelse
berghofe@10413
   274
  not ((term_tvars erhs) subset
berghofe@10413
   275
       (term_tvars elhs  union  List.concat(map term_tvars prems)));
berghofe@10413
   276
berghofe@10413
   277
(*Simple test for looping rewrite rules and stupid orientations*)
berghofe@10413
   278
fun reorient sign prems lhs rhs =
berghofe@10413
   279
   rewrite_rule_extra_vars prems lhs rhs
berghofe@10413
   280
  orelse
berghofe@10413
   281
   is_Var (head_of lhs)
berghofe@10413
   282
  orelse
berghofe@10413
   283
   (exists (apl (lhs, Logic.occs)) (rhs :: prems))
berghofe@10413
   284
  orelse
berghofe@10413
   285
   (null prems andalso
wenzelm@14643
   286
    Pattern.matches (Sign.tsig_of sign) (lhs, rhs))
berghofe@10413
   287
    (*the condition "null prems" is necessary because conditional rewrites
berghofe@10413
   288
      with extra variables in the conditions may terminate although
berghofe@10413
   289
      the rhs is an instance of the lhs. Example: ?m < ?n ==> f(?n) == f(?m)*)
berghofe@10413
   290
  orelse
berghofe@10413
   291
   (is_Const lhs andalso not(is_Const rhs))
berghofe@10413
   292
berghofe@10413
   293
fun decomp_simp thm =
berghofe@10413
   294
  let val {sign, prop, ...} = rep_thm thm;
berghofe@10413
   295
      val prems = Logic.strip_imp_prems prop;
berghofe@10413
   296
      val concl = Drule.strip_imp_concl (cprop_of thm);
berghofe@10413
   297
      val (lhs, rhs) = Drule.dest_equals concl handle TERM _ =>
berghofe@10413
   298
        raise SIMPLIFIER ("Rewrite rule not a meta-equality", thm)
berghofe@10413
   299
      val elhs = snd (Drule.dest_equals (cprop_of (Thm.eta_conversion lhs)));
berghofe@10413
   300
      val elhs = if elhs=lhs then lhs else elhs (* try to share *)
berghofe@10413
   301
      val erhs = Pattern.eta_contract (term_of rhs);
berghofe@10413
   302
      val perm = var_perm (term_of elhs, erhs) andalso not (term_of elhs aconv erhs)
berghofe@10413
   303
                 andalso not (is_Var (term_of elhs))
berghofe@10413
   304
  in (sign, prems, term_of lhs, elhs, term_of rhs, perm) end;
berghofe@10413
   305
wenzelm@12783
   306
fun decomp_simp' thm =
wenzelm@12979
   307
  let val (_, _, lhs, _, rhs, _) = decomp_simp thm in
wenzelm@12783
   308
    if Thm.nprems_of thm > 0 then raise SIMPLIFIER ("Bad conditional rewrite rule", thm)
wenzelm@12979
   309
    else (lhs, rhs)
wenzelm@12783
   310
  end;
wenzelm@12783
   311
berghofe@13607
   312
fun mk_eq_True (Mss{mk_rews={mk_eq_True,...},...}) (thm, name) =
berghofe@10413
   313
  case mk_eq_True thm of
berghofe@10413
   314
    None => []
berghofe@13607
   315
  | Some eq_True =>
berghofe@13607
   316
      let val (_,_,lhs,elhs,_,_) = decomp_simp eq_True
berghofe@13607
   317
      in [{thm=eq_True, name=name, lhs=lhs, elhs=elhs, perm=false}] end;
berghofe@10413
   318
berghofe@10413
   319
(* create the rewrite rule and possibly also the ==True variant,
berghofe@10413
   320
   in case there are extra vars on the rhs *)
berghofe@13607
   321
fun rrule_eq_True(thm,name,lhs,elhs,rhs,mss,thm2) =
berghofe@13607
   322
  let val rrule = {thm=thm, name=name, lhs=lhs, elhs=elhs, perm=false}
berghofe@10413
   323
  in if (term_varnames rhs)  subset (term_varnames lhs) andalso
berghofe@10413
   324
        (term_tvars rhs) subset (term_tvars lhs)
berghofe@10413
   325
     then [rrule]
berghofe@13607
   326
     else mk_eq_True mss (thm2, name) @ [rrule]
berghofe@10413
   327
  end;
berghofe@10413
   328
berghofe@13607
   329
fun mk_rrule mss (thm, name) =
berghofe@10413
   330
  let val (_,prems,lhs,elhs,rhs,perm) = decomp_simp thm
berghofe@13607
   331
  in if perm then [{thm=thm, name=name, lhs=lhs, elhs=elhs, perm=true}] else
berghofe@10413
   332
     (* weak test for loops: *)
berghofe@10413
   333
     if rewrite_rule_extra_vars prems lhs rhs orelse
berghofe@10413
   334
        is_Var (term_of elhs)
berghofe@13607
   335
     then mk_eq_True mss (thm, name)
berghofe@13607
   336
     else rrule_eq_True(thm,name,lhs,elhs,rhs,mss,thm)
berghofe@10413
   337
  end;
berghofe@10413
   338
berghofe@13607
   339
fun orient_rrule mss (thm, name) =
berghofe@10413
   340
  let val (sign,prems,lhs,elhs,rhs,perm) = decomp_simp thm
berghofe@13607
   341
  in if perm then [{thm=thm, name=name, lhs=lhs, elhs=elhs, perm=true}]
berghofe@10413
   342
     else if reorient sign prems lhs rhs
berghofe@10413
   343
          then if reorient sign prems rhs lhs
berghofe@13607
   344
               then mk_eq_True mss (thm, name)
berghofe@10413
   345
               else let val Mss{mk_rews={mk_sym,...},...} = mss
berghofe@10413
   346
                    in case mk_sym thm of
berghofe@10413
   347
                         None => []
berghofe@10413
   348
                       | Some thm' =>
berghofe@10413
   349
                           let val (_,_,lhs',elhs',rhs',_) = decomp_simp thm'
berghofe@13607
   350
                           in rrule_eq_True(thm',name,lhs',elhs',rhs',mss,thm) end
berghofe@10413
   351
                    end
berghofe@13607
   352
          else rrule_eq_True(thm,name,lhs,elhs,rhs,mss,thm)
berghofe@10413
   353
  end;
berghofe@10413
   354
berghofe@13607
   355
fun extract_rews(Mss{mk_rews = {mk,...},...},thms) =
berghofe@13607
   356
  flat (map (fn thm => map (rpair (Thm.name_of_thm thm)) (mk thm)) thms);
berghofe@10413
   357
berghofe@10413
   358
fun orient_comb_simps comb mk_rrule (mss,thms) =
berghofe@10413
   359
  let val rews = extract_rews(mss,thms)
berghofe@10413
   360
      val rrules = flat (map mk_rrule rews)
berghofe@10413
   361
  in foldl comb (mss,rrules) end
berghofe@10413
   362
berghofe@10413
   363
(* Add rewrite rules explicitly; do not reorient! *)
berghofe@10413
   364
fun add_simps(mss,thms) =
berghofe@13607
   365
  orient_comb_simps (insert_rrule false) (mk_rrule mss) (mss,thms);
berghofe@10413
   366
berghofe@13607
   367
fun mss_of thms = foldl (insert_rrule false) (empty_mss, flat
berghofe@13607
   368
  (map (fn thm => mk_rrule empty_mss (thm, Thm.name_of_thm thm)) thms));
berghofe@10413
   369
berghofe@10413
   370
fun extract_safe_rrules(mss,thm) =
berghofe@10413
   371
  flat (map (orient_rrule mss) (extract_rews(mss,[thm])));
berghofe@10413
   372
berghofe@10413
   373
(* del_simps *)
berghofe@10413
   374
berghofe@10413
   375
fun del_rrule(mss as Mss {rules,...},
berghofe@10413
   376
              rrule as {thm, elhs, ...}) =
berghofe@10413
   377
  (upd_rules(mss, Net.delete_term ((term_of elhs, rrule), rules, eq_rrule))
berghofe@10413
   378
   handle Net.DELETE =>
berghofe@10413
   379
     (prthm true "Rewrite rule not in simpset:" thm; mss));
berghofe@10413
   380
berghofe@10413
   381
fun del_simps(mss,thms) =
berghofe@10413
   382
  orient_comb_simps del_rrule (map mk_rrule2 o mk_rrule mss) (mss,thms);
berghofe@10413
   383
berghofe@10413
   384
berghofe@10413
   385
(* add_congs *)
berghofe@10413
   386
berghofe@10413
   387
fun is_full_cong_prems [] varpairs = null varpairs
berghofe@10413
   388
  | is_full_cong_prems (p::prems) varpairs =
berghofe@10413
   389
    (case Logic.strip_assums_concl p of
berghofe@10413
   390
       Const("==",_) $ lhs $ rhs =>
berghofe@10413
   391
         let val (x,xs) = strip_comb lhs and (y,ys) = strip_comb rhs
berghofe@10413
   392
         in is_Var x  andalso  forall is_Bound xs  andalso
berghofe@10413
   393
            null(findrep(xs))  andalso xs=ys andalso
berghofe@10413
   394
            (x,y) mem varpairs andalso
berghofe@10413
   395
            is_full_cong_prems prems (varpairs\(x,y))
berghofe@10413
   396
         end
berghofe@10413
   397
     | _ => false);
berghofe@10413
   398
berghofe@10413
   399
fun is_full_cong thm =
berghofe@10413
   400
let val prems = prems_of thm
berghofe@10413
   401
    and concl = concl_of thm
berghofe@10413
   402
    val (lhs,rhs) = Logic.dest_equals concl
berghofe@10413
   403
    val (f,xs) = strip_comb lhs
berghofe@10413
   404
    and (g,ys) = strip_comb rhs
berghofe@10413
   405
in
berghofe@10413
   406
  f=g andalso null(findrep(xs@ys)) andalso length xs = length ys andalso
berghofe@10413
   407
  is_full_cong_prems prems (xs ~~ ys)
berghofe@10413
   408
end
berghofe@10413
   409
ballarin@13835
   410
fun cong_name (Const (a, _)) = Some a
ballarin@13835
   411
  | cong_name (Free (a, _)) = Some ("Free: " ^ a)
ballarin@13835
   412
  | cong_name _ = None;
ballarin@13835
   413
nipkow@11504
   414
fun add_cong (Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth}, thm) =
berghofe@10413
   415
  let
berghofe@10413
   416
    val (lhs, _) = Drule.dest_equals (Drule.strip_imp_concl (cprop_of thm)) handle TERM _ =>
berghofe@10413
   417
      raise SIMPLIFIER ("Congruence not a meta-equality", thm);
berghofe@10413
   418
(*   val lhs = Pattern.eta_contract lhs; *)
ballarin@13835
   419
    val a = (case cong_name (head_of (term_of lhs)) of
ballarin@13835
   420
        Some a => a
ballarin@13835
   421
      | None =>
ballarin@13835
   422
        raise SIMPLIFIER ("Congruence must start with a constant or free variable", thm));
berghofe@10413
   423
    val (alist,weak) = congs
berghofe@10413
   424
    val alist2 = overwrite_warn (alist, (a,{lhs=lhs, thm=thm}))
berghofe@10413
   425
           ("Overwriting congruence rule for " ^ quote a);
berghofe@10413
   426
    val weak2 = if is_full_cong thm then weak else a::weak
berghofe@10413
   427
  in
nipkow@11504
   428
    mk_mss (rules,(alist2,weak2),procs,bounds,prems,mk_rews,termless,depth)
berghofe@10413
   429
  end;
berghofe@10413
   430
berghofe@10413
   431
val (op add_congs) = foldl add_cong;
berghofe@10413
   432
berghofe@10413
   433
berghofe@10413
   434
(* del_congs *)
berghofe@10413
   435
nipkow@11504
   436
fun del_cong (Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth}, thm) =
berghofe@10413
   437
  let
berghofe@10413
   438
    val (lhs, _) = Logic.dest_equals (concl_of thm) handle TERM _ =>
berghofe@10413
   439
      raise SIMPLIFIER ("Congruence not a meta-equality", thm);
berghofe@10413
   440
(*   val lhs = Pattern.eta_contract lhs; *)
ballarin@13835
   441
    val a = (case cong_name (head_of lhs) of
ballarin@13835
   442
        Some a => a
ballarin@13835
   443
      | None =>
ballarin@13835
   444
        raise SIMPLIFIER ("Congruence must start with a constant", thm));
berghofe@10413
   445
    val (alist,_) = congs
berghofe@10413
   446
    val alist2 = filter (fn (x,_)=> x<>a) alist
berghofe@10413
   447
    val weak2 = mapfilter (fn(a,{thm,...}) => if is_full_cong thm then None
berghofe@10413
   448
                                              else Some a)
berghofe@10413
   449
                   alist2
berghofe@10413
   450
  in
nipkow@11504
   451
    mk_mss (rules,(alist2,weak2),procs,bounds,prems,mk_rews,termless,depth)
berghofe@10413
   452
  end;
berghofe@10413
   453
berghofe@10413
   454
val (op del_congs) = foldl del_cong;
berghofe@10413
   455
berghofe@10413
   456
berghofe@10413
   457
(* add_simprocs *)
berghofe@10413
   458
nipkow@11504
   459
fun add_proc (mss as Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth},
berghofe@10413
   460
    (name, lhs, proc, id)) =
berghofe@10413
   461
  let val {sign, t, ...} = rep_cterm lhs
berghofe@10413
   462
  in (trace_term false ("Adding simplification procedure " ^ quote name ^ " for")
berghofe@10413
   463
      sign t;
berghofe@10413
   464
    mk_mss (rules, congs,
berghofe@10413
   465
      Net.insert_term ((t, mk_simproc (name, proc, lhs, id)), procs, eq_simproc)
wenzelm@12603
   466
        handle Net.INSERT =>
wenzelm@12603
   467
            (warning ("Ignoring duplicate simplification procedure \""
wenzelm@12603
   468
                      ^ name ^ "\"");
wenzelm@12603
   469
             procs),
nipkow@11504
   470
        bounds, prems, mk_rews, termless,depth))
berghofe@10413
   471
  end;
berghofe@10413
   472
berghofe@10413
   473
fun add_simproc (mss, (name, lhss, proc, id)) =
berghofe@10413
   474
  foldl add_proc (mss, map (fn lhs => (name, lhs, proc, id)) lhss);
berghofe@10413
   475
berghofe@10413
   476
val add_simprocs = foldl add_simproc;
berghofe@10413
   477
berghofe@10413
   478
berghofe@10413
   479
(* del_simprocs *)
berghofe@10413
   480
nipkow@11504
   481
fun del_proc (mss as Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth},
berghofe@10413
   482
    (name, lhs, proc, id)) =
berghofe@10413
   483
  mk_mss (rules, congs,
berghofe@10413
   484
    Net.delete_term ((term_of lhs, mk_simproc (name, proc, lhs, id)), procs, eq_simproc)
wenzelm@12603
   485
      handle Net.DELETE =>
wenzelm@12603
   486
          (warning ("Simplification procedure \"" ^ name ^
wenzelm@12603
   487
                       "\" not in simpset"); procs),
nipkow@11504
   488
      bounds, prems, mk_rews, termless, depth);
berghofe@10413
   489
berghofe@10413
   490
fun del_simproc (mss, (name, lhss, proc, id)) =
berghofe@10413
   491
  foldl del_proc (mss, map (fn lhs => (name, lhs, proc, id)) lhss);
berghofe@10413
   492
berghofe@10413
   493
val del_simprocs = foldl del_simproc;
berghofe@10413
   494
berghofe@10413
   495
berghofe@10413
   496
(* prems *)
berghofe@10413
   497
nipkow@11504
   498
fun add_prems (Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth}, thms) =
nipkow@11504
   499
  mk_mss (rules, congs, procs, bounds, thms @ prems, mk_rews, termless, depth);
berghofe@10413
   500
berghofe@10413
   501
fun prems_of_mss (Mss {prems, ...}) = prems;
berghofe@10413
   502
berghofe@10413
   503
berghofe@10413
   504
(* mk_rews *)
berghofe@10413
   505
berghofe@10413
   506
fun set_mk_rews
nipkow@11504
   507
  (Mss {rules, congs, procs, bounds, prems, mk_rews, termless, depth}, mk) =
berghofe@10413
   508
    mk_mss (rules, congs, procs, bounds, prems,
berghofe@10413
   509
            {mk=mk, mk_sym= #mk_sym mk_rews, mk_eq_True= #mk_eq_True mk_rews},
nipkow@11504
   510
            termless, depth);
berghofe@10413
   511
berghofe@10413
   512
fun set_mk_sym
nipkow@11504
   513
  (Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth}, mk_sym) =
berghofe@10413
   514
    mk_mss (rules, congs, procs, bounds, prems,
berghofe@10413
   515
            {mk= #mk mk_rews, mk_sym= mk_sym, mk_eq_True= #mk_eq_True mk_rews},
nipkow@11504
   516
            termless,depth);
berghofe@10413
   517
berghofe@10413
   518
fun set_mk_eq_True
nipkow@11504
   519
  (Mss {rules,congs,procs,bounds,prems,mk_rews,termless,depth}, mk_eq_True) =
berghofe@10413
   520
    mk_mss (rules, congs, procs, bounds, prems,
berghofe@10413
   521
            {mk= #mk mk_rews, mk_sym= #mk_sym mk_rews, mk_eq_True= mk_eq_True},
nipkow@11504
   522
            termless,depth);
berghofe@10413
   523
skalberg@14242
   524
fun get_mk_rews    (Mss {mk_rews,...}) = #mk         mk_rews
skalberg@14242
   525
fun get_mk_sym     (Mss {mk_rews,...}) = #mk_sym     mk_rews
skalberg@14242
   526
fun get_mk_eq_True (Mss {mk_rews,...}) = #mk_eq_True mk_rews
skalberg@14242
   527
berghofe@10413
   528
(* termless *)
berghofe@10413
   529
berghofe@10413
   530
fun set_termless
nipkow@11504
   531
  (Mss {rules, congs, procs, bounds, prems, mk_rews, depth, ...}, termless) =
nipkow@11504
   532
    mk_mss (rules, congs, procs, bounds, prems, mk_rews, termless, depth);
berghofe@10413
   533
berghofe@10413
   534
berghofe@10413
   535
berghofe@10413
   536
(** rewriting **)
berghofe@10413
   537
berghofe@10413
   538
(*
berghofe@10413
   539
  Uses conversions, see:
berghofe@10413
   540
    L C Paulson, A higher-order implementation of rewriting,
berghofe@10413
   541
    Science of Computer Programming 3 (1983), pages 119-149.
berghofe@10413
   542
*)
berghofe@10413
   543
berghofe@10413
   544
val dest_eq = Drule.dest_equals o cprop_of;
berghofe@10413
   545
val lhs_of = fst o dest_eq;
berghofe@10413
   546
val rhs_of = snd o dest_eq;
berghofe@10413
   547
berghofe@10413
   548
fun beta_eta_conversion t =
berghofe@10413
   549
  let val thm = beta_conversion true t;
berghofe@10413
   550
  in transitive thm (eta_conversion (rhs_of thm)) end;
berghofe@10413
   551
berghofe@10413
   552
fun check_conv msg thm thm' =
berghofe@10413
   553
  let
berghofe@10413
   554
    val thm'' = transitive thm (transitive
berghofe@10413
   555
      (symmetric (beta_eta_conversion (lhs_of thm'))) thm')
nipkow@13569
   556
  in (if msg then trace_thm "SUCCEEDED" thm' else (); Some thm'') end
berghofe@10413
   557
  handle THM _ =>
berghofe@10413
   558
    let val {sign, prop = _ $ _ $ prop0, ...} = rep_thm thm;
berghofe@10413
   559
    in
nipkow@13569
   560
      (trace_thm "Proved wrong thm (Check subgoaler?)" thm';
berghofe@10413
   561
       trace_term false "Should have proved:" sign prop0;
berghofe@10413
   562
       None)
berghofe@10413
   563
    end;
berghofe@10413
   564
berghofe@10413
   565
berghofe@10413
   566
(* mk_procrule *)
berghofe@10413
   567
berghofe@10413
   568
fun mk_procrule thm =
berghofe@10413
   569
  let val (_,prems,lhs,elhs,rhs,_) = decomp_simp thm
berghofe@10413
   570
  in if rewrite_rule_extra_vars prems lhs rhs
berghofe@10413
   571
     then (prthm true "Extra vars on rhs:" thm; [])
berghofe@13607
   572
     else [mk_rrule2{thm=thm, name="", lhs=lhs, elhs=elhs, perm=false}]
berghofe@10413
   573
  end;
berghofe@10413
   574
berghofe@10413
   575
berghofe@10413
   576
(* conversion to apply the meta simpset to a term *)
berghofe@10413
   577
berghofe@10413
   578
(* Since the rewriting strategy is bottom-up, we avoid re-normalizing already
berghofe@10413
   579
   normalized terms by carrying around the rhs of the rewrite rule just
berghofe@10413
   580
   applied. This is called the `skeleton'. It is decomposed in parallel
berghofe@10413
   581
   with the term. Once a Var is encountered, the corresponding term is
berghofe@10413
   582
   already in normal form.
berghofe@10413
   583
   skel0 is a dummy skeleton that is to enforce complete normalization.
berghofe@10413
   584
*)
berghofe@10413
   585
val skel0 = Bound 0;
berghofe@10413
   586
berghofe@10413
   587
(* Use rhs as skeleton only if the lhs does not contain unnormalized bits.
berghofe@10413
   588
   The latter may happen iff there are weak congruence rules for constants
berghofe@10413
   589
   in the lhs.
berghofe@10413
   590
*)
berghofe@10413
   591
fun uncond_skel((_,weak),(lhs,rhs)) =
berghofe@10413
   592
  if null weak then rhs (* optimization *)
berghofe@10413
   593
  else if exists_Const (fn (c,_) => c mem weak) lhs then skel0
berghofe@10413
   594
       else rhs;
berghofe@10413
   595
berghofe@10413
   596
(* Behaves like unconditional rule if rhs does not contain vars not in the lhs.
berghofe@10413
   597
   Otherwise those vars may become instantiated with unnormalized terms
berghofe@10413
   598
   while the premises are solved.
berghofe@10413
   599
*)
berghofe@10413
   600
fun cond_skel(args as (congs,(lhs,rhs))) =
berghofe@10413
   601
  if term_varnames rhs subset term_varnames lhs then uncond_skel(args)
berghofe@10413
   602
  else skel0;
berghofe@10413
   603
berghofe@10413
   604
(*
berghofe@10413
   605
  we try in order:
berghofe@10413
   606
    (1) beta reduction
berghofe@10413
   607
    (2) unconditional rewrite rules
berghofe@10413
   608
    (3) conditional rewrite rules
berghofe@10413
   609
    (4) simplification procedures
berghofe@10413
   610
berghofe@10413
   611
  IMPORTANT: rewrite rules must not introduce new Vars or TVars!
berghofe@10413
   612
berghofe@10413
   613
*)
berghofe@10413
   614
berghofe@10413
   615
fun rewritec (prover, signt, maxt)
nipkow@11504
   616
             (mss as Mss{rules, procs, termless, prems, congs, depth,...}) t =
berghofe@10413
   617
  let
berghofe@10413
   618
    val eta_thm = Thm.eta_conversion t;
berghofe@10413
   619
    val eta_t' = rhs_of eta_thm;
berghofe@10413
   620
    val eta_t = term_of eta_t';
berghofe@10413
   621
    val tsigt = Sign.tsig_of signt;
berghofe@13607
   622
    fun rew {thm, name, lhs, elhs, fo, perm} =
berghofe@10413
   623
      let
berghofe@10413
   624
        val {sign, prop, maxidx, ...} = rep_thm thm;
berghofe@10413
   625
        val _ = if Sign.subsig (sign, signt) then ()
berghofe@10413
   626
                else (prthm true "Ignoring rewrite rule from different theory:" thm;
berghofe@10413
   627
                      raise Pattern.MATCH);
berghofe@10413
   628
        val (rthm, elhs') = if maxt = ~1 then (thm, elhs)
berghofe@10413
   629
          else (Thm.incr_indexes (maxt+1) thm, Thm.cterm_incr_indexes (maxt+1) elhs);
berghofe@10413
   630
        val insts = if fo then Thm.cterm_first_order_match (elhs', eta_t')
berghofe@10413
   631
                          else Thm.cterm_match (elhs', eta_t');
berghofe@10413
   632
        val thm' = Thm.instantiate insts (Thm.rename_boundvars lhs eta_t rthm);
wenzelm@14643
   633
        val prop' = Thm.prop_of thm';
berghofe@10413
   634
        val unconditional = (Logic.count_prems (prop',0) = 0);
berghofe@10413
   635
        val (lhs', rhs') = Logic.dest_equals (Logic.strip_imp_concl prop')
berghofe@10413
   636
      in
nipkow@11295
   637
        if perm andalso not (termless (rhs', lhs'))
berghofe@13607
   638
        then (trace_named_thm "Cannot apply permutative rewrite rule" (thm, name);
nipkow@13569
   639
              trace_thm "Term does not become smaller:" thm'; None)
berghofe@13607
   640
        else (trace_named_thm "Applying instance of rewrite rule" (thm, name);
berghofe@10413
   641
           if unconditional
berghofe@10413
   642
           then
nipkow@13569
   643
             (trace_thm "Rewriting:" thm';
berghofe@10413
   644
              let val lr = Logic.dest_equals prop;
berghofe@10413
   645
                  val Some thm'' = check_conv false eta_thm thm'
berghofe@10413
   646
              in Some (thm'', uncond_skel (congs, lr)) end)
berghofe@10413
   647
           else
nipkow@13569
   648
             (trace_thm "Trying to rewrite:" thm';
nipkow@13828
   649
              case incr_depth mss of
nipkow@13828
   650
                None => (trace_thm "FAILED - reached depth limit" thm'; None)
nipkow@13828
   651
              | Some mss =>
nipkow@13828
   652
              (case prover mss thm' of
nipkow@13569
   653
                None       => (trace_thm "FAILED" thm'; None)
berghofe@10413
   654
              | Some thm2 =>
berghofe@10413
   655
                  (case check_conv true eta_thm thm2 of
berghofe@10413
   656
                     None => None |
berghofe@10413
   657
                     Some thm2' =>
berghofe@10413
   658
                       let val concl = Logic.strip_imp_concl prop
berghofe@10413
   659
                           val lr = Logic.dest_equals concl
nipkow@13828
   660
                       in Some (thm2', cond_skel (congs, lr)) end))))
berghofe@10413
   661
      end
berghofe@10413
   662
berghofe@10413
   663
    fun rews [] = None
berghofe@10413
   664
      | rews (rrule :: rrules) =
berghofe@10413
   665
          let val opt = rew rrule handle Pattern.MATCH => None
berghofe@10413
   666
          in case opt of None => rews rrules | some => some end;
berghofe@10413
   667
berghofe@10413
   668
    fun sort_rrules rrs = let
wenzelm@14643
   669
      fun is_simple({thm, ...}:rrule) = case Thm.prop_of thm of
berghofe@10413
   670
                                      Const("==",_) $ _ $ _ => true
wenzelm@12603
   671
                                      | _                   => false
berghofe@10413
   672
      fun sort []        (re1,re2) = re1 @ re2
wenzelm@12603
   673
        | sort (rr::rrs) (re1,re2) = if is_simple rr
berghofe@10413
   674
                                     then sort rrs (rr::re1,re2)
berghofe@10413
   675
                                     else sort rrs (re1,rr::re2)
berghofe@10413
   676
    in sort rrs ([],[]) end
berghofe@10413
   677
berghofe@10413
   678
    fun proc_rews ([]:simproc list) = None
berghofe@10413
   679
      | proc_rews ({name, proc, lhs, ...} :: ps) =
berghofe@10413
   680
          if Pattern.matches tsigt (term_of lhs, term_of t) then
berghofe@10413
   681
            (debug_term false ("Trying procedure " ^ quote name ^ " on:") signt eta_t;
wenzelm@13486
   682
             case transform_failure (curry SIMPROC_FAIL name)
wenzelm@13486
   683
                 (fn () => proc signt prems eta_t) () of
wenzelm@13486
   684
               None => (debug false "FAILED"; proc_rews ps)
wenzelm@13486
   685
             | Some raw_thm =>
nipkow@13569
   686
                 (trace_thm ("Procedure " ^ quote name ^ " produced rewrite rule:") raw_thm;
berghofe@10413
   687
                  (case rews (mk_procrule raw_thm) of
wenzelm@13486
   688
                    None => (trace_cterm true ("IGNORED result of simproc " ^ quote name ^
wenzelm@13486
   689
                      " -- does not match") t; proc_rews ps)
berghofe@10413
   690
                  | some => some)))
berghofe@10413
   691
          else proc_rews ps;
berghofe@10413
   692
  in case eta_t of
berghofe@10413
   693
       Abs _ $ _ => Some (transitive eta_thm
berghofe@12155
   694
         (beta_conversion false eta_t'), skel0)
berghofe@10413
   695
     | _ => (case rews (sort_rrules (Net.match_term rules eta_t)) of
berghofe@10413
   696
               None => proc_rews (Net.match_term procs eta_t)
berghofe@10413
   697
             | some => some)
berghofe@10413
   698
  end;
berghofe@10413
   699
berghofe@10413
   700
berghofe@10413
   701
(* conversion to apply a congruence rule to a term *)
berghofe@10413
   702
berghofe@10413
   703
fun congc (prover,signt,maxt) {thm=cong,lhs=lhs} t =
wenzelm@14643
   704
  let val sign = Thm.sign_of_thm cong
berghofe@10413
   705
      val _ = if Sign.subsig (sign, signt) then ()
berghofe@10413
   706
                 else error("Congruence rule from different theory")
berghofe@10413
   707
      val rthm = if maxt = ~1 then cong else Thm.incr_indexes (maxt+1) cong;
berghofe@10413
   708
      val rlhs = fst (Drule.dest_equals (Drule.strip_imp_concl (cprop_of rthm)));
berghofe@10413
   709
      val insts = Thm.cterm_match (rlhs, t)
berghofe@10413
   710
      (* Pattern.match can raise Pattern.MATCH;
berghofe@10413
   711
         is handled when congc is called *)
berghofe@10413
   712
      val thm' = Thm.instantiate insts (Thm.rename_boundvars (term_of rlhs) (term_of t) rthm);
nipkow@13569
   713
      val unit = trace_thm "Applying congruence rule:" thm';
ballarin@13932
   714
      fun err (msg, thm) = (trace_thm msg thm; None)
berghofe@10413
   715
  in case prover thm' of
ballarin@13932
   716
       None => err ("Congruence proof failed.  Could not prove", thm')
berghofe@10413
   717
     | Some thm2 => (case check_conv true (beta_eta_conversion t) thm2 of
ballarin@13932
   718
          None => err ("Congruence proof failed.  Should not have proved", thm2)
berghofe@12155
   719
        | Some thm2' =>
berghofe@12155
   720
            if op aconv (pairself term_of (dest_equals (cprop_of thm2')))
berghofe@12155
   721
            then None else Some thm2')
berghofe@10413
   722
  end;
berghofe@10413
   723
berghofe@10413
   724
val (cA, (cB, cC)) =
berghofe@10413
   725
  apsnd dest_equals (dest_implies (hd (cprems_of Drule.imp_cong)));
berghofe@10413
   726
berghofe@13607
   727
fun transitive1 None None = None
berghofe@13607
   728
  | transitive1 (Some thm1) None = Some thm1
berghofe@13607
   729
  | transitive1 None (Some thm2) = Some thm2
berghofe@13607
   730
  | transitive1 (Some thm1) (Some thm2) = Some (transitive thm1 thm2)
berghofe@10413
   731
berghofe@13607
   732
fun transitive2 thm = transitive1 (Some thm);
berghofe@13607
   733
fun transitive3 thm = transitive1 thm o Some;
berghofe@13607
   734
berghofe@13607
   735
fun imp_cong' e = combination (combination refl_implies e);
berghofe@12155
   736
berghofe@10413
   737
fun bottomc ((simprem,useprem,mutsimp), prover, sign, maxidx) =
berghofe@10413
   738
  let
berghofe@10413
   739
    fun botc skel mss t =
berghofe@10413
   740
          if is_Var skel then None
berghofe@10413
   741
          else
berghofe@10413
   742
          (case subc skel mss t of
berghofe@10413
   743
             some as Some thm1 =>
berghofe@10413
   744
               (case rewritec (prover, sign, maxidx) mss (rhs_of thm1) of
berghofe@10413
   745
                  Some (thm2, skel2) =>
berghofe@13607
   746
                    transitive2 (transitive thm1 thm2)
berghofe@10413
   747
                      (botc skel2 mss (rhs_of thm2))
berghofe@10413
   748
                | None => some)
berghofe@10413
   749
           | None =>
berghofe@10413
   750
               (case rewritec (prover, sign, maxidx) mss t of
berghofe@13607
   751
                  Some (thm2, skel2) => transitive2 thm2
berghofe@10413
   752
                    (botc skel2 mss (rhs_of thm2))
berghofe@10413
   753
                | None => None))
berghofe@10413
   754
berghofe@10413
   755
    and try_botc mss t =
berghofe@10413
   756
          (case botc skel0 mss t of
berghofe@10413
   757
             Some trec1 => trec1 | None => (reflexive t))
berghofe@10413
   758
berghofe@10413
   759
    and subc skel
nipkow@11504
   760
          (mss as Mss{rules,congs,procs,bounds,prems,mk_rews,termless,depth}) t0 =
berghofe@10413
   761
       (case term_of t0 of
berghofe@10413
   762
           Abs (a, T, t) =>
berghofe@10413
   763
             let val b = variant bounds a
wenzelm@10767
   764
                 val (v, t') = Thm.dest_abs (Some ("." ^ b)) t0
nipkow@11504
   765
                 val mss' = mk_mss (rules, congs, procs, b :: bounds, prems, mk_rews, termless,depth)
berghofe@10413
   766
                 val skel' = case skel of Abs (_, _, sk) => sk | _ => skel0
berghofe@10413
   767
             in case botc skel' mss' t' of
berghofe@10413
   768
                  Some thm => Some (abstract_rule a v thm)
berghofe@10413
   769
                | None => None
berghofe@10413
   770
             end
berghofe@10413
   771
         | t $ _ => (case t of
berghofe@13614
   772
             Const ("==>", _) $ _  => impc t0 mss
berghofe@10413
   773
           | Abs _ =>
berghofe@10413
   774
               let val thm = beta_conversion false t0
berghofe@10413
   775
               in case subc skel0 mss (rhs_of thm) of
berghofe@10413
   776
                    None => Some thm
berghofe@10413
   777
                  | Some thm' => Some (transitive thm thm')
berghofe@10413
   778
               end
berghofe@10413
   779
           | _  =>
berghofe@10413
   780
               let fun appc () =
berghofe@10413
   781
                     let
berghofe@10413
   782
                       val (tskel, uskel) = case skel of
berghofe@10413
   783
                           tskel $ uskel => (tskel, uskel)
berghofe@10413
   784
                         | _ => (skel0, skel0);
wenzelm@10767
   785
                       val (ct, cu) = Thm.dest_comb t0
berghofe@10413
   786
                     in
berghofe@10413
   787
                     (case botc tskel mss ct of
berghofe@10413
   788
                        Some thm1 =>
berghofe@10413
   789
                          (case botc uskel mss cu of
berghofe@10413
   790
                             Some thm2 => Some (combination thm1 thm2)
berghofe@10413
   791
                           | None => Some (combination thm1 (reflexive cu)))
berghofe@10413
   792
                      | None =>
berghofe@10413
   793
                          (case botc uskel mss cu of
berghofe@10413
   794
                             Some thm1 => Some (combination (reflexive ct) thm1)
berghofe@10413
   795
                           | None => None))
berghofe@10413
   796
                     end
berghofe@10413
   797
                   val (h, ts) = strip_comb t
ballarin@13835
   798
               in case cong_name h of
ballarin@13835
   799
                    Some a =>
berghofe@10413
   800
                      (case assoc_string (fst congs, a) of
berghofe@10413
   801
                         None => appc ()
berghofe@10413
   802
                       | Some cong =>
berghofe@10413
   803
(* post processing: some partial applications h t1 ... tj, j <= length ts,
berghofe@10413
   804
   may be a redex. Example: map (%x.x) = (%xs.xs) wrt map_cong *)
berghofe@10413
   805
                          (let
berghofe@10413
   806
                             val thm = congc (prover mss, sign, maxidx) cong t0;
berghofe@12155
   807
                             val t = if_none (apsome rhs_of thm) t0;
wenzelm@10767
   808
                             val (cl, cr) = Thm.dest_comb t
berghofe@10413
   809
                             val dVar = Var(("", 0), dummyT)
berghofe@10413
   810
                             val skel =
berghofe@10413
   811
                               list_comb (h, replicate (length ts) dVar)
berghofe@10413
   812
                           in case botc skel mss cl of
berghofe@12155
   813
                                None => thm
berghofe@13607
   814
                              | Some thm' => transitive3 thm
berghofe@12155
   815
                                  (combination thm' (reflexive cr))
berghofe@10413
   816
                           end handle TERM _ => error "congc result"
berghofe@10413
   817
                                    | Pattern.MATCH => appc ()))
berghofe@10413
   818
                  | _ => appc ()
berghofe@10413
   819
               end)
berghofe@10413
   820
         | _ => None)
berghofe@10413
   821
berghofe@13607
   822
    and impc ct mss =
berghofe@13607
   823
      if mutsimp then mut_impc0 [] ct [] [] mss else nonmut_impc ct mss
berghofe@10413
   824
berghofe@13607
   825
    and rules_of_prem mss prem =
berghofe@13607
   826
      if maxidx_of_term (term_of prem) <> ~1
berghofe@13607
   827
      then (trace_cterm true
berghofe@13607
   828
        "Cannot add premise as rewrite rule because it contains (type) unknowns:" prem; ([], None))
berghofe@13607
   829
      else
berghofe@13607
   830
        let val asm = assume prem
berghofe@13607
   831
        in (extract_safe_rrules (mss, asm), Some asm) end
berghofe@10413
   832
berghofe@13607
   833
    and add_rrules (rrss, asms) mss =
berghofe@13607
   834
      add_prems (foldl (insert_rrule true) (mss, flat rrss), mapfilter I asms)
berghofe@10413
   835
berghofe@13607
   836
    and disch r (prem, eq) =
berghofe@13607
   837
      let
berghofe@13607
   838
        val (lhs, rhs) = dest_eq eq;
berghofe@13607
   839
        val eq' = implies_elim (Thm.instantiate
berghofe@13607
   840
          ([], [(cA, prem), (cB, lhs), (cC, rhs)]) Drule.imp_cong)
berghofe@13607
   841
          (implies_intr prem eq)
berghofe@13607
   842
      in if not r then eq' else
berghofe@10413
   843
        let
berghofe@13607
   844
          val (prem', concl) = dest_implies lhs;
berghofe@13607
   845
          val (prem'', _) = dest_implies rhs
berghofe@13607
   846
        in transitive (transitive
berghofe@13607
   847
          (Thm.instantiate ([], [(cA, prem'), (cB, prem), (cC, concl)])
berghofe@13607
   848
             Drule.swap_prems_eq) eq')
berghofe@13607
   849
          (Thm.instantiate ([], [(cA, prem), (cB, prem''), (cC, concl)])
berghofe@13607
   850
             Drule.swap_prems_eq)
berghofe@10413
   851
        end
berghofe@10413
   852
      end
berghofe@10413
   853
berghofe@13607
   854
    and rebuild [] _ _ _ _ eq = eq
berghofe@13607
   855
      | rebuild (prem :: prems) concl (rrs :: rrss) (asm :: asms) mss eq =
berghofe@13607
   856
          let
berghofe@13607
   857
            val mss' = add_rrules (rev rrss, rev asms) mss;
berghofe@13607
   858
            val concl' =
berghofe@13607
   859
              Drule.mk_implies (prem, if_none (apsome rhs_of eq) concl);
berghofe@13607
   860
            val dprem = apsome (curry (disch false) prem)
berghofe@13607
   861
          in case rewritec (prover, sign, maxidx) mss' concl' of
berghofe@13607
   862
              None => rebuild prems concl' rrss asms mss (dprem eq)
berghofe@13607
   863
            | Some (eq', _) => transitive2 (foldl (disch false o swap)
berghofe@13607
   864
                  (the (transitive3 (dprem eq) eq'), prems))
berghofe@13607
   865
                (mut_impc0 (rev prems) (rhs_of eq') (rev rrss) (rev asms) mss)
berghofe@13607
   866
          end
berghofe@13607
   867
          
berghofe@13607
   868
    and mut_impc0 prems concl rrss asms mss =
berghofe@13607
   869
      let
berghofe@13607
   870
        val prems' = strip_imp_prems concl;
berghofe@13607
   871
        val (rrss', asms') = split_list (map (rules_of_prem mss) prems')
berghofe@13607
   872
      in mut_impc (prems @ prems') (strip_imp_concl concl) (rrss @ rrss')
berghofe@13607
   873
        (asms @ asms') [] [] [] [] mss ~1 ~1
berghofe@13607
   874
      end
berghofe@13607
   875
 
berghofe@13607
   876
    and mut_impc [] concl [] [] prems' rrss' asms' eqns mss changed k =
berghofe@13607
   877
        transitive1 (foldl (fn (eq2, (eq1, prem)) => transitive1 eq1
berghofe@13607
   878
            (apsome (curry (disch false) prem) eq2)) (None, eqns ~~ prems'))
berghofe@13607
   879
          (if changed > 0 then
berghofe@13607
   880
             mut_impc (rev prems') concl (rev rrss') (rev asms')
berghofe@13607
   881
               [] [] [] [] mss ~1 changed
berghofe@13607
   882
           else rebuild prems' concl rrss' asms' mss
berghofe@13607
   883
             (botc skel0 (add_rrules (rev rrss', rev asms') mss) concl))
berghofe@13607
   884
berghofe@13607
   885
      | mut_impc (prem :: prems) concl (rrs :: rrss) (asm :: asms)
berghofe@13607
   886
          prems' rrss' asms' eqns mss changed k =
berghofe@13607
   887
        case (if k = 0 then None else botc skel0 (add_rrules
berghofe@13607
   888
          (rev rrss' @ rrss, rev asms' @ asms) mss) prem) of
berghofe@13607
   889
            None => mut_impc prems concl rrss asms (prem :: prems')
berghofe@13607
   890
              (rrs :: rrss') (asm :: asms') (None :: eqns) mss changed
berghofe@13607
   891
              (if k = 0 then 0 else k - 1)
berghofe@13607
   892
          | Some eqn =>
berghofe@13607
   893
            let
berghofe@13607
   894
              val prem' = rhs_of eqn;
berghofe@13607
   895
              val tprems = map term_of prems;
berghofe@13607
   896
              val i = 1 + foldl Int.max (~1, map (fn p =>
berghofe@13607
   897
                find_index_eq p tprems) (#hyps (rep_thm eqn)));
berghofe@13607
   898
              val (rrs', asm') = rules_of_prem mss prem'
berghofe@13607
   899
            in mut_impc prems concl rrss asms (prem' :: prems')
berghofe@13607
   900
              (rrs' :: rrss') (asm' :: asms') (Some (foldr (disch true)
berghofe@13607
   901
                (take (i, prems), imp_cong' eqn (reflexive (Drule.list_implies
berghofe@13607
   902
                  (drop (i, prems), concl))))) :: eqns) mss (length prems') ~1
berghofe@13607
   903
            end
berghofe@13607
   904
berghofe@10413
   905
     (* legacy code - only for backwards compatibility *)
berghofe@13607
   906
     and nonmut_impc ct mss =
berghofe@13607
   907
       let val (prem, conc) = dest_implies ct;
berghofe@13607
   908
           val thm1 = if simprem then botc skel0 mss prem else None;
berghofe@10413
   909
           val prem1 = if_none (apsome rhs_of thm1) prem;
berghofe@13607
   910
           val mss1 = if not useprem then mss else add_rrules
berghofe@13607
   911
             (apsnd single (apfst single (rules_of_prem mss prem1))) mss
berghofe@10413
   912
       in (case botc skel0 mss1 conc of
berghofe@10413
   913
           None => (case thm1 of
berghofe@10413
   914
               None => None
berghofe@13607
   915
             | Some thm1' => Some (imp_cong' thm1' (reflexive conc)))
berghofe@10413
   916
         | Some thm2 =>
berghofe@13607
   917
           let val thm2' = disch false (prem1, thm2)
berghofe@10413
   918
           in (case thm1 of
berghofe@10413
   919
               None => Some thm2'
berghofe@13607
   920
             | Some thm1' =>
berghofe@13607
   921
                 Some (transitive (imp_cong' thm1' (reflexive conc)) thm2'))
berghofe@10413
   922
           end)
berghofe@10413
   923
       end
berghofe@10413
   924
berghofe@10413
   925
 in try_botc end;
berghofe@10413
   926
berghofe@10413
   927
berghofe@10413
   928
(*** Meta-rewriting: rewrites t to u and returns the theorem t==u ***)
berghofe@10413
   929
berghofe@10413
   930
(*
berghofe@10413
   931
  Parameters:
berghofe@10413
   932
    mode = (simplify A,
berghofe@10413
   933
            use A in simplifying B,
berghofe@10413
   934
            use prems of B (if B is again a meta-impl.) to simplify A)
berghofe@10413
   935
           when simplifying A ==> B
berghofe@10413
   936
    mss: contains equality theorems of the form [|p1,...|] ==> t==u
berghofe@10413
   937
    prover: how to solve premises in conditional rewrites and congruences
berghofe@10413
   938
*)
berghofe@10413
   939
berghofe@10413
   940
fun rewrite_cterm mode prover mss ct =
berghofe@10413
   941
  let val {sign, t, maxidx, ...} = rep_cterm ct
nipkow@11505
   942
      val Mss{depth, ...} = mss
nipkow@14330
   943
  in trace_cterm false "SIMPLIFIER INVOKED ON THE FOLLOWING TERM:" ct;
nipkow@14330
   944
     simp_depth := depth;
nipkow@11505
   945
     bottomc (mode, prover, sign, maxidx) mss ct
nipkow@11505
   946
  end
berghofe@10413
   947
  handle THM (s, _, thms) =>
berghofe@10413
   948
    error ("Exception THM was raised in simplifier:\n" ^ s ^ "\n" ^
wenzelm@11886
   949
      Pretty.string_of (Display.pretty_thms thms));
berghofe@10413
   950
berghofe@10413
   951
(*In [A1,...,An]==>B, rewrite the selected A's only -- for rewrite_goals_tac*)
berghofe@10413
   952
fun goals_conv pred cv =
berghofe@10413
   953
  let fun gconv i ct =
berghofe@10413
   954
        let val (A,B) = Drule.dest_implies ct
berghofe@13661
   955
        in imp_cong' (if pred i then cv A else reflexive A) (gconv (i+1) B) end
berghofe@10413
   956
        handle TERM _ => reflexive ct
berghofe@10413
   957
  in gconv 1 end;
berghofe@10413
   958
berghofe@11737
   959
(* Rewrite A in !!x1,...,xn. A *)
berghofe@11736
   960
fun forall_conv cv ct =
berghofe@11736
   961
  let val p as (ct1, ct2) = Thm.dest_comb ct
berghofe@11736
   962
  in (case pairself term_of p of
berghofe@11736
   963
      (Const ("all", _), Abs (s, _, _)) =>
berghofe@11736
   964
         let val (v, ct') = Thm.dest_abs (Some "@") ct2;
berghofe@11736
   965
         in Thm.combination (Thm.reflexive ct1)
berghofe@11736
   966
           (Thm.abstract_rule s v (forall_conv cv ct'))
berghofe@11736
   967
         end
berghofe@11736
   968
    | _ => cv ct)
berghofe@11736
   969
  end handle TERM _ => cv ct;
berghofe@11736
   970
berghofe@10413
   971
(*Use a conversion to transform a theorem*)
berghofe@10413
   972
fun fconv_rule cv th = equal_elim (cv (cprop_of th)) th;
berghofe@10413
   973
wenzelm@11760
   974
(*Rewrite a cterm*)
wenzelm@11767
   975
fun rewrite_aux _ _ [] = (fn ct => Thm.reflexive ct)
wenzelm@11767
   976
  | rewrite_aux prover full thms = rewrite_cterm (full, false, false) prover (mss_of thms);
wenzelm@11672
   977
berghofe@10413
   978
(*Rewrite a theorem*)
wenzelm@11767
   979
fun simplify_aux _ _ [] = (fn th => th)
wenzelm@11767
   980
  | simplify_aux prover full thms =
wenzelm@11767
   981
      fconv_rule (rewrite_cterm (full, false, false) prover (mss_of thms));
berghofe@10413
   982
berghofe@10413
   983
fun rewrite_thm mode prover mss = fconv_rule (rewrite_cterm mode prover mss);
berghofe@10413
   984
berghofe@10413
   985
(*Rewrite the subgoals of a proof state (represented by a theorem) *)
berghofe@10413
   986
fun rewrite_goals_rule_aux _ []   th = th
berghofe@10413
   987
  | rewrite_goals_rule_aux prover thms th =
berghofe@10413
   988
      fconv_rule (goals_conv (K true) (rewrite_cterm (true, true, false) prover
berghofe@10413
   989
        (mss_of thms))) th;
berghofe@10413
   990
berghofe@10413
   991
(*Rewrite the subgoal of a proof state (represented by a theorem) *)
berghofe@10413
   992
fun rewrite_goal_rule mode prover mss i thm =
berghofe@10413
   993
  if 0 < i  andalso  i <= nprems_of thm
berghofe@10413
   994
  then fconv_rule (goals_conv (fn j => j=i) (rewrite_cterm mode prover mss)) thm
berghofe@10413
   995
  else raise THM("rewrite_goal_rule",i,[thm]);
berghofe@10413
   996
wenzelm@12783
   997
wenzelm@12783
   998
(*simple term rewriting -- without proofs*)
berghofe@13196
   999
fun rewrite_term sg rules procs =
berghofe@13196
  1000
  Pattern.rewrite_term (Sign.tsig_of sg) (map decomp_simp' rules) procs;
wenzelm@12783
  1001
berghofe@10413
  1002
end;
berghofe@10413
  1003
wenzelm@11672
  1004
structure BasicMetaSimplifier: BASIC_META_SIMPLIFIER = MetaSimplifier;
wenzelm@11672
  1005
open BasicMetaSimplifier;