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