src/HOL/Tools/SMT/smt_normalize.ML
author boehmes
Fri Oct 29 18:17:09 2010 +0200 (2010-10-29)
changeset 40278 0fc78bb54f18
parent 40275 eed48b11abdb
child 40279 96365b4ae7b6
permissions -rw-r--r--
optionally drop assumptions which cannot be preprocessed
boehmes@36898
     1
(*  Title:      HOL/Tools/SMT/smt_normalize.ML
boehmes@36898
     2
    Author:     Sascha Boehme, TU Muenchen
boehmes@36898
     3
boehmes@36898
     4
Normalization steps on theorems required by SMT solvers:
boehmes@36898
     5
  * simplify trivial distincts (those with less than three elements),
boehmes@36898
     6
  * rewrite bool case expressions as if expressions,
boehmes@36898
     7
  * normalize numerals (e.g. replace negative numerals by negated positive
boehmes@36898
     8
    numerals),
boehmes@36898
     9
  * embed natural numbers into integers,
boehmes@36898
    10
  * add extra rules specifying types and constants which occur frequently,
boehmes@36898
    11
  * fully translate into object logic, add universal closure,
boehmes@39483
    12
  * monomorphize (create instances of schematic rules),
boehmes@36898
    13
  * lift lambda terms,
boehmes@36898
    14
  * make applications explicit for functions with varying number of arguments.
boehmes@39483
    15
  * add (hypothetical definitions for) missing datatype selectors,
boehmes@36898
    16
*)
boehmes@36898
    17
boehmes@36898
    18
signature SMT_NORMALIZE =
boehmes@36898
    19
sig
boehmes@40162
    20
  type extra_norm = bool -> (int * thm) list -> Proof.context ->
boehmes@40161
    21
    (int * thm) list * Proof.context
boehmes@40278
    22
  val normalize: (Proof.context -> (thm -> string) -> thm -> unit) -> bool ->
boehmes@40278
    23
    extra_norm -> bool -> (int * thm) list -> Proof.context ->
boehmes@40161
    24
    (int * thm) list * Proof.context
boehmes@36899
    25
  val atomize_conv: Proof.context -> conv
boehmes@36898
    26
  val eta_expand_conv: (Proof.context -> conv) -> Proof.context -> conv
boehmes@36898
    27
end
boehmes@36898
    28
boehmes@36898
    29
structure SMT_Normalize: SMT_NORMALIZE =
boehmes@36898
    30
struct
boehmes@36898
    31
boehmes@36898
    32
infix 2 ??
boehmes@36898
    33
fun (test ?? f) x = if test x then f x else x
boehmes@36898
    34
boehmes@36898
    35
fun if_conv c cv1 cv2 ct = (if c (Thm.term_of ct) then cv1 else cv2) ct
boehmes@36898
    36
fun if_true_conv c cv = if_conv c cv Conv.all_conv
boehmes@36898
    37
boehmes@36898
    38
boehmes@36898
    39
boehmes@36898
    40
(* simplification of trivial distincts (distinct should have at least
boehmes@36898
    41
   three elements in the argument list) *)
boehmes@36898
    42
boehmes@36898
    43
local
boehmes@40274
    44
  fun is_trivial_distinct (Const (@{const_name SMT.distinct}, _) $ t) =
boehmes@40274
    45
       (length (HOLogic.dest_list t) <= 2
boehmes@40274
    46
        handle TERM _ => error ("SMT: constant " ^
boehmes@40274
    47
          quote @{const_name SMT.distinct} ^ " must be applied to " ^
boehmes@40274
    48
          "an explicit list."))
boehmes@36898
    49
    | is_trivial_distinct _ = false
boehmes@36898
    50
boehmes@37786
    51
  val thms = map mk_meta_eq @{lemma
boehmes@40274
    52
    "SMT.distinct [] = True"
boehmes@40274
    53
    "SMT.distinct [x] = True"
boehmes@40274
    54
    "SMT.distinct [x, y] = (x ~= y)"
boehmes@40274
    55
    by (simp_all add: distinct_def)}
boehmes@36898
    56
  fun distinct_conv _ =
wenzelm@36936
    57
    if_true_conv is_trivial_distinct (Conv.rewrs_conv thms)
boehmes@36898
    58
in
boehmes@36898
    59
fun trivial_distinct ctxt =
boehmes@40161
    60
  map (apsnd ((Term.exists_subterm is_trivial_distinct o Thm.prop_of) ??
boehmes@40161
    61
    Conv.fconv_rule (Conv.top_conv distinct_conv ctxt)))
boehmes@36898
    62
end
boehmes@36898
    63
boehmes@36898
    64
boehmes@36898
    65
boehmes@36898
    66
(* rewrite bool case expressions as if expressions *)
boehmes@36898
    67
boehmes@36898
    68
local
boehmes@36898
    69
  val is_bool_case = (fn
boehmes@36898
    70
      Const (@{const_name "bool.bool_case"}, _) $ _ $ _ $ _ => true
boehmes@36898
    71
    | _ => false)
boehmes@36898
    72
boehmes@40275
    73
  val thm = mk_meta_eq @{lemma
boehmes@40275
    74
    "(case P of True => x | False => y) = (if P then x else y)" by simp}
boehmes@40275
    75
  val unfold_conv = if_true_conv is_bool_case (Conv.rewr_conv thm)
boehmes@36898
    76
in
boehmes@36898
    77
fun rewrite_bool_cases ctxt =
boehmes@40161
    78
  map (apsnd ((Term.exists_subterm is_bool_case o Thm.prop_of) ??
boehmes@40161
    79
    Conv.fconv_rule (Conv.top_conv (K unfold_conv) ctxt)))
boehmes@36898
    80
end
boehmes@36898
    81
boehmes@36898
    82
boehmes@36898
    83
boehmes@36898
    84
(* normalization of numerals: rewriting of negative integer numerals into
boehmes@36898
    85
   positive numerals, Numeral0 into 0, Numeral1 into 1 *)
boehmes@36898
    86
boehmes@36898
    87
local
boehmes@36898
    88
  fun is_number_sort ctxt T =
boehmes@36898
    89
    Sign.of_sort (ProofContext.theory_of ctxt) (T, @{sort number_ring})
boehmes@36898
    90
boehmes@36898
    91
  fun is_strange_number ctxt (t as Const (@{const_name number_of}, _) $ _) =
boehmes@36898
    92
        (case try HOLogic.dest_number t of
boehmes@36898
    93
          SOME (T, i) => is_number_sort ctxt T andalso i < 2
boehmes@36898
    94
        | NONE => false)
boehmes@36898
    95
    | is_strange_number _ _ = false
boehmes@36898
    96
boehmes@36898
    97
  val pos_numeral_ss = HOL_ss
boehmes@36898
    98
    addsimps [@{thm Int.number_of_minus}, @{thm Int.number_of_Min}]
boehmes@36898
    99
    addsimps [@{thm Int.number_of_Pls}, @{thm Int.numeral_1_eq_1}]
boehmes@36898
   100
    addsimps @{thms Int.pred_bin_simps}
boehmes@36898
   101
    addsimps @{thms Int.normalize_bin_simps}
boehmes@36898
   102
    addsimps @{lemma
boehmes@36898
   103
      "Int.Min = - Int.Bit1 Int.Pls"
boehmes@36898
   104
      "Int.Bit0 (- Int.Pls) = - Int.Pls"
boehmes@36898
   105
      "Int.Bit0 (- k) = - Int.Bit0 k"
boehmes@36898
   106
      "Int.Bit1 (- k) = - Int.Bit1 (Int.pred k)"
boehmes@36898
   107
      by simp_all (simp add: pred_def)}
boehmes@36898
   108
boehmes@36898
   109
  fun pos_conv ctxt = if_conv (is_strange_number ctxt)
boehmes@36898
   110
    (Simplifier.rewrite (Simplifier.context ctxt pos_numeral_ss))
boehmes@36898
   111
    Conv.no_conv
boehmes@36898
   112
in
boehmes@36898
   113
fun normalize_numerals ctxt =
boehmes@40161
   114
  map (apsnd ((Term.exists_subterm (is_strange_number ctxt) o Thm.prop_of) ??
boehmes@40161
   115
    Conv.fconv_rule (Conv.top_sweep_conv pos_conv ctxt)))
boehmes@36898
   116
end
boehmes@36898
   117
boehmes@36898
   118
boehmes@36898
   119
boehmes@36898
   120
(* embedding of standard natural number operations into integer operations *)
boehmes@36898
   121
boehmes@36898
   122
local
boehmes@40161
   123
  val nat_embedding = map (pair ~1) @{lemma
boehmes@36898
   124
    "nat (int n) = n"
boehmes@36898
   125
    "i >= 0 --> int (nat i) = i"
boehmes@36898
   126
    "i < 0 --> int (nat i) = 0"
boehmes@36898
   127
    by simp_all}
boehmes@36898
   128
boehmes@36898
   129
  val nat_rewriting = @{lemma
boehmes@36898
   130
    "0 = nat 0"
boehmes@36898
   131
    "1 = nat 1"
boehmes@36898
   132
    "number_of i = nat (number_of i)"
boehmes@36898
   133
    "int (nat 0) = 0"
boehmes@36898
   134
    "int (nat 1) = 1"
boehmes@36898
   135
    "a < b = (int a < int b)"
boehmes@36898
   136
    "a <= b = (int a <= int b)"
boehmes@36898
   137
    "Suc a = nat (int a + 1)"
boehmes@36898
   138
    "a + b = nat (int a + int b)"
boehmes@36898
   139
    "a - b = nat (int a - int b)"
boehmes@36898
   140
    "a * b = nat (int a * int b)"
boehmes@36898
   141
    "a div b = nat (int a div int b)"
boehmes@36898
   142
    "a mod b = nat (int a mod int b)"
boehmes@36898
   143
    "min a b = nat (min (int a) (int b))"
boehmes@36898
   144
    "max a b = nat (max (int a) (int b))"
boehmes@36898
   145
    "int (nat (int a + int b)) = int a + int b"
boehmes@36898
   146
    "int (nat (int a * int b)) = int a * int b"
boehmes@36898
   147
    "int (nat (int a div int b)) = int a div int b"
boehmes@36898
   148
    "int (nat (int a mod int b)) = int a mod int b"
boehmes@36898
   149
    "int (nat (min (int a) (int b))) = min (int a) (int b)"
boehmes@36898
   150
    "int (nat (max (int a) (int b))) = max (int a) (int b)"
boehmes@36898
   151
    by (simp_all add: nat_mult_distrib nat_div_distrib nat_mod_distrib
boehmes@36898
   152
      int_mult[symmetric] zdiv_int[symmetric] zmod_int[symmetric])}
boehmes@36898
   153
boehmes@36898
   154
  fun on_positive num f x = 
boehmes@36898
   155
    (case try HOLogic.dest_number (Thm.term_of num) of
boehmes@36898
   156
      SOME (_, i) => if i >= 0 then SOME (f x) else NONE
boehmes@36898
   157
    | NONE => NONE)
boehmes@36898
   158
boehmes@36898
   159
  val cancel_int_nat_ss = HOL_ss
boehmes@36898
   160
    addsimps [@{thm Nat_Numeral.nat_number_of}]
boehmes@36898
   161
    addsimps [@{thm Nat_Numeral.int_nat_number_of}]
boehmes@36898
   162
    addsimps @{thms neg_simps}
boehmes@36898
   163
boehmes@36898
   164
  fun cancel_int_nat_simproc _ ss ct = 
boehmes@36898
   165
    let
boehmes@36898
   166
      val num = Thm.dest_arg (Thm.dest_arg ct)
boehmes@36898
   167
      val goal = Thm.mk_binop @{cterm "op == :: int => _"} ct num
boehmes@36898
   168
      val simpset = Simplifier.inherit_context ss cancel_int_nat_ss
boehmes@36898
   169
      fun tac _ = Simplifier.simp_tac simpset 1
boehmes@36898
   170
    in on_positive num (Goal.prove_internal [] goal) tac end
boehmes@36898
   171
boehmes@36898
   172
  val nat_ss = HOL_ss
boehmes@36898
   173
    addsimps nat_rewriting
boehmes@36898
   174
    addsimprocs [Simplifier.make_simproc {
boehmes@36898
   175
      name = "cancel_int_nat_num", lhss = [@{cpat "int (nat _)"}],
boehmes@36898
   176
      proc = cancel_int_nat_simproc, identifier = [] }]
boehmes@36898
   177
boehmes@36898
   178
  fun conv ctxt = Simplifier.rewrite (Simplifier.context ctxt nat_ss)
boehmes@36898
   179
boehmes@36898
   180
  val uses_nat_type = Term.exists_type (Term.exists_subtype (equal @{typ nat}))
boehmes@36898
   181
  val uses_nat_int =
boehmes@36898
   182
    Term.exists_subterm (member (op aconv) [@{term int}, @{term nat}])
boehmes@36898
   183
in
boehmes@36898
   184
fun nat_as_int ctxt =
boehmes@40161
   185
  map (apsnd ((uses_nat_type o Thm.prop_of) ?? Conv.fconv_rule (conv ctxt))) #>
boehmes@40161
   186
  exists (uses_nat_int o Thm.prop_of o snd) ?? append nat_embedding
boehmes@36898
   187
end
boehmes@36898
   188
boehmes@36898
   189
boehmes@36898
   190
boehmes@36898
   191
(* further normalizations: beta/eta, universal closure, atomize *)
boehmes@36898
   192
boehmes@36898
   193
val eta_expand_eq = @{lemma "f == (%x. f x)" by (rule reflexive)}
boehmes@36898
   194
boehmes@36898
   195
fun eta_expand_conv cv ctxt =
boehmes@36898
   196
  Conv.rewr_conv eta_expand_eq then_conv Conv.abs_conv (cv o snd) ctxt
boehmes@36898
   197
boehmes@36898
   198
local
boehmes@36898
   199
  val eta_conv = eta_expand_conv
boehmes@36898
   200
wenzelm@36936
   201
  fun keep_conv ctxt = Conv.binder_conv (norm_conv o snd) ctxt
boehmes@36898
   202
  and eta_binder_conv ctxt = Conv.arg_conv (eta_conv norm_conv ctxt)
boehmes@36898
   203
  and keep_let_conv ctxt = Conv.combination_conv
boehmes@36898
   204
    (Conv.arg_conv (norm_conv ctxt)) (Conv.abs_conv (norm_conv o snd) ctxt)
boehmes@36898
   205
  and unfold_let_conv ctxt = Conv.combination_conv
boehmes@36898
   206
    (Conv.arg_conv (norm_conv ctxt)) (eta_conv norm_conv ctxt)
boehmes@36898
   207
  and unfold_conv thm ctxt = Conv.rewr_conv thm then_conv keep_conv ctxt
boehmes@36898
   208
  and unfold_ex1_conv ctxt = unfold_conv @{thm Ex1_def} ctxt
boehmes@37786
   209
  and unfold_ball_conv ctxt = unfold_conv (mk_meta_eq @{thm Ball_def}) ctxt
boehmes@37786
   210
  and unfold_bex_conv ctxt = unfold_conv (mk_meta_eq @{thm Bex_def}) ctxt
boehmes@36898
   211
  and norm_conv ctxt ct =
boehmes@36898
   212
    (case Thm.term_of ct of
boehmes@36898
   213
      Const (@{const_name All}, _) $ Abs _ => keep_conv
boehmes@36898
   214
    | Const (@{const_name All}, _) $ _ => eta_binder_conv
boehmes@36898
   215
    | Const (@{const_name All}, _) => eta_conv eta_binder_conv
boehmes@36898
   216
    | Const (@{const_name Ex}, _) $ Abs _ => keep_conv
boehmes@36898
   217
    | Const (@{const_name Ex}, _) $ _ => eta_binder_conv
boehmes@36898
   218
    | Const (@{const_name Ex}, _) => eta_conv eta_binder_conv
boehmes@36898
   219
    | Const (@{const_name Let}, _) $ _ $ Abs _ => keep_let_conv
boehmes@36898
   220
    | Const (@{const_name Let}, _) $ _ $ _ => unfold_let_conv
boehmes@36898
   221
    | Const (@{const_name Let}, _) $ _ => eta_conv unfold_let_conv
boehmes@36898
   222
    | Const (@{const_name Let}, _) => eta_conv (eta_conv unfold_let_conv)
boehmes@36898
   223
    | Const (@{const_name Ex1}, _) $ _ => unfold_ex1_conv
boehmes@36898
   224
    | Const (@{const_name Ex1}, _) => eta_conv unfold_ex1_conv 
boehmes@36898
   225
    | Const (@{const_name Ball}, _) $ _ $ _ => unfold_ball_conv
boehmes@36898
   226
    | Const (@{const_name Ball}, _) $ _ => eta_conv unfold_ball_conv
boehmes@36898
   227
    | Const (@{const_name Ball}, _) => eta_conv (eta_conv unfold_ball_conv)
boehmes@36898
   228
    | Const (@{const_name Bex}, _) $ _ $ _ => unfold_bex_conv
boehmes@36898
   229
    | Const (@{const_name Bex}, _) $ _ => eta_conv unfold_bex_conv
boehmes@36898
   230
    | Const (@{const_name Bex}, _) => eta_conv (eta_conv unfold_bex_conv)
boehmes@36898
   231
    | Abs _ => Conv.abs_conv (norm_conv o snd)
boehmes@36898
   232
    | _ $ _ => Conv.comb_conv o norm_conv
boehmes@36898
   233
    | _ => K Conv.all_conv) ctxt ct
boehmes@36898
   234
boehmes@36898
   235
  fun is_normed t =
boehmes@36898
   236
    (case t of
boehmes@36898
   237
      Const (@{const_name All}, _) $ Abs (_, _, u) => is_normed u
boehmes@36898
   238
    | Const (@{const_name All}, _) $ _ => false
boehmes@36898
   239
    | Const (@{const_name All}, _) => false
boehmes@36898
   240
    | Const (@{const_name Ex}, _) $ Abs (_, _, u) => is_normed u
boehmes@36898
   241
    | Const (@{const_name Ex}, _) $ _ => false
boehmes@36898
   242
    | Const (@{const_name Ex}, _) => false
boehmes@36898
   243
    | Const (@{const_name Let}, _) $ u1 $ Abs (_, _, u2) =>
boehmes@36898
   244
        is_normed u1 andalso is_normed u2
boehmes@36898
   245
    | Const (@{const_name Let}, _) $ _ $ _ => false
boehmes@36898
   246
    | Const (@{const_name Let}, _) $ _ => false
boehmes@36898
   247
    | Const (@{const_name Let}, _) => false
boehmes@36898
   248
    | Const (@{const_name Ex1}, _) => false
boehmes@36898
   249
    | Const (@{const_name Ball}, _) => false
boehmes@36898
   250
    | Const (@{const_name Bex}, _) => false
boehmes@36898
   251
    | Abs (_, _, u) => is_normed u
boehmes@36898
   252
    | u1 $ u2 => is_normed u1 andalso is_normed u2
boehmes@36898
   253
    | _ => true)
boehmes@36898
   254
in
boehmes@36898
   255
fun norm_binder_conv ctxt = if_conv is_normed Conv.all_conv (norm_conv ctxt)
boehmes@36898
   256
end
boehmes@36898
   257
boehmes@36898
   258
fun norm_def ctxt thm =
boehmes@36898
   259
  (case Thm.prop_of thm of
haftmann@38864
   260
    @{term Trueprop} $ (Const (@{const_name HOL.eq}, _) $ _ $ Abs _) =>
boehmes@36898
   261
      norm_def ctxt (thm RS @{thm fun_cong})
boehmes@36898
   262
  | Const (@{const_name "=="}, _) $ _ $ Abs _ =>
boehmes@36898
   263
      norm_def ctxt (thm RS @{thm meta_eq_to_obj_eq})
boehmes@36898
   264
  | _ => thm)
boehmes@36898
   265
boehmes@36898
   266
fun atomize_conv ctxt ct =
boehmes@36898
   267
  (case Thm.term_of ct of
boehmes@36898
   268
    @{term "op ==>"} $ _ $ _ =>
boehmes@36898
   269
      Conv.binop_conv (atomize_conv ctxt) then_conv
boehmes@36898
   270
      Conv.rewr_conv @{thm atomize_imp}
boehmes@36898
   271
  | Const (@{const_name "=="}, _) $ _ $ _ =>
boehmes@36898
   272
      Conv.binop_conv (atomize_conv ctxt) then_conv
boehmes@36898
   273
      Conv.rewr_conv @{thm atomize_eq}
boehmes@36898
   274
  | Const (@{const_name all}, _) $ Abs _ =>
wenzelm@36936
   275
      Conv.binder_conv (atomize_conv o snd) ctxt then_conv
boehmes@36898
   276
      Conv.rewr_conv @{thm atomize_all}
boehmes@36898
   277
  | _ => Conv.all_conv) ct
boehmes@36898
   278
boehmes@36898
   279
fun normalize_rule ctxt =
boehmes@36898
   280
  Conv.fconv_rule (
boehmes@36898
   281
    (* reduce lambda abstractions, except at known binders: *)
boehmes@36898
   282
    Thm.beta_conversion true then_conv
boehmes@36898
   283
    Thm.eta_conversion then_conv
boehmes@36898
   284
    norm_binder_conv ctxt) #>
boehmes@36898
   285
  norm_def ctxt #>
boehmes@36898
   286
  Drule.forall_intr_vars #>
boehmes@36898
   287
  Conv.fconv_rule (atomize_conv ctxt)
boehmes@36898
   288
boehmes@36898
   289
boehmes@36898
   290
boehmes@36898
   291
(* lift lambda terms into additional rules *)
boehmes@36898
   292
boehmes@36898
   293
local
boehmes@36898
   294
  val meta_eq = @{cpat "op =="}
boehmes@36898
   295
  val meta_eqT = hd (Thm.dest_ctyp (Thm.ctyp_of_term meta_eq))
boehmes@36898
   296
  fun inst_meta cT = Thm.instantiate_cterm ([(meta_eqT, cT)], []) meta_eq
boehmes@36898
   297
  fun mk_meta_eq ct cu = Thm.mk_binop (inst_meta (Thm.ctyp_of_term ct)) ct cu
boehmes@36898
   298
boehmes@36898
   299
  fun cert ctxt = Thm.cterm_of (ProofContext.theory_of ctxt)
boehmes@36898
   300
boehmes@36898
   301
  fun used_vars cvs ct =
boehmes@36898
   302
    let
boehmes@36898
   303
      val lookup = AList.lookup (op aconv) (map (` Thm.term_of) cvs)
boehmes@36898
   304
      val add = (fn SOME ct => insert (op aconvc) ct | _ => I)
boehmes@36898
   305
    in Term.fold_aterms (add o lookup) (Thm.term_of ct) [] end
boehmes@36898
   306
boehmes@36898
   307
  fun apply cv thm = 
boehmes@36898
   308
    let val thm' = Thm.combination thm (Thm.reflexive cv)
boehmes@36898
   309
    in Thm.transitive thm' (Thm.beta_conversion false (Thm.rhs_of thm')) end
boehmes@36898
   310
  fun apply_def cvs eq = Thm.symmetric (fold apply cvs eq)
boehmes@36898
   311
boehmes@36898
   312
  fun replace_lambda cvs ct (cx as (ctxt, defs)) =
boehmes@36898
   313
    let
boehmes@36898
   314
      val cvs' = used_vars cvs ct
boehmes@36898
   315
      val ct' = fold_rev Thm.cabs cvs' ct
boehmes@36898
   316
    in
boehmes@36898
   317
      (case Termtab.lookup defs (Thm.term_of ct') of
boehmes@36898
   318
        SOME eq => (apply_def cvs' eq, cx)
boehmes@36898
   319
      | NONE =>
boehmes@36898
   320
          let
boehmes@36898
   321
            val {T, ...} = Thm.rep_cterm ct' and n = Name.uu
boehmes@36898
   322
            val (n', ctxt') = yield_singleton Variable.variant_fixes n ctxt
boehmes@36898
   323
            val cu = mk_meta_eq (cert ctxt (Free (n', T))) ct'
boehmes@36898
   324
            val (eq, ctxt'') = yield_singleton Assumption.add_assumes cu ctxt'
boehmes@36898
   325
            val defs' = Termtab.update (Thm.term_of ct', eq) defs
boehmes@36898
   326
          in (apply_def cvs' eq, (ctxt'', defs')) end)
boehmes@36898
   327
    end
boehmes@36898
   328
boehmes@36898
   329
  fun none ct cx = (Thm.reflexive ct, cx)
boehmes@36898
   330
  fun in_comb f g ct cx =
boehmes@36898
   331
    let val (cu1, cu2) = Thm.dest_comb ct
boehmes@36898
   332
    in cx |> f cu1 ||>> g cu2 |>> uncurry Thm.combination end
boehmes@36898
   333
  fun in_arg f = in_comb none f
boehmes@36898
   334
  fun in_abs f cvs ct (ctxt, defs) =
boehmes@36898
   335
    let
boehmes@36898
   336
      val (n, ctxt') = yield_singleton Variable.variant_fixes Name.uu ctxt
boehmes@36898
   337
      val (cv, cu) = Thm.dest_abs (SOME n) ct
boehmes@36898
   338
    in  (ctxt', defs) |> f (cv :: cvs) cu |>> Thm.abstract_rule n cv end
boehmes@36898
   339
boehmes@36898
   340
  fun traverse cvs ct =
boehmes@36898
   341
    (case Thm.term_of ct of
boehmes@36898
   342
      Const (@{const_name All}, _) $ Abs _ => in_arg (in_abs traverse cvs)
boehmes@36898
   343
    | Const (@{const_name Ex}, _) $ Abs _ => in_arg (in_abs traverse cvs)
boehmes@36898
   344
    | Const (@{const_name Let}, _) $ _ $ Abs _ =>
boehmes@36898
   345
        in_comb (in_arg (traverse cvs)) (in_abs traverse cvs)
boehmes@36898
   346
    | Abs _ => at_lambda cvs
boehmes@36898
   347
    | _ $ _ => in_comb (traverse cvs) (traverse cvs)
boehmes@36898
   348
    | _ => none) ct
boehmes@36898
   349
boehmes@36898
   350
  and at_lambda cvs ct =
boehmes@36898
   351
    in_abs traverse cvs ct #-> (fn thm =>
boehmes@36898
   352
    replace_lambda cvs (Thm.rhs_of thm) #>> Thm.transitive thm)
boehmes@36898
   353
boehmes@36898
   354
  fun has_free_lambdas t =
boehmes@36898
   355
    (case t of
boehmes@36898
   356
      Const (@{const_name All}, _) $ Abs (_, _, u) => has_free_lambdas u
boehmes@36898
   357
    | Const (@{const_name Ex}, _) $ Abs (_, _, u) => has_free_lambdas u
boehmes@36898
   358
    | Const (@{const_name Let}, _) $ u1 $ Abs (_, _, u2) =>
boehmes@36898
   359
        has_free_lambdas u1 orelse has_free_lambdas u2
boehmes@36898
   360
    | Abs _ => true
boehmes@36898
   361
    | u1 $ u2 => has_free_lambdas u1 orelse has_free_lambdas u2
boehmes@36898
   362
    | _ => false)
boehmes@36898
   363
boehmes@36898
   364
  fun lift_lm f thm cx =
boehmes@36898
   365
    if not (has_free_lambdas (Thm.prop_of thm)) then (thm, cx)
boehmes@36898
   366
    else cx |> f (Thm.cprop_of thm) |>> (fn thm' => Thm.equal_elim thm' thm)
boehmes@36898
   367
in
boehmes@40161
   368
fun lift_lambdas irules ctxt =
boehmes@36898
   369
  let
boehmes@36898
   370
    val cx = (ctxt, Termtab.empty)
boehmes@40161
   371
    val (idxs, thms) = split_list irules
boehmes@36898
   372
    val (thms', (ctxt', defs)) = fold_map (lift_lm (traverse [])) thms cx
boehmes@36898
   373
    val eqs = Termtab.fold (cons o normalize_rule ctxt' o snd) defs []
boehmes@40161
   374
  in (map (pair ~1) eqs @ (idxs ~~ thms'), ctxt') end
boehmes@36898
   375
end
boehmes@36898
   376
boehmes@36898
   377
boehmes@36898
   378
boehmes@36898
   379
(* make application explicit for functions with varying number of arguments *)
boehmes@36898
   380
boehmes@36898
   381
local
boehmes@36898
   382
  val const = prefix "c" and free = prefix "f"
boehmes@36898
   383
  fun min i (e as (_, j)) = if i <> j then (true, Int.min (i, j)) else e
boehmes@36898
   384
  fun add t i = Symtab.map_default (t, (false, i)) (min i)
boehmes@36898
   385
  fun traverse t =
boehmes@36898
   386
    (case Term.strip_comb t of
boehmes@36898
   387
      (Const (n, _), ts) => add (const n) (length ts) #> fold traverse ts 
boehmes@36898
   388
    | (Free (n, _), ts) => add (free n) (length ts) #> fold traverse ts
boehmes@36898
   389
    | (Abs (_, _, u), ts) => fold traverse (u :: ts)
boehmes@36898
   390
    | (_, ts) => fold traverse ts)
boehmes@40161
   391
  fun prune tab = Symtab.fold (fn (n, (true, i)) =>
boehmes@40161
   392
    Symtab.update (n, i) | _ => I) tab Symtab.empty
boehmes@36898
   393
boehmes@36898
   394
  fun binop_conv cv1 cv2 = Conv.combination_conv (Conv.arg_conv cv1) cv2
boehmes@36898
   395
  fun nary_conv conv1 conv2 ct =
boehmes@36898
   396
    (Conv.combination_conv (nary_conv conv1 conv2) conv2 else_conv conv1) ct
boehmes@36898
   397
  fun abs_conv conv tb = Conv.abs_conv (fn (cv, cx) =>
boehmes@36898
   398
    let val n = fst (Term.dest_Free (Thm.term_of cv))
boehmes@36898
   399
    in conv (Symtab.update (free n, 0) tb) cx end)
boehmes@37153
   400
  val fun_app_rule = @{lemma "f x == fun_app f x" by (simp add: fun_app_def)}
boehmes@36898
   401
in
boehmes@40161
   402
fun explicit_application ctxt irules =
boehmes@36898
   403
  let
boehmes@36898
   404
    fun sub_conv tb ctxt ct =
boehmes@36898
   405
      (case Term.strip_comb (Thm.term_of ct) of
boehmes@36898
   406
        (Const (n, _), ts) => app_conv tb (const n) (length ts) ctxt
boehmes@36898
   407
      | (Free (n, _), ts) => app_conv tb (free n) (length ts) ctxt
boehmes@36898
   408
      | (Abs _, _) => nary_conv (abs_conv sub_conv tb ctxt) (sub_conv tb ctxt)
boehmes@36898
   409
      | (_, _) => nary_conv Conv.all_conv (sub_conv tb ctxt)) ct
boehmes@36898
   410
    and app_conv tb n i ctxt =
boehmes@36898
   411
      (case Symtab.lookup tb n of
boehmes@36898
   412
        NONE => nary_conv Conv.all_conv (sub_conv tb ctxt)
boehmes@37153
   413
      | SOME j => fun_app_conv tb ctxt (i - j))
boehmes@37153
   414
    and fun_app_conv tb ctxt i ct = (
boehmes@36898
   415
      if i = 0 then nary_conv Conv.all_conv (sub_conv tb ctxt)
boehmes@36898
   416
      else
boehmes@37153
   417
        Conv.rewr_conv fun_app_rule then_conv
boehmes@37153
   418
        binop_conv (fun_app_conv tb ctxt (i-1)) (sub_conv tb ctxt)) ct
boehmes@36898
   419
boehmes@36898
   420
    fun needs_exp_app tab = Term.exists_subterm (fn
boehmes@36898
   421
        Bound _ $ _ => true
boehmes@36898
   422
      | Const (n, _) => Symtab.defined tab (const n)
boehmes@36898
   423
      | Free (n, _) => Symtab.defined tab (free n)
boehmes@36898
   424
      | _ => false)
boehmes@36898
   425
boehmes@36898
   426
    fun rewrite tab ctxt thm =
boehmes@36898
   427
      if not (needs_exp_app tab (Thm.prop_of thm)) then thm
boehmes@36898
   428
      else Conv.fconv_rule (sub_conv tab ctxt) thm
boehmes@36898
   429
boehmes@40161
   430
    val tab = prune (fold (traverse o Thm.prop_of o snd) irules Symtab.empty)
boehmes@40161
   431
  in map (apsnd (rewrite tab ctxt)) irules end
boehmes@36898
   432
end
boehmes@36898
   433
boehmes@36898
   434
boehmes@36898
   435
boehmes@39483
   436
(* add missing datatype selectors via hypothetical definitions *)
boehmes@39483
   437
boehmes@39483
   438
local
boehmes@39483
   439
  val add = (fn Type (n, _) => Symtab.update (n, ()) | _ => I)
boehmes@39483
   440
boehmes@39483
   441
  fun collect t =
boehmes@39483
   442
    (case Term.strip_comb t of
boehmes@39483
   443
      (Abs (_, T, t), _) => add T #> collect t
boehmes@39483
   444
    | (Const (_, T), ts) => collects T ts
boehmes@39483
   445
    | (Free (_, T), ts) => collects T ts
boehmes@39483
   446
    | _ => I)
boehmes@39483
   447
  and collects T ts =
boehmes@39483
   448
    let val ((Ts, Us), U) = Term.strip_type T |> apfst (chop (length ts))
boehmes@39483
   449
    in fold add Ts #> add (Us ---> U) #> fold collect ts end
boehmes@39483
   450
boehmes@39483
   451
  fun add_constructors thy n =
boehmes@39483
   452
    (case Datatype.get_info thy n of
boehmes@39483
   453
      NONE => I
boehmes@39483
   454
    | SOME {descr, ...} => fold (fn (_, (_, _, cs)) => fold (fn (n, ds) =>
boehmes@39483
   455
        fold (insert (op =) o pair n) (1 upto length ds)) cs) descr)
boehmes@39483
   456
boehmes@39483
   457
  fun add_selector (c as (n, i)) ctxt =
boehmes@39483
   458
    (case Datatype_Selectors.lookup_selector ctxt c of
boehmes@39483
   459
      SOME _ => ctxt
boehmes@39483
   460
    | NONE =>
boehmes@39483
   461
        let
boehmes@39483
   462
          val T = Sign.the_const_type (ProofContext.theory_of ctxt) n
boehmes@39483
   463
          val U = Term.body_type T --> nth (Term.binder_types T) (i-1)
boehmes@39483
   464
        in
boehmes@39483
   465
          ctxt
boehmes@39483
   466
          |> yield_singleton Variable.variant_fixes Name.uu
boehmes@39483
   467
          |>> pair ((n, T), i) o rpair U
boehmes@39483
   468
          |-> Context.proof_map o Datatype_Selectors.add_selector
boehmes@39483
   469
        end)
boehmes@39483
   470
in
boehmes@39483
   471
boehmes@40161
   472
fun datatype_selectors irules ctxt =
boehmes@39483
   473
  let
boehmes@40161
   474
    val ns = Symtab.keys (fold (collect o Thm.prop_of o snd) irules Symtab.empty)
boehmes@39483
   475
    val cs = fold (add_constructors (ProofContext.theory_of ctxt)) ns []
boehmes@40161
   476
  in (irules, fold add_selector cs ctxt) end
boehmes@39483
   477
    (* FIXME: also generate hypothetical definitions for the selectors *)
boehmes@39483
   478
boehmes@39483
   479
end
boehmes@39483
   480
boehmes@39483
   481
boehmes@39483
   482
boehmes@36898
   483
(* combined normalization *)
boehmes@36898
   484
boehmes@40162
   485
type extra_norm = bool -> (int * thm) list -> Proof.context ->
boehmes@40161
   486
  (int * thm) list * Proof.context
boehmes@36898
   487
boehmes@40161
   488
fun with_context f irules ctxt = (f ctxt irules, ctxt)
boehmes@36898
   489
boehmes@40278
   490
fun normalize trace keep_assms extra_norm with_datatypes irules ctxt =
boehmes@40278
   491
  let
boehmes@40278
   492
    fun norm f ctxt' (i, thm) =
boehmes@40278
   493
      if keep_assms then SOME (i, f ctxt' thm)
boehmes@40278
   494
      else
boehmes@40278
   495
        (case try (f ctxt') thm of
boehmes@40278
   496
          SOME thm' => SOME (i, thm')
boehmes@40278
   497
        | NONE => (trace ctxt' (prefix ("SMT warning: " ^
boehmes@40278
   498
            "dropping assumption: ") o Display.string_of_thm ctxt') thm; NONE))
boehmes@40278
   499
  in
boehmes@40278
   500
    irules
boehmes@40278
   501
    |> trivial_distinct ctxt
boehmes@40278
   502
    |> rewrite_bool_cases ctxt
boehmes@40278
   503
    |> normalize_numerals ctxt
boehmes@40278
   504
    |> nat_as_int ctxt
boehmes@40278
   505
    |> rpair ctxt
boehmes@40278
   506
    |-> extra_norm with_datatypes
boehmes@40278
   507
    |-> with_context (map_filter o norm normalize_rule)
boehmes@40278
   508
    |-> SMT_Monomorph.monomorph
boehmes@40278
   509
    |-> lift_lambdas
boehmes@40278
   510
    |-> with_context explicit_application
boehmes@40278
   511
    |-> (if with_datatypes then datatype_selectors else pair)
boehmes@40278
   512
  end
boehmes@36898
   513
boehmes@36898
   514
end