src/Pure/proofterm.ML
author wenzelm
Mon Nov 16 21:57:16 2009 +0100 (2009-11-16 ago)
changeset 33722 e588744f14da
parent 33522 737589bb9bb8
child 33955 fff6f11b1f09
permissions -rw-r--r--
generalized procs for rewrite_proof: allow skeleton;
fulfill_norm_proof: always normalize result here, no re-normalization after filling;
berghofe@11519
     1
(*  Title:      Pure/proofterm.ML
wenzelm@11540
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11519
     3
wenzelm@11540
     4
LF style proof terms.
berghofe@11519
     5
*)
berghofe@11519
     6
berghofe@11615
     7
infix 8 % %% %>;
berghofe@11519
     8
berghofe@11519
     9
signature BASIC_PROOFTERM =
berghofe@11519
    10
sig
wenzelm@32738
    11
  val proofs: int Unsynchronized.ref
berghofe@11519
    12
berghofe@11519
    13
  datatype proof =
wenzelm@28803
    14
     MinProof
wenzelm@28803
    15
   | PBound of int
berghofe@11519
    16
   | Abst of string * typ option * proof
berghofe@11519
    17
   | AbsP of string * term option * proof
wenzelm@28803
    18
   | op % of proof * term option
wenzelm@28803
    19
   | op %% of proof * proof
berghofe@11519
    20
   | Hyp of term
berghofe@11519
    21
   | PAxm of string * term * typ list option
wenzelm@31943
    22
   | OfClass of typ * class
berghofe@11519
    23
   | Oracle of string * term * typ list option
wenzelm@28828
    24
   | Promise of serial * term * typ list
wenzelm@29635
    25
   | PThm of serial * ((string * term * typ list option) * proof_body future)
wenzelm@28803
    26
  and proof_body = PBody of
wenzelm@28803
    27
    {oracles: (string * term) OrdList.T,
wenzelm@29635
    28
     thms: (serial * (string * term * proof_body future)) OrdList.T,
wenzelm@28803
    29
     proof: proof}
berghofe@11519
    30
berghofe@11615
    31
  val %> : proof * term -> proof
berghofe@11519
    32
end;
berghofe@11519
    33
berghofe@11519
    34
signature PROOFTERM =
berghofe@11519
    35
sig
berghofe@11519
    36
  include BASIC_PROOFTERM
berghofe@11519
    37
wenzelm@28815
    38
  type oracle = string * term
wenzelm@29635
    39
  type pthm = serial * (string * term * proof_body future)
wenzelm@32094
    40
  val proof_of: proof_body -> proof
wenzelm@29635
    41
  val join_proof: proof_body future -> proof
wenzelm@30711
    42
  val fold_proof_atoms: bool -> (proof -> 'a -> 'a) -> proof list -> 'a -> 'a
wenzelm@32810
    43
  val fold_body_thms: (string * term * proof_body -> 'a -> 'a) -> proof_body list -> 'a -> 'a
wenzelm@32054
    44
  val join_bodies: proof_body list -> unit
wenzelm@30712
    45
  val status_of: proof_body list -> {failed: bool, oracle: bool, unfinished: bool}
wenzelm@28803
    46
wenzelm@28803
    47
  val oracle_ord: oracle * oracle -> order
wenzelm@28803
    48
  val thm_ord: pthm * pthm -> order
wenzelm@28803
    49
  val merge_oracles: oracle OrdList.T -> oracle OrdList.T -> oracle OrdList.T
wenzelm@28803
    50
  val merge_thms: pthm OrdList.T -> pthm OrdList.T -> pthm OrdList.T
wenzelm@30716
    51
  val all_oracles_of: proof_body -> oracle OrdList.T
wenzelm@30716
    52
  val approximate_proof_body: proof -> proof_body
wenzelm@28803
    53
berghofe@11519
    54
  (** primitive operations **)
wenzelm@28803
    55
  val proof_combt: proof * term list -> proof
wenzelm@28803
    56
  val proof_combt': proof * term option list -> proof
wenzelm@28803
    57
  val proof_combP: proof * proof list -> proof
wenzelm@28803
    58
  val strip_combt: proof -> proof * term option list
wenzelm@28803
    59
  val strip_combP: proof -> proof * proof list
wenzelm@28803
    60
  val strip_thm: proof_body -> proof_body
wenzelm@28803
    61
  val map_proof_terms_option: (term -> term option) -> (typ -> typ option) -> proof -> proof
wenzelm@28803
    62
  val map_proof_terms: (term -> term) -> (typ -> typ) -> proof -> proof
wenzelm@28803
    63
  val fold_proof_terms: (term -> 'a -> 'a) -> (typ -> 'a -> 'a) -> proof -> 'a -> 'a
wenzelm@28803
    64
  val maxidx_proof: proof -> int -> int
wenzelm@28803
    65
  val size_of_proof: proof -> int
wenzelm@28803
    66
  val change_type: typ list option -> proof -> proof
wenzelm@28803
    67
  val prf_abstract_over: term -> proof -> proof
wenzelm@28803
    68
  val prf_incr_bv: int -> int -> int -> int -> proof -> proof
wenzelm@28803
    69
  val incr_pboundvars: int -> int -> proof -> proof
wenzelm@28803
    70
  val prf_loose_bvar1: proof -> int -> bool
wenzelm@28803
    71
  val prf_loose_Pbvar1: proof -> int -> bool
wenzelm@28803
    72
  val prf_add_loose_bnos: int -> int -> proof -> int list * int list -> int list * int list
wenzelm@28803
    73
  val norm_proof: Envir.env -> proof -> proof
wenzelm@28803
    74
  val norm_proof': Envir.env -> proof -> proof
wenzelm@28803
    75
  val prf_subst_bounds: term list -> proof -> proof
wenzelm@28803
    76
  val prf_subst_pbounds: proof list -> proof -> proof
wenzelm@28803
    77
  val freeze_thaw_prf: proof -> proof * (proof -> proof)
berghofe@11519
    78
berghofe@11519
    79
  (** proof terms for specific inference rules **)
wenzelm@28803
    80
  val implies_intr_proof: term -> proof -> proof
wenzelm@28803
    81
  val forall_intr_proof: term -> string -> proof -> proof
wenzelm@28803
    82
  val varify_proof: term -> (string * sort) list -> proof -> proof
wenzelm@28803
    83
  val freezeT: term -> proof -> proof
wenzelm@28803
    84
  val rotate_proof: term list -> term -> int -> proof -> proof
wenzelm@28803
    85
  val permute_prems_prf: term list -> int -> int -> proof -> proof
wenzelm@19908
    86
  val generalize: string list * string list -> int -> proof -> proof
wenzelm@28803
    87
  val instantiate: ((indexname * sort) * typ) list * ((indexname * typ) * term) list
wenzelm@16880
    88
    -> proof -> proof
wenzelm@28803
    89
  val lift_proof: term -> int -> term -> proof -> proof
wenzelm@32027
    90
  val incr_indexes: int -> proof -> proof
wenzelm@28803
    91
  val assumption_proof: term list -> term -> int -> proof -> proof
wenzelm@28803
    92
  val bicompose_proof: bool -> term list -> term list -> term list -> term option ->
berghofe@23296
    93
    int -> int -> proof -> proof -> proof
wenzelm@28803
    94
  val equality_axms: (string * term) list
wenzelm@28803
    95
  val reflexive_axm: proof
wenzelm@28803
    96
  val symmetric_axm: proof
wenzelm@28803
    97
  val transitive_axm: proof
wenzelm@28803
    98
  val equal_intr_axm: proof
wenzelm@28803
    99
  val equal_elim_axm: proof
wenzelm@28803
   100
  val abstract_rule_axm: proof
wenzelm@28803
   101
  val combination_axm: proof
wenzelm@28803
   102
  val reflexive: proof
wenzelm@28803
   103
  val symmetric: proof -> proof
wenzelm@28803
   104
  val transitive: term -> typ -> proof -> proof -> proof
wenzelm@28803
   105
  val abstract_rule: term -> string -> proof -> proof
wenzelm@28803
   106
  val combination: term -> term -> term -> term -> typ -> proof -> proof -> proof
wenzelm@28803
   107
  val equal_intr: term -> term -> proof -> proof -> proof
wenzelm@28803
   108
  val equal_elim: term -> term -> proof -> proof -> proof
wenzelm@28803
   109
  val axm_proof: string -> term -> proof
wenzelm@30716
   110
  val oracle_proof: string -> term -> oracle * proof
wenzelm@28828
   111
  val promise_proof: theory -> serial -> term -> proof
wenzelm@33722
   112
  val fulfill_norm_proof: theory -> (serial * proof_body) list -> proof_body -> proof_body
wenzelm@28803
   113
  val thm_proof: theory -> string -> term list -> term ->
wenzelm@30716
   114
    (serial * proof_body future) list -> proof_body -> pthm * proof
wenzelm@28803
   115
  val get_name: term list -> term -> proof -> string
berghofe@11519
   116
berghofe@11519
   117
  (** rewriting on proof terms **)
wenzelm@28803
   118
  val add_prf_rrule: proof * proof -> theory -> theory
wenzelm@33722
   119
  val add_prf_rproc: (typ list -> proof -> (proof * proof) option) -> theory -> theory
wenzelm@33722
   120
  val no_skel: proof
wenzelm@33722
   121
  val normal_skel: proof
wenzelm@28803
   122
  val rewrite_proof: theory -> (proof * proof) list *
wenzelm@33722
   123
    (typ list -> proof -> (proof * proof) option) list -> proof -> proof
wenzelm@28803
   124
  val rewrite_proof_notypes: (proof * proof) list *
wenzelm@33722
   125
    (typ list -> proof -> (proof * proof) option) list -> proof -> proof
wenzelm@28803
   126
  val rew_proof: theory -> proof -> proof
berghofe@11519
   127
end
berghofe@11519
   128
berghofe@11519
   129
structure Proofterm : PROOFTERM =
berghofe@11519
   130
struct
berghofe@11519
   131
wenzelm@28803
   132
(***** datatype proof *****)
wenzelm@28803
   133
berghofe@11519
   134
datatype proof =
wenzelm@28803
   135
   MinProof
wenzelm@28803
   136
 | PBound of int
berghofe@11519
   137
 | Abst of string * typ option * proof
berghofe@11519
   138
 | AbsP of string * term option * proof
wenzelm@12497
   139
 | op % of proof * term option
wenzelm@12497
   140
 | op %% of proof * proof
berghofe@11519
   141
 | Hyp of term
berghofe@11519
   142
 | PAxm of string * term * typ list option
wenzelm@31943
   143
 | OfClass of typ * class
berghofe@11519
   144
 | Oracle of string * term * typ list option
wenzelm@28828
   145
 | Promise of serial * term * typ list
wenzelm@29635
   146
 | PThm of serial * ((string * term * typ list option) * proof_body future)
wenzelm@28803
   147
and proof_body = PBody of
wenzelm@28803
   148
  {oracles: (string * term) OrdList.T,
wenzelm@29635
   149
   thms: (serial * (string * term * proof_body future)) OrdList.T,
wenzelm@28803
   150
   proof: proof};
berghofe@11519
   151
wenzelm@28815
   152
type oracle = string * term;
wenzelm@29635
   153
type pthm = serial * (string * term * proof_body future);
wenzelm@28815
   154
wenzelm@28803
   155
fun proof_of (PBody {proof, ...}) = proof;
wenzelm@32094
   156
val join_proof = Future.join #> proof_of;
berghofe@17017
   157
berghofe@17017
   158
wenzelm@28803
   159
(***** proof atoms *****)
wenzelm@28803
   160
wenzelm@28803
   161
fun fold_proof_atoms all f =
wenzelm@28803
   162
  let
wenzelm@28803
   163
    fun app (Abst (_, _, prf)) = app prf
wenzelm@28803
   164
      | app (AbsP (_, _, prf)) = app prf
wenzelm@28803
   165
      | app (prf % _) = app prf
wenzelm@28803
   166
      | app (prf1 %% prf2) = app prf1 #> app prf2
wenzelm@28803
   167
      | app (prf as PThm (i, (_, body))) = (fn (x, seen) =>
wenzelm@28803
   168
          if Inttab.defined seen i then (x, seen)
wenzelm@28803
   169
          else
wenzelm@28815
   170
            let val (x', seen') =
wenzelm@29635
   171
              (if all then app (join_proof body) else I) (x, Inttab.update (i, ()) seen)
wenzelm@28815
   172
            in (f prf x', seen') end)
wenzelm@28803
   173
      | app prf = (fn (x, seen) => (f prf x, seen));
wenzelm@28803
   174
  in fn prfs => fn x => #1 (fold app prfs (x, Inttab.empty)) end;
berghofe@19357
   175
wenzelm@30711
   176
fun fold_body_thms f =
wenzelm@30711
   177
  let
wenzelm@32726
   178
    fun app (PBody {thms, ...}) =
wenzelm@32094
   179
     (Future.join_results (map (#3 o #2) thms);
wenzelm@32094
   180
      thms |> fold (fn (i, (name, prop, body)) => fn (x, seen) =>
wenzelm@32726
   181
        if Inttab.defined seen i then (x, seen)
wenzelm@32094
   182
        else
wenzelm@32094
   183
          let
wenzelm@32094
   184
            val body' = Future.join body;
wenzelm@32726
   185
            val (x', seen') = app body' (x, Inttab.update (i, ()) seen);
wenzelm@32810
   186
          in (f (name, prop, body') x', seen') end));
wenzelm@32726
   187
  in fn bodies => fn x => #1 (fold app bodies (x, Inttab.empty)) end;
wenzelm@30711
   188
wenzelm@32054
   189
fun join_bodies bodies = fold_body_thms (fn _ => fn () => ()) bodies ();
wenzelm@32054
   190
wenzelm@30712
   191
fun status_of bodies =
wenzelm@30711
   192
  let
wenzelm@30711
   193
    fun status (PBody {oracles, thms, ...}) x =
wenzelm@30711
   194
      let
wenzelm@30711
   195
        val ((oracle, unfinished, failed), seen) =
wenzelm@30711
   196
          (thms, x) |-> fold (fn (i, (_, _, body)) => fn (st, seen) =>
wenzelm@30711
   197
            if Inttab.defined seen i then (st, seen)
wenzelm@30711
   198
            else
wenzelm@30711
   199
              let val seen' = Inttab.update (i, ()) seen in
wenzelm@30711
   200
                (case Future.peek body of
wenzelm@30711
   201
                  SOME (Exn.Result body') => status body' (st, seen')
wenzelm@30711
   202
                | SOME (Exn.Exn _) =>
wenzelm@30711
   203
                    let val (oracle, unfinished, _) = st
wenzelm@30711
   204
                    in ((oracle, unfinished, true), seen') end
wenzelm@30711
   205
                | NONE =>
wenzelm@30711
   206
                    let val (oracle, _, failed) = st
wenzelm@30711
   207
                    in ((oracle, true, failed), seen') end)
wenzelm@30711
   208
              end);
wenzelm@30711
   209
      in ((oracle orelse not (null oracles), unfinished, failed), seen) end;
wenzelm@32057
   210
    val (oracle, unfinished, failed) =
wenzelm@32057
   211
      #1 (fold status bodies ((false, false, false), Inttab.empty));
wenzelm@30711
   212
  in {oracle = oracle, unfinished = unfinished, failed = failed} end;
wenzelm@30711
   213
wenzelm@28803
   214
wenzelm@28815
   215
(* proof body *)
wenzelm@28803
   216
wenzelm@29269
   217
val oracle_ord = prod_ord fast_string_ord TermOrd.fast_term_ord;
wenzelm@28803
   218
fun thm_ord ((i, _): pthm, (j, _)) = int_ord (j, i);
wenzelm@28803
   219
wenzelm@30716
   220
val merge_oracles = OrdList.union oracle_ord;
wenzelm@30716
   221
val merge_thms = OrdList.union thm_ord;
wenzelm@30716
   222
wenzelm@30716
   223
val all_oracles_of =
wenzelm@30716
   224
  let
wenzelm@32057
   225
    fun collect (PBody {oracles, thms, ...}) =
wenzelm@32094
   226
     (Future.join_results (map (#3 o #2) thms);
wenzelm@32057
   227
      thms |> fold (fn (i, (_, _, body)) => fn (x, seen) =>
wenzelm@32057
   228
        if Inttab.defined seen i then (x, seen)
wenzelm@32057
   229
        else
wenzelm@32057
   230
          let
wenzelm@32057
   231
            val body' = Future.join body;
wenzelm@32057
   232
            val (x', seen') = collect body' (x, Inttab.update (i, ()) seen);
wenzelm@32094
   233
          in (merge_oracles oracles x', seen') end));
wenzelm@30716
   234
  in fn body => #1 (collect body ([], Inttab.empty)) end;
wenzelm@30716
   235
wenzelm@30716
   236
fun approximate_proof_body prf =
wenzelm@28803
   237
  let
wenzelm@28803
   238
    val (oracles, thms) = fold_proof_atoms false
wenzelm@28803
   239
      (fn Oracle (s, prop, _) => apfst (cons (s, prop))
wenzelm@28815
   240
        | PThm (i, ((name, prop, _), body)) => apsnd (cons (i, (name, prop, body)))
wenzelm@28803
   241
        | _ => I) [prf] ([], []);
wenzelm@30716
   242
  in
wenzelm@30716
   243
    PBody
wenzelm@30716
   244
     {oracles = OrdList.make oracle_ord oracles,
wenzelm@30716
   245
      thms = OrdList.make thm_ord thms,
wenzelm@30716
   246
      proof = prf}
wenzelm@30716
   247
  end;
berghofe@11519
   248
wenzelm@28803
   249
wenzelm@28803
   250
(***** proof objects with different levels of detail *****)
berghofe@11519
   251
skalberg@15531
   252
fun (prf %> t) = prf % SOME t;
berghofe@11519
   253
skalberg@15570
   254
val proof_combt = Library.foldl (op %>);
skalberg@15570
   255
val proof_combt' = Library.foldl (op %);
skalberg@15570
   256
val proof_combP = Library.foldl (op %%);
berghofe@11519
   257
wenzelm@21646
   258
fun strip_combt prf =
berghofe@11615
   259
    let fun stripc (prf % t, ts) = stripc (prf, t::ts)
wenzelm@21646
   260
          | stripc  x =  x
berghofe@11519
   261
    in  stripc (prf, [])  end;
berghofe@11519
   262
wenzelm@21646
   263
fun strip_combP prf =
berghofe@11615
   264
    let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs)
berghofe@11519
   265
          | stripc  x =  x
berghofe@11519
   266
    in  stripc (prf, [])  end;
berghofe@11519
   267
wenzelm@28803
   268
fun strip_thm (body as PBody {proof, ...}) =
wenzelm@28803
   269
  (case strip_combt (fst (strip_combP proof)) of
wenzelm@29635
   270
    (PThm (_, (_, body')), _) => Future.join body'
wenzelm@28803
   271
  | _ => body);
berghofe@11519
   272
wenzelm@23178
   273
val mk_Abst = fold_rev (fn (s, T:typ) => fn prf => Abst (s, NONE, prf));
skalberg@15531
   274
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf;
berghofe@11519
   275
wenzelm@20000
   276
fun map_proof_terms_option f g =
wenzelm@20000
   277
  let
wenzelm@32024
   278
    val term = Same.function f;
wenzelm@32024
   279
    val typ = Same.function g;
wenzelm@32024
   280
    val typs = Same.map typ;
wenzelm@20000
   281
wenzelm@32024
   282
    fun proof (Abst (s, T, prf)) =
wenzelm@32024
   283
          (Abst (s, Same.map_option typ T, Same.commit proof prf)
wenzelm@32024
   284
            handle Same.SAME => Abst (s, T, proof prf))
wenzelm@32024
   285
      | proof (AbsP (s, t, prf)) =
wenzelm@32024
   286
          (AbsP (s, Same.map_option term t, Same.commit proof prf)
wenzelm@32024
   287
            handle Same.SAME => AbsP (s, t, proof prf))
wenzelm@32024
   288
      | proof (prf % t) =
wenzelm@32024
   289
          (proof prf % Same.commit (Same.map_option term) t
wenzelm@32024
   290
            handle Same.SAME => prf % Same.map_option term t)
wenzelm@32024
   291
      | proof (prf1 %% prf2) =
wenzelm@32024
   292
          (proof prf1 %% Same.commit proof prf2
wenzelm@32024
   293
            handle Same.SAME => prf1 %% proof prf2)
wenzelm@32024
   294
      | proof (PAxm (a, prop, SOME Ts)) = PAxm (a, prop, SOME (typs Ts))
wenzelm@32024
   295
      | proof (OfClass (T, c)) = OfClass (typ T, c)
wenzelm@32024
   296
      | proof (Oracle (a, prop, SOME Ts)) = Oracle (a, prop, SOME (typs Ts))
wenzelm@32024
   297
      | proof (Promise (i, prop, Ts)) = Promise (i, prop, typs Ts)
wenzelm@32057
   298
      | proof (PThm (i, ((a, prop, SOME Ts), body))) =
wenzelm@32057
   299
          PThm (i, ((a, prop, SOME (typs Ts)), body))
wenzelm@32024
   300
      | proof _ = raise Same.SAME;
wenzelm@32024
   301
  in Same.commit proof end;
wenzelm@20000
   302
haftmann@22662
   303
fun same eq f x =
berghofe@11715
   304
  let val x' = f x
wenzelm@32019
   305
  in if eq (x, x') then raise Same.SAME else x' end;
berghofe@11715
   306
berghofe@11715
   307
fun map_proof_terms f g =
wenzelm@20000
   308
  map_proof_terms_option
wenzelm@32019
   309
   (fn t => SOME (same (op =) f t) handle Same.SAME => NONE)
wenzelm@32019
   310
   (fn T => SOME (same (op =) g T) handle Same.SAME => NONE);
berghofe@11519
   311
wenzelm@20147
   312
fun fold_proof_terms f g (Abst (_, SOME T, prf)) = g T #> fold_proof_terms f g prf
wenzelm@20147
   313
  | fold_proof_terms f g (Abst (_, NONE, prf)) = fold_proof_terms f g prf
wenzelm@20147
   314
  | fold_proof_terms f g (AbsP (_, SOME t, prf)) = f t #> fold_proof_terms f g prf
wenzelm@20147
   315
  | fold_proof_terms f g (AbsP (_, NONE, prf)) = fold_proof_terms f g prf
wenzelm@20147
   316
  | fold_proof_terms f g (prf % SOME t) = fold_proof_terms f g prf #> f t
wenzelm@20147
   317
  | fold_proof_terms f g (prf % NONE) = fold_proof_terms f g prf
wenzelm@20147
   318
  | fold_proof_terms f g (prf1 %% prf2) =
wenzelm@20147
   319
      fold_proof_terms f g prf1 #> fold_proof_terms f g prf2
wenzelm@20159
   320
  | fold_proof_terms _ g (PAxm (_, _, SOME Ts)) = fold g Ts
wenzelm@31943
   321
  | fold_proof_terms _ g (OfClass (T, _)) = g T
wenzelm@28828
   322
  | fold_proof_terms _ g (Oracle (_, _, SOME Ts)) = fold g Ts
wenzelm@28828
   323
  | fold_proof_terms _ g (Promise (_, _, Ts)) = fold g Ts
wenzelm@28803
   324
  | fold_proof_terms _ g (PThm (_, ((_, _, SOME Ts), _))) = fold g Ts
wenzelm@20147
   325
  | fold_proof_terms _ _ _ = I;
berghofe@11519
   326
wenzelm@20300
   327
fun maxidx_proof prf = fold_proof_terms Term.maxidx_term Term.maxidx_typ prf;
berghofe@12868
   328
berghofe@13744
   329
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf
berghofe@13749
   330
  | size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf
wenzelm@28803
   331
  | size_of_proof (prf % _) = 1 + size_of_proof prf
berghofe@13744
   332
  | size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2
berghofe@13744
   333
  | size_of_proof _ = 1;
berghofe@13744
   334
wenzelm@28803
   335
fun change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs)
wenzelm@31943
   336
  | change_type (SOME [T]) (OfClass (_, c)) = OfClass (T, c)
berghofe@12907
   337
  | change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs)
wenzelm@28828
   338
  | change_type opTs (Promise _) = error "change_type: unexpected promise"
wenzelm@32057
   339
  | change_type opTs (PThm (i, ((name, prop, _), body))) =
wenzelm@32057
   340
      PThm (i, ((name, prop, opTs), body))
berghofe@12907
   341
  | change_type _ prf = prf;
berghofe@12907
   342
berghofe@11519
   343
berghofe@11519
   344
(***** utilities *****)
berghofe@11519
   345
berghofe@11519
   346
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t
berghofe@11519
   347
  | strip_abs _ t = t;
berghofe@11519
   348
skalberg@15570
   349
fun mk_abs Ts t = Library.foldl (fn (t', T) => Abs ("", T, t')) (t, Ts);
berghofe@11519
   350
berghofe@11519
   351
wenzelm@21646
   352
(*Abstraction of a proof term over its occurrences of v,
berghofe@11519
   353
    which must contain no loose bound variables.
berghofe@11519
   354
  The resulting proof term is ready to become the body of an Abst.*)
berghofe@11519
   355
berghofe@11519
   356
fun prf_abstract_over v =
berghofe@11519
   357
  let
berghofe@11715
   358
    fun abst' lev u = if v aconv u then Bound lev else
berghofe@11715
   359
      (case u of
berghofe@11715
   360
         Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t)
wenzelm@32019
   361
       | f $ t => (abst' lev f $ absth' lev t handle Same.SAME => f $ abst' lev t)
wenzelm@32019
   362
       | _ => raise Same.SAME)
wenzelm@32019
   363
    and absth' lev t = (abst' lev t handle Same.SAME => t);
berghofe@11519
   364
berghofe@11715
   365
    fun abst lev (AbsP (a, t, prf)) =
wenzelm@32024
   366
          (AbsP (a, Same.map_option (abst' lev) t, absth lev prf)
wenzelm@32019
   367
           handle Same.SAME => AbsP (a, t, abst lev prf))
berghofe@11715
   368
      | abst lev (Abst (a, T, prf)) = Abst (a, T, abst (lev + 1) prf)
berghofe@11715
   369
      | abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2
wenzelm@32019
   370
          handle Same.SAME => prf1 %% abst lev prf2)
skalberg@15570
   371
      | abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t
wenzelm@32024
   372
          handle Same.SAME => prf % Same.map_option (abst' lev) t)
wenzelm@32019
   373
      | abst _ _ = raise Same.SAME
wenzelm@32024
   374
    and absth lev prf = (abst lev prf handle Same.SAME => prf);
berghofe@11519
   375
berghofe@11715
   376
  in absth 0 end;
berghofe@11519
   377
berghofe@11519
   378
berghofe@11519
   379
(*increments a proof term's non-local bound variables
berghofe@11519
   380
  required when moving a proof term within abstractions
berghofe@11519
   381
     inc is  increment for bound variables
berghofe@11519
   382
     lev is  level at which a bound variable is considered 'loose'*)
berghofe@11519
   383
berghofe@11519
   384
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t);
berghofe@11519
   385
berghofe@11715
   386
fun prf_incr_bv' incP inct Plev tlev (PBound i) =
wenzelm@32019
   387
      if i >= Plev then PBound (i+incP) else raise Same.SAME
berghofe@11715
   388
  | prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) =
wenzelm@32024
   389
      (AbsP (a, Same.map_option (same (op =) (incr_bv' inct tlev)) t,
wenzelm@32019
   390
         prf_incr_bv incP inct (Plev+1) tlev body) handle Same.SAME =>
berghofe@11715
   391
           AbsP (a, t, prf_incr_bv' incP inct (Plev+1) tlev body))
berghofe@11715
   392
  | prf_incr_bv' incP inct Plev tlev (Abst (a, T, body)) =
berghofe@11715
   393
      Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body)
wenzelm@21646
   394
  | prf_incr_bv' incP inct Plev tlev (prf %% prf') =
berghofe@11715
   395
      (prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf'
wenzelm@32019
   396
       handle Same.SAME => prf %% prf_incr_bv' incP inct Plev tlev prf')
wenzelm@21646
   397
  | prf_incr_bv' incP inct Plev tlev (prf % t) =
skalberg@15570
   398
      (prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t
wenzelm@32024
   399
       handle Same.SAME => prf % Same.map_option (same (op =) (incr_bv' inct tlev)) t)
wenzelm@32019
   400
  | prf_incr_bv' _ _ _ _ _ = raise Same.SAME
berghofe@11715
   401
and prf_incr_bv incP inct Plev tlev prf =
wenzelm@32019
   402
      (prf_incr_bv' incP inct Plev tlev prf handle Same.SAME => prf);
berghofe@11519
   403
berghofe@11519
   404
fun incr_pboundvars  0 0 prf = prf
berghofe@11519
   405
  | incr_pboundvars incP inct prf = prf_incr_bv incP inct 0 0 prf;
berghofe@11519
   406
berghofe@11519
   407
berghofe@11615
   408
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k
skalberg@15531
   409
  | prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k)
skalberg@15531
   410
  | prf_loose_bvar1 (_ % NONE) _ = true
skalberg@15531
   411
  | prf_loose_bvar1 (AbsP (_, SOME t, prf)) k = loose_bvar1 (t, k) orelse prf_loose_bvar1 prf k
skalberg@15531
   412
  | prf_loose_bvar1 (AbsP (_, NONE, _)) k = true
berghofe@11519
   413
  | prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1)
berghofe@11519
   414
  | prf_loose_bvar1 _ _ = false;
berghofe@11519
   415
berghofe@11519
   416
fun prf_loose_Pbvar1 (PBound i) k = i = k
berghofe@11615
   417
  | prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k
berghofe@11615
   418
  | prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k
berghofe@11519
   419
  | prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1)
berghofe@11519
   420
  | prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k
berghofe@11519
   421
  | prf_loose_Pbvar1 _ _ = false;
berghofe@11519
   422
berghofe@12279
   423
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) =
wenzelm@17492
   424
      if i < plev then (is, js) else (insert (op =) (i-plev) is, js)
berghofe@12279
   425
  | prf_add_loose_bnos plev tlev (prf1 %% prf2) p =
berghofe@12279
   426
      prf_add_loose_bnos plev tlev prf2
berghofe@12279
   427
        (prf_add_loose_bnos plev tlev prf1 p)
berghofe@12279
   428
  | prf_add_loose_bnos plev tlev (prf % opt) (is, js) =
berghofe@12279
   429
      prf_add_loose_bnos plev tlev prf (case opt of
wenzelm@17492
   430
          NONE => (is, insert (op =) ~1 js)
skalberg@15531
   431
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
berghofe@12279
   432
  | prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) =
berghofe@12279
   433
      prf_add_loose_bnos (plev+1) tlev prf (case opt of
wenzelm@17492
   434
          NONE => (is, insert (op =) ~1 js)
skalberg@15531
   435
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
berghofe@12279
   436
  | prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p =
berghofe@12279
   437
      prf_add_loose_bnos plev (tlev+1) prf p
berghofe@12279
   438
  | prf_add_loose_bnos _ _ _ _ = ([], []);
berghofe@12279
   439
berghofe@11519
   440
berghofe@11519
   441
(**** substitutions ****)
berghofe@11519
   442
wenzelm@31977
   443
fun del_conflicting_tvars envT T = Term_Subst.instantiateT
wenzelm@19482
   444
  (map_filter (fn ixnS as (_, S) =>
haftmann@26328
   445
     (Type.lookup envT ixnS; NONE) handle TYPE _ =>
wenzelm@29270
   446
        SOME (ixnS, TFree ("'dummy", S))) (OldTerm.typ_tvars T)) T;
berghofe@18316
   447
wenzelm@31977
   448
fun del_conflicting_vars env t = Term_Subst.instantiate
wenzelm@19482
   449
  (map_filter (fn ixnS as (_, S) =>
wenzelm@32019
   450
     (Type.lookup (Envir.type_env env) ixnS; NONE) handle TYPE _ =>
wenzelm@29270
   451
        SOME (ixnS, TFree ("'dummy", S))) (OldTerm.term_tvars t),
wenzelm@19482
   452
   map_filter (fn Var (ixnT as (_, T)) =>
berghofe@18316
   453
     (Envir.lookup (env, ixnT); NONE) handle TYPE _ =>
wenzelm@29265
   454
        SOME (ixnT, Free ("dummy", T))) (OldTerm.term_vars t)) t;
berghofe@18316
   455
berghofe@11519
   456
fun norm_proof env =
berghofe@11519
   457
  let
wenzelm@32019
   458
    val envT = Envir.type_env env;
berghofe@18316
   459
    fun msg s = warning ("type conflict in norm_proof:\n" ^ s);
berghofe@18316
   460
    fun htype f t = f env t handle TYPE (s, _, _) =>
berghofe@18316
   461
      (msg s; f env (del_conflicting_vars env t));
berghofe@18316
   462
    fun htypeT f T = f envT T handle TYPE (s, _, _) =>
berghofe@18316
   463
      (msg s; f envT (del_conflicting_tvars envT T));
berghofe@18316
   464
    fun htypeTs f Ts = f envT Ts handle TYPE (s, _, _) =>
berghofe@18316
   465
      (msg s; f envT (map (del_conflicting_tvars envT) Ts));
wenzelm@32024
   466
wenzelm@32019
   467
    fun norm (Abst (s, T, prf)) =
wenzelm@32024
   468
          (Abst (s, Same.map_option (htypeT Envir.norm_type_same) T, Same.commit norm prf)
wenzelm@32019
   469
            handle Same.SAME => Abst (s, T, norm prf))
wenzelm@32019
   470
      | norm (AbsP (s, t, prf)) =
wenzelm@32024
   471
          (AbsP (s, Same.map_option (htype Envir.norm_term_same) t, Same.commit norm prf)
wenzelm@32019
   472
            handle Same.SAME => AbsP (s, t, norm prf))
wenzelm@32019
   473
      | norm (prf % t) =
wenzelm@32019
   474
          (norm prf % Option.map (htype Envir.norm_term) t
wenzelm@32024
   475
            handle Same.SAME => prf % Same.map_option (htype Envir.norm_term_same) t)
wenzelm@32019
   476
      | norm (prf1 %% prf2) =
wenzelm@32019
   477
          (norm prf1 %% Same.commit norm prf2
wenzelm@32019
   478
            handle Same.SAME => prf1 %% norm prf2)
wenzelm@32019
   479
      | norm (PAxm (s, prop, Ts)) =
wenzelm@32024
   480
          PAxm (s, prop, Same.map_option (htypeTs Envir.norm_types_same) Ts)
wenzelm@32019
   481
      | norm (OfClass (T, c)) =
wenzelm@32019
   482
          OfClass (htypeT Envir.norm_type_same T, c)
wenzelm@32019
   483
      | norm (Oracle (s, prop, Ts)) =
wenzelm@32024
   484
          Oracle (s, prop, Same.map_option (htypeTs Envir.norm_types_same) Ts)
wenzelm@32019
   485
      | norm (Promise (i, prop, Ts)) =
wenzelm@32019
   486
          Promise (i, prop, htypeTs Envir.norm_types_same Ts)
wenzelm@28803
   487
      | norm (PThm (i, ((s, t, Ts), body))) =
wenzelm@32024
   488
          PThm (i, ((s, t, Same.map_option (htypeTs Envir.norm_types_same) Ts), body))
wenzelm@32019
   489
      | norm _ = raise Same.SAME;
wenzelm@32019
   490
  in Same.commit norm end;
berghofe@11519
   491
wenzelm@28803
   492
berghofe@11519
   493
(***** Remove some types in proof term (to save space) *****)
berghofe@11519
   494
berghofe@11519
   495
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t)
berghofe@11519
   496
  | remove_types (t $ u) = remove_types t $ remove_types u
berghofe@11519
   497
  | remove_types (Const (s, _)) = Const (s, dummyT)
berghofe@11519
   498
  | remove_types t = t;
berghofe@11519
   499
wenzelm@32032
   500
fun remove_types_env (Envir.Envir {maxidx, tenv, tyenv}) =
wenzelm@32032
   501
  Envir.Envir {maxidx = maxidx, tenv = Vartab.map (apsnd remove_types) tenv, tyenv = tyenv};
berghofe@11519
   502
berghofe@11519
   503
fun norm_proof' env prf = norm_proof (remove_types_env env) prf;
berghofe@11519
   504
wenzelm@28803
   505
berghofe@11519
   506
(**** substitution of bound variables ****)
berghofe@11519
   507
berghofe@11519
   508
fun prf_subst_bounds args prf =
berghofe@11519
   509
  let
berghofe@11519
   510
    val n = length args;
berghofe@11519
   511
    fun subst' lev (Bound i) =
wenzelm@32019
   512
         (if i<lev then raise Same.SAME    (*var is locally bound*)
wenzelm@30146
   513
          else  incr_boundvars lev (nth args (i-lev))
wenzelm@30146
   514
                  handle Subscript => Bound (i-n))  (*loose: change it*)
berghofe@11519
   515
      | subst' lev (Abs (a, T, body)) = Abs (a, T,  subst' (lev+1) body)
berghofe@11519
   516
      | subst' lev (f $ t) = (subst' lev f $ substh' lev t
wenzelm@32019
   517
          handle Same.SAME => f $ subst' lev t)
wenzelm@32019
   518
      | subst' _ _ = raise Same.SAME
wenzelm@32019
   519
    and substh' lev t = (subst' lev t handle Same.SAME => t);
berghofe@11519
   520
wenzelm@32057
   521
    fun subst lev (AbsP (a, t, body)) =
wenzelm@32057
   522
        (AbsP (a, Same.map_option (subst' lev) t, substh lev body)
wenzelm@32019
   523
          handle Same.SAME => AbsP (a, t, subst lev body))
berghofe@11519
   524
      | subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body)
berghofe@11615
   525
      | subst lev (prf %% prf') = (subst lev prf %% substh lev prf'
wenzelm@32019
   526
          handle Same.SAME => prf %% subst lev prf')
skalberg@15570
   527
      | subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t
wenzelm@32024
   528
          handle Same.SAME => prf % Same.map_option (subst' lev) t)
wenzelm@32019
   529
      | subst _ _ = raise Same.SAME
wenzelm@32024
   530
    and substh lev prf = (subst lev prf handle Same.SAME => prf);
berghofe@11519
   531
  in case args of [] => prf | _ => substh 0 prf end;
berghofe@11519
   532
berghofe@11519
   533
fun prf_subst_pbounds args prf =
berghofe@11519
   534
  let
berghofe@11519
   535
    val n = length args;
berghofe@11519
   536
    fun subst (PBound i) Plev tlev =
wenzelm@32019
   537
         (if i < Plev then raise Same.SAME    (*var is locally bound*)
wenzelm@30146
   538
          else incr_pboundvars Plev tlev (nth args (i-Plev))
berghofe@11519
   539
                 handle Subscript => PBound (i-n)  (*loose: change it*))
berghofe@11519
   540
      | subst (AbsP (a, t, body)) Plev tlev = AbsP (a, t, subst body (Plev+1) tlev)
berghofe@11519
   541
      | subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1))
berghofe@11615
   542
      | subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev
wenzelm@32019
   543
          handle Same.SAME => prf %% subst prf' Plev tlev)
berghofe@11615
   544
      | subst (prf % t) Plev tlev = subst prf Plev tlev % t
wenzelm@32019
   545
      | subst  prf _ _ = raise Same.SAME
wenzelm@32019
   546
    and substh prf Plev tlev = (subst prf Plev tlev handle Same.SAME => prf)
berghofe@11519
   547
  in case args of [] => prf | _ => substh prf 0 0 end;
berghofe@11519
   548
berghofe@11519
   549
berghofe@11519
   550
(**** Freezing and thawing of variables in proof terms ****)
berghofe@11519
   551
berghofe@11519
   552
fun frzT names =
haftmann@17325
   553
  map_type_tvar (fn (ixn, xs) => TFree ((the o AList.lookup (op =) names) ixn, xs));
berghofe@11519
   554
berghofe@11519
   555
fun thawT names =
haftmann@17325
   556
  map_type_tfree (fn (s, xs) => case AList.lookup (op =) names s of
skalberg@15531
   557
      NONE => TFree (s, xs)
skalberg@15531
   558
    | SOME ixn => TVar (ixn, xs));
berghofe@11519
   559
berghofe@11519
   560
fun freeze names names' (t $ u) =
berghofe@11519
   561
      freeze names names' t $ freeze names names' u
berghofe@11519
   562
  | freeze names names' (Abs (s, T, t)) =
berghofe@11519
   563
      Abs (s, frzT names' T, freeze names names' t)
berghofe@11519
   564
  | freeze names names' (Const (s, T)) = Const (s, frzT names' T)
berghofe@11519
   565
  | freeze names names' (Free (s, T)) = Free (s, frzT names' T)
berghofe@11519
   566
  | freeze names names' (Var (ixn, T)) =
haftmann@17325
   567
      Free ((the o AList.lookup (op =) names) ixn, frzT names' T)
berghofe@11519
   568
  | freeze names names' t = t;
berghofe@11519
   569
berghofe@11519
   570
fun thaw names names' (t $ u) =
berghofe@11519
   571
      thaw names names' t $ thaw names names' u
berghofe@11519
   572
  | thaw names names' (Abs (s, T, t)) =
berghofe@11519
   573
      Abs (s, thawT names' T, thaw names names' t)
berghofe@11519
   574
  | thaw names names' (Const (s, T)) = Const (s, thawT names' T)
wenzelm@21646
   575
  | thaw names names' (Free (s, T)) =
berghofe@11519
   576
      let val T' = thawT names' T
haftmann@17325
   577
      in case AList.lookup (op =) names s of
skalberg@15531
   578
          NONE => Free (s, T')
skalberg@15531
   579
        | SOME ixn => Var (ixn, T')
berghofe@11519
   580
      end
berghofe@11519
   581
  | thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T)
berghofe@11519
   582
  | thaw names names' t = t;
berghofe@11519
   583
berghofe@11519
   584
fun freeze_thaw_prf prf =
berghofe@11519
   585
  let
berghofe@11519
   586
    val (fs, Tfs, vs, Tvs) = fold_proof_terms
wenzelm@20147
   587
      (fn t => fn (fs, Tfs, vs, Tvs) =>
wenzelm@29261
   588
         (Term.add_free_names t fs, Term.add_tfree_names t Tfs,
wenzelm@29261
   589
          Term.add_var_names t vs, Term.add_tvar_names t Tvs))
wenzelm@20147
   590
      (fn T => fn (fs, Tfs, vs, Tvs) =>
wenzelm@29261
   591
         (fs, Term.add_tfree_namesT T Tfs,
wenzelm@29261
   592
          vs, Term.add_tvar_namesT T Tvs))
wenzelm@20147
   593
      prf ([], [], [], []);
wenzelm@29261
   594
    val names = vs ~~ Name.variant_list fs (map fst vs);
wenzelm@20071
   595
    val names' = Tvs ~~ Name.variant_list Tfs (map fst Tvs);
berghofe@11519
   596
    val rnames = map swap names;
berghofe@11519
   597
    val rnames' = map swap names';
berghofe@11519
   598
  in
berghofe@11519
   599
    (map_proof_terms (freeze names names') (frzT names') prf,
berghofe@11519
   600
     map_proof_terms (thaw rnames rnames') (thawT rnames'))
berghofe@11519
   601
  end;
berghofe@11519
   602
berghofe@11519
   603
berghofe@11519
   604
(***** implication introduction *****)
berghofe@11519
   605
berghofe@11519
   606
fun implies_intr_proof h prf =
berghofe@11519
   607
  let
wenzelm@32019
   608
    fun abshyp i (Hyp t) = if h aconv t then PBound i else raise Same.SAME
berghofe@11519
   609
      | abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf)
wenzelm@32024
   610
      | abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i + 1) prf)
berghofe@11615
   611
      | abshyp i (prf % t) = abshyp i prf % t
wenzelm@32024
   612
      | abshyp i (prf1 %% prf2) =
wenzelm@32024
   613
          (abshyp i prf1 %% abshyph i prf2
wenzelm@32024
   614
            handle Same.SAME => prf1 %% abshyp i prf2)
wenzelm@32019
   615
      | abshyp _ _ = raise Same.SAME
wenzelm@32024
   616
    and abshyph i prf = (abshyp i prf handle Same.SAME => prf);
berghofe@11519
   617
  in
skalberg@15531
   618
    AbsP ("H", NONE (*h*), abshyph 0 prf)
berghofe@11519
   619
  end;
berghofe@11519
   620
berghofe@11519
   621
berghofe@11519
   622
(***** forall introduction *****)
berghofe@11519
   623
skalberg@15531
   624
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf);
berghofe@11519
   625
berghofe@11519
   626
berghofe@11519
   627
(***** varify *****)
berghofe@11519
   628
berghofe@11519
   629
fun varify_proof t fixed prf =
berghofe@11519
   630
  let
wenzelm@19304
   631
    val fs = Term.fold_types (Term.fold_atyps
wenzelm@19304
   632
      (fn TFree v => if member (op =) fixed v then I else insert (op =) v | _ => I)) t [];
wenzelm@29261
   633
    val used = Name.context
wenzelm@29261
   634
      |> fold_types (fold_atyps (fn TVar ((a, _), _) => Name.declare a | _ => I)) t;
wenzelm@32024
   635
    val fmap = fs ~~ #1 (Name.variants (map fst fs) used);
berghofe@11519
   636
    fun thaw (f as (a, S)) =
haftmann@17314
   637
      (case AList.lookup (op =) fmap f of
skalberg@15531
   638
        NONE => TFree f
skalberg@15531
   639
      | SOME b => TVar ((b, 0), S));
wenzelm@28803
   640
  in map_proof_terms (map_types (map_type_tfree thaw)) (map_type_tfree thaw) prf end;
berghofe@11519
   641
berghofe@11519
   642
berghofe@11519
   643
local
berghofe@11519
   644
berghofe@11519
   645
fun new_name (ix, (pairs,used)) =
wenzelm@20071
   646
  let val v = Name.variant used (string_of_indexname ix)
berghofe@11519
   647
  in  ((ix, v) :: pairs, v :: used)  end;
berghofe@11519
   648
haftmann@17325
   649
fun freeze_one alist (ix, sort) = (case AList.lookup (op =) alist ix of
skalberg@15531
   650
    NONE => TVar (ix, sort)
skalberg@15531
   651
  | SOME name => TFree (name, sort));
berghofe@11519
   652
berghofe@11519
   653
in
berghofe@11519
   654
berghofe@11519
   655
fun freezeT t prf =
berghofe@11519
   656
  let
wenzelm@29270
   657
    val used = OldTerm.it_term_types OldTerm.add_typ_tfree_names (t, [])
wenzelm@29270
   658
    and tvars = map #1 (OldTerm.it_term_types OldTerm.add_typ_tvars (t, []));
wenzelm@23178
   659
    val (alist, _) = List.foldr new_name ([], used) tvars;
berghofe@11519
   660
  in
berghofe@11519
   661
    (case alist of
berghofe@11519
   662
      [] => prf (*nothing to do!*)
berghofe@11519
   663
    | _ =>
berghofe@11519
   664
      let val frzT = map_type_tvar (freeze_one alist)
wenzelm@20548
   665
      in map_proof_terms (map_types frzT) frzT prf end)
berghofe@11519
   666
  end;
berghofe@11519
   667
berghofe@11519
   668
end;
berghofe@11519
   669
berghofe@11519
   670
berghofe@11519
   671
(***** rotate assumptions *****)
berghofe@11519
   672
berghofe@11519
   673
fun rotate_proof Bs Bi m prf =
berghofe@11519
   674
  let
berghofe@11519
   675
    val params = Term.strip_all_vars Bi;
berghofe@11519
   676
    val asms = Logic.strip_imp_prems (Term.strip_all_body Bi);
berghofe@11519
   677
    val i = length asms;
berghofe@11519
   678
    val j = length Bs;
berghofe@11519
   679
  in
berghofe@11519
   680
    mk_AbsP (j+1, proof_combP (prf, map PBound
wenzelm@23178
   681
      (j downto 1) @ [mk_Abst params (mk_AbsP (i,
berghofe@11519
   682
        proof_combP (proof_combt (PBound i, map Bound ((length params - 1) downto 0)),
wenzelm@23178
   683
          map PBound (((i-m-1) downto 0) @ ((i-1) downto (i-m))))))]))
berghofe@11519
   684
  end;
berghofe@11519
   685
berghofe@11519
   686
berghofe@11519
   687
(***** permute premises *****)
berghofe@11519
   688
berghofe@11519
   689
fun permute_prems_prf prems j k prf =
berghofe@11519
   690
  let val n = length prems
berghofe@11519
   691
  in mk_AbsP (n, proof_combP (prf,
berghofe@11519
   692
    map PBound ((n-1 downto n-j) @ (k-1 downto 0) @ (n-j-1 downto k))))
berghofe@11519
   693
  end;
berghofe@11519
   694
berghofe@11519
   695
wenzelm@19908
   696
(***** generalization *****)
wenzelm@19908
   697
wenzelm@20000
   698
fun generalize (tfrees, frees) idx =
wenzelm@20000
   699
  map_proof_terms_option
wenzelm@31977
   700
    (Term_Subst.generalize_option (tfrees, frees) idx)
wenzelm@31977
   701
    (Term_Subst.generalizeT_option tfrees idx);
wenzelm@19908
   702
wenzelm@19908
   703
berghofe@11519
   704
(***** instantiation *****)
berghofe@11519
   705
wenzelm@20000
   706
fun instantiate (instT, inst) =
wenzelm@20000
   707
  map_proof_terms_option
wenzelm@31977
   708
    (Term_Subst.instantiate_option (instT, map (apsnd remove_types) inst))
wenzelm@31977
   709
    (Term_Subst.instantiateT_option instT);
berghofe@11519
   710
berghofe@11519
   711
berghofe@11519
   712
(***** lifting *****)
berghofe@11519
   713
berghofe@11519
   714
fun lift_proof Bi inc prop prf =
berghofe@11519
   715
  let
wenzelm@32024
   716
    fun lift'' Us Ts t =
wenzelm@32024
   717
      strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t));
berghofe@11519
   718
berghofe@11715
   719
    fun lift' Us Ts (Abst (s, T, prf)) =
wenzelm@32024
   720
          (Abst (s, Same.map_option (Logic.incr_tvar_same inc) T, lifth' Us (dummyT::Ts) prf)
wenzelm@32019
   721
           handle Same.SAME => Abst (s, T, lift' Us (dummyT::Ts) prf))
berghofe@11715
   722
      | lift' Us Ts (AbsP (s, t, prf)) =
wenzelm@32024
   723
          (AbsP (s, Same.map_option (same (op =) (lift'' Us Ts)) t, lifth' Us Ts prf)
wenzelm@32019
   724
           handle Same.SAME => AbsP (s, t, lift' Us Ts prf))
skalberg@15570
   725
      | lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t
wenzelm@32024
   726
          handle Same.SAME => prf % Same.map_option (same (op =) (lift'' Us Ts)) t)
berghofe@11715
   727
      | lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2
wenzelm@32019
   728
          handle Same.SAME => prf1 %% lift' Us Ts prf2)
berghofe@11715
   729
      | lift' _ _ (PAxm (s, prop, Ts)) =
wenzelm@32024
   730
          PAxm (s, prop, (Same.map_option o Same.map) (Logic.incr_tvar_same inc) Ts)
wenzelm@31943
   731
      | lift' _ _ (OfClass (T, c)) =
wenzelm@32024
   732
          OfClass (Logic.incr_tvar_same inc T, c)
wenzelm@28828
   733
      | lift' _ _ (Oracle (s, prop, Ts)) =
wenzelm@32024
   734
          Oracle (s, prop, (Same.map_option o Same.map) (Logic.incr_tvar_same inc) Ts)
wenzelm@28828
   735
      | lift' _ _ (Promise (i, prop, Ts)) =
wenzelm@32024
   736
          Promise (i, prop, Same.map (Logic.incr_tvar_same inc) Ts)
wenzelm@28803
   737
      | lift' _ _ (PThm (i, ((s, prop, Ts), body))) =
wenzelm@32024
   738
          PThm (i, ((s, prop, (Same.map_option o Same.map) (Logic.incr_tvar inc) Ts), body))
wenzelm@32019
   739
      | lift' _ _ _ = raise Same.SAME
wenzelm@32019
   740
    and lifth' Us Ts prf = (lift' Us Ts prf handle Same.SAME => prf);
berghofe@11519
   741
wenzelm@18030
   742
    val ps = map (Logic.lift_all inc Bi) (Logic.strip_imp_prems prop);
berghofe@11519
   743
    val k = length ps;
berghofe@11519
   744
wenzelm@23178
   745
    fun mk_app b (i, j, prf) =
berghofe@11615
   746
          if b then (i-1, j, prf %% PBound i) else (i, j-1, prf %> Bound j);
berghofe@11519
   747
berghofe@11519
   748
    fun lift Us bs i j (Const ("==>", _) $ A $ B) =
wenzelm@20147
   749
            AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B)
wenzelm@21646
   750
      | lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) =
wenzelm@20147
   751
            Abst (a, NONE (*T*), lift (T::Us) (false::bs) i (j+1) t)
berghofe@11715
   752
      | lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf,
wenzelm@23178
   753
            map (fn k => (#3 (fold_rev mk_app bs (i-1, j-1, PBound k))))
berghofe@11519
   754
              (i + k - 1 downto i));
berghofe@11519
   755
  in
berghofe@11519
   756
    mk_AbsP (k, lift [] [] 0 0 Bi)
berghofe@11519
   757
  end;
berghofe@11519
   758
wenzelm@32027
   759
fun incr_indexes i =
wenzelm@32027
   760
  map_proof_terms_option
wenzelm@32027
   761
    (Same.capture (Logic.incr_indexes_same ([], i)))
wenzelm@32027
   762
    (Same.capture (Logic.incr_tvar_same i));
wenzelm@32027
   763
berghofe@11519
   764
berghofe@11519
   765
(***** proof by assumption *****)
berghofe@11519
   766
berghofe@23296
   767
fun mk_asm_prf t i m =
berghofe@23296
   768
  let
berghofe@23296
   769
    fun imp_prf _ i 0 = PBound i
berghofe@23296
   770
      | imp_prf (Const ("==>", _) $ A $ B) i m = AbsP ("H", NONE (*A*), imp_prf B (i+1) (m-1))
berghofe@23296
   771
      | imp_prf _ i _ = PBound i;
berghofe@23296
   772
    fun all_prf (Const ("all", _) $ Abs (a, T, t)) = Abst (a, NONE (*T*), all_prf t)
berghofe@23296
   773
      | all_prf t = imp_prf t (~i) m
berghofe@23296
   774
  in all_prf t end;
berghofe@11519
   775
berghofe@11519
   776
fun assumption_proof Bs Bi n prf =
berghofe@11519
   777
  mk_AbsP (length Bs, proof_combP (prf,
berghofe@23296
   778
    map PBound (length Bs - 1 downto 0) @ [mk_asm_prf Bi n ~1]));
berghofe@11519
   779
berghofe@11519
   780
berghofe@11519
   781
(***** Composition of object rule with proof state *****)
berghofe@11519
   782
berghofe@11519
   783
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) =
skalberg@15531
   784
      AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k))
berghofe@11519
   785
  | flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) =
skalberg@15531
   786
      Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k))
berghofe@11519
   787
  | flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i),
wenzelm@19304
   788
      map Bound (j-1 downto 0)), map PBound (remove (op =) (i-n) (i-1 downto 0)));
berghofe@11519
   789
berghofe@23296
   790
fun bicompose_proof flatten Bs oldAs newAs A n m rprf sprf =
berghofe@11519
   791
  let
berghofe@11519
   792
    val la = length newAs;
berghofe@11519
   793
    val lb = length Bs;
berghofe@11519
   794
  in
berghofe@11519
   795
    mk_AbsP (lb+la, proof_combP (sprf,
berghofe@11615
   796
      map PBound (lb + la - 1 downto la)) %%
berghofe@23296
   797
        proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) n m] else []) @
wenzelm@18485
   798
          map (if flatten then flatten_params_proof 0 0 n else PBound o snd)
wenzelm@18485
   799
            (oldAs ~~ (la - 1 downto 0))))
berghofe@11519
   800
  end;
berghofe@11519
   801
berghofe@11519
   802
berghofe@11519
   803
(***** axioms for equality *****)
berghofe@11519
   804
wenzelm@14854
   805
val aT = TFree ("'a", []);
wenzelm@14854
   806
val bT = TFree ("'b", []);
berghofe@11519
   807
val x = Free ("x", aT);
berghofe@11519
   808
val y = Free ("y", aT);
berghofe@11519
   809
val z = Free ("z", aT);
berghofe@11519
   810
val A = Free ("A", propT);
berghofe@11519
   811
val B = Free ("B", propT);
berghofe@11519
   812
val f = Free ("f", aT --> bT);
berghofe@11519
   813
val g = Free ("g", aT --> bT);
berghofe@11519
   814
berghofe@11519
   815
local open Logic in
berghofe@11519
   816
berghofe@11519
   817
val equality_axms =
berghofe@11519
   818
  [("reflexive", mk_equals (x, x)),
berghofe@11519
   819
   ("symmetric", mk_implies (mk_equals (x, y), mk_equals (y, x))),
berghofe@11519
   820
   ("transitive", list_implies ([mk_equals (x, y), mk_equals (y, z)], mk_equals (x, z))),
berghofe@11519
   821
   ("equal_intr", list_implies ([mk_implies (A, B), mk_implies (B, A)], mk_equals (A, B))),
berghofe@11519
   822
   ("equal_elim", list_implies ([mk_equals (A, B), A], B)),
wenzelm@27330
   823
   ("abstract_rule", mk_implies
wenzelm@27330
   824
      (all x (mk_equals (f $ x, g $ x)), mk_equals (lambda x (f $ x), lambda x (g $ x)))),
wenzelm@27330
   825
   ("combination", list_implies
wenzelm@27330
   826
      ([mk_equals (f, g), mk_equals (x, y)], mk_equals (f $ x, g $ y)))];
berghofe@11519
   827
berghofe@11519
   828
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm,
berghofe@11519
   829
  equal_elim_axm, abstract_rule_axm, combination_axm] =
wenzelm@26424
   830
    map (fn (s, t) => PAxm ("Pure." ^ s, varify t, NONE)) equality_axms;
berghofe@11519
   831
berghofe@11519
   832
end;
berghofe@11519
   833
skalberg@15531
   834
val reflexive = reflexive_axm % NONE;
berghofe@11519
   835
wenzelm@26424
   836
fun symmetric (prf as PAxm ("Pure.reflexive", _, _) % _) = prf
skalberg@15531
   837
  | symmetric prf = symmetric_axm % NONE % NONE %% prf;
berghofe@11519
   838
wenzelm@26424
   839
fun transitive _ _ (PAxm ("Pure.reflexive", _, _) % _) prf2 = prf2
wenzelm@26424
   840
  | transitive _ _ prf1 (PAxm ("Pure.reflexive", _, _) % _) = prf1
berghofe@11519
   841
  | transitive u (Type ("prop", [])) prf1 prf2 =
skalberg@15531
   842
      transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2
berghofe@11519
   843
  | transitive u T prf1 prf2 =
skalberg@15531
   844
      transitive_axm % NONE % NONE % NONE %% prf1 %% prf2;
berghofe@11519
   845
berghofe@11519
   846
fun abstract_rule x a prf =
skalberg@15531
   847
  abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf;
berghofe@11519
   848
wenzelm@26424
   849
fun check_comb (PAxm ("Pure.combination", _, _) % f % g % _ % _ %% prf %% _) =
wenzelm@19502
   850
      is_some f orelse check_comb prf
wenzelm@26424
   851
  | check_comb (PAxm ("Pure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) =
berghofe@11519
   852
      check_comb prf1 andalso check_comb prf2
wenzelm@26424
   853
  | check_comb (PAxm ("Pure.symmetric", _, _) % _ % _ %% prf) = check_comb prf
berghofe@11519
   854
  | check_comb _ = false;
berghofe@11519
   855
berghofe@11519
   856
fun combination f g t u (Type (_, [T, U])) prf1 prf2 =
berghofe@11519
   857
  let
berghofe@11519
   858
    val f = Envir.beta_norm f;
berghofe@11519
   859
    val g = Envir.beta_norm g;
berghofe@11519
   860
    val prf =  if check_comb prf1 then
skalberg@15531
   861
        combination_axm % NONE % NONE
berghofe@11519
   862
      else (case prf1 of
wenzelm@26424
   863
          PAxm ("Pure.reflexive", _, _) % _ =>
skalberg@15531
   864
            combination_axm %> remove_types f % NONE
berghofe@11615
   865
        | _ => combination_axm %> remove_types f %> remove_types g)
berghofe@11519
   866
  in
berghofe@11519
   867
    (case T of
berghofe@11615
   868
       Type ("fun", _) => prf %
berghofe@11519
   869
         (case head_of f of
skalberg@15531
   870
            Abs _ => SOME (remove_types t)
skalberg@15531
   871
          | Var _ => SOME (remove_types t)
skalberg@15531
   872
          | _ => NONE) %
berghofe@11519
   873
         (case head_of g of
skalberg@15531
   874
            Abs _ => SOME (remove_types u)
skalberg@15531
   875
          | Var _ => SOME (remove_types u)
skalberg@15531
   876
          | _ => NONE) %% prf1 %% prf2
skalberg@15531
   877
     | _ => prf % NONE % NONE %% prf1 %% prf2)
berghofe@11519
   878
  end;
berghofe@11519
   879
berghofe@11519
   880
fun equal_intr A B prf1 prf2 =
berghofe@11615
   881
  equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
berghofe@11519
   882
berghofe@11519
   883
fun equal_elim A B prf1 prf2 =
berghofe@11615
   884
  equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
berghofe@11519
   885
berghofe@11519
   886
berghofe@11519
   887
(***** axioms and theorems *****)
berghofe@11519
   888
wenzelm@32738
   889
val proofs = Unsynchronized.ref 2;
wenzelm@28803
   890
berghofe@28812
   891
fun vars_of t = map Var (rev (Term.add_vars t []));
berghofe@28812
   892
fun frees_of t = map Free (rev (Term.add_frees t []));
berghofe@11519
   893
berghofe@11519
   894
fun test_args _ [] = true
berghofe@11519
   895
  | test_args is (Bound i :: ts) =
wenzelm@17492
   896
      not (member (op =) is i) andalso test_args (i :: is) ts
berghofe@11519
   897
  | test_args _ _ = false;
berghofe@11519
   898
berghofe@11519
   899
fun is_fun (Type ("fun", _)) = true
berghofe@11519
   900
  | is_fun (TVar _) = true
berghofe@11519
   901
  | is_fun _ = false;
berghofe@11519
   902
berghofe@11519
   903
fun add_funvars Ts (vs, t) =
berghofe@11519
   904
  if is_fun (fastype_of1 (Ts, t)) then
haftmann@33042
   905
    union (op =) vs (map_filter (fn Var (ixn, T) =>
haftmann@33037
   906
      if is_fun T then SOME ixn else NONE | _ => NONE) (vars_of t))
berghofe@11519
   907
  else vs;
berghofe@11519
   908
berghofe@11519
   909
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) =
berghofe@11519
   910
      add_npvars q p Ts (add_npvars q (not p) Ts (vs, t), u)
berghofe@11519
   911
  | add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) =
berghofe@11519
   912
      add_npvars q p Ts (vs, if p andalso q then betapply (t, Var (("",0), T)) else t)
berghofe@12041
   913
  | add_npvars q p Ts (vs, Abs (_, T, t)) = add_npvars q p (T::Ts) (vs, t)
berghofe@12041
   914
  | add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t)
berghofe@12041
   915
and add_npvars' Ts (vs, t) = (case strip_comb t of
berghofe@11519
   916
    (Var (ixn, _), ts) => if test_args [] ts then vs
haftmann@17314
   917
      else Library.foldl (add_npvars' Ts)
haftmann@17314
   918
        (AList.update (op =) (ixn,
haftmann@17314
   919
          Library.foldl (add_funvars Ts) ((these ooo AList.lookup) (op =) vs ixn, ts)) vs, ts)
skalberg@15570
   920
  | (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts)
skalberg@15570
   921
  | (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts));
berghofe@11519
   922
haftmann@33042
   923
fun prop_vars (Const ("==>", _) $ P $ Q) = union (op =) (prop_vars P) (prop_vars Q)
berghofe@11519
   924
  | prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t
berghofe@11519
   925
  | prop_vars t = (case strip_comb t of
berghofe@11519
   926
      (Var (ixn, _), _) => [ixn] | _ => []);
berghofe@11519
   927
berghofe@11519
   928
fun is_proj t =
berghofe@11519
   929
  let
berghofe@11519
   930
    fun is_p i t = (case strip_comb t of
berghofe@11519
   931
        (Bound j, []) => false
berghofe@11519
   932
      | (Bound j, ts) => j >= i orelse exists (is_p i) ts
berghofe@11519
   933
      | (Abs (_, _, u), _) => is_p (i+1) u
berghofe@11519
   934
      | (_, ts) => exists (is_p i) ts)
berghofe@11519
   935
  in (case strip_abs_body t of
berghofe@11519
   936
        Bound _ => true
berghofe@11519
   937
      | t' => is_p 0 t')
berghofe@11519
   938
  end;
berghofe@11519
   939
wenzelm@21646
   940
fun needed_vars prop =
haftmann@33042
   941
  union (op =) (Library.foldl (uncurry (union (op =)))
haftmann@33042
   942
    ([], map (uncurry (insert (op =))) (add_npvars true true [] ([], prop))))
haftmann@33042
   943
  (prop_vars prop);
berghofe@11519
   944
berghofe@11519
   945
fun gen_axm_proof c name prop =
berghofe@11519
   946
  let
berghofe@11519
   947
    val nvs = needed_vars prop;
berghofe@11519
   948
    val args = map (fn (v as Var (ixn, _)) =>
wenzelm@17492
   949
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
berghofe@28812
   950
      map SOME (frees_of prop);
berghofe@11519
   951
  in
skalberg@15531
   952
    proof_combt' (c (name, prop, NONE), args)
berghofe@11519
   953
  end;
berghofe@11519
   954
berghofe@11519
   955
val axm_proof = gen_axm_proof PAxm;
berghofe@17017
   956
berghofe@17017
   957
val dummy = Const (Term.dummy_patternN, dummyT);
berghofe@17017
   958
berghofe@17017
   959
fun oracle_proof name prop =
wenzelm@30716
   960
  if ! proofs = 0 then ((name, dummy), Oracle (name, dummy, NONE))
wenzelm@30716
   961
  else ((name, prop), gen_axm_proof Oracle name prop);
berghofe@11519
   962
wenzelm@32785
   963
val shrink_proof =
wenzelm@17492
   964
  let
wenzelm@17492
   965
    fun shrink ls lev (prf as Abst (a, T, body)) =
wenzelm@17492
   966
          let val (b, is, ch, body') = shrink ls (lev+1) body
wenzelm@26631
   967
          in (b, is, ch, if ch then Abst (a, T, body') else prf) end
wenzelm@17492
   968
      | shrink ls lev (prf as AbsP (a, t, body)) =
wenzelm@17492
   969
          let val (b, is, ch, body') = shrink (lev::ls) lev body
wenzelm@19482
   970
          in (b orelse member (op =) is 0, map_filter (fn 0 => NONE | i => SOME (i-1)) is,
wenzelm@26631
   971
            ch, if ch then AbsP (a, t, body') else prf)
wenzelm@17492
   972
          end
wenzelm@17492
   973
      | shrink ls lev prf =
wenzelm@17492
   974
          let val (is, ch, _, prf') = shrink' ls lev [] [] prf
wenzelm@17492
   975
          in (false, is, ch, prf') end
wenzelm@17492
   976
    and shrink' ls lev ts prfs (prf as prf1 %% prf2) =
wenzelm@17492
   977
          let
wenzelm@17492
   978
            val p as (_, is', ch', prf') = shrink ls lev prf2;
wenzelm@17492
   979
            val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1
haftmann@33042
   980
          in (union (op =) is is', ch orelse ch', ts',
wenzelm@17492
   981
              if ch orelse ch' then prf'' %% prf' else prf)
wenzelm@17492
   982
          end
wenzelm@17492
   983
      | shrink' ls lev ts prfs (prf as prf1 % t) =
wenzelm@17492
   984
          let val (is, ch, (ch', t')::ts', prf') = shrink' ls lev (t::ts) prfs prf1
wenzelm@17492
   985
          in (is, ch orelse ch', ts',
wenzelm@26631
   986
              if ch orelse ch' then prf' % t' else prf) end
wenzelm@17492
   987
      | shrink' ls lev ts prfs (prf as PBound i) =
wenzelm@30146
   988
          (if exists (fn SOME (Bound j) => lev-j <= nth ls i | _ => true) ts
haftmann@18928
   989
             orelse has_duplicates (op =)
haftmann@18928
   990
               (Library.foldl (fn (js, SOME (Bound j)) => j :: js | (js, _) => js) ([], ts))
wenzelm@17492
   991
             orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf)
wenzelm@31903
   992
      | shrink' ls lev ts prfs (prf as Hyp _) = ([], false, map (pair false) ts, prf)
wenzelm@31903
   993
      | shrink' ls lev ts prfs (prf as MinProof) = ([], false, map (pair false) ts, prf)
wenzelm@31943
   994
      | shrink' ls lev ts prfs (prf as OfClass _) = ([], false, map (pair false) ts, prf)
wenzelm@17492
   995
      | shrink' ls lev ts prfs prf =
wenzelm@17492
   996
          let
wenzelm@28803
   997
            val prop =
wenzelm@28803
   998
              (case prf of
wenzelm@28803
   999
                PAxm (_, prop, _) => prop
wenzelm@28803
  1000
              | Oracle (_, prop, _) => prop
wenzelm@28803
  1001
              | Promise (_, prop, _) => prop
wenzelm@28803
  1002
              | PThm (_, ((_, prop, _), _)) => prop
wenzelm@28319
  1003
              | _ => error "shrink: proof not in normal form");
wenzelm@17492
  1004
            val vs = vars_of prop;
wenzelm@19012
  1005
            val (ts', ts'') = chop (length vs) ts;
wenzelm@17492
  1006
            val insts = Library.take (length ts', map (fst o dest_Var) vs) ~~ ts';
wenzelm@17492
  1007
            val nvs = Library.foldl (fn (ixns', (ixn, ixns)) =>
wenzelm@17492
  1008
              insert (op =) ixn (case AList.lookup (op =) insts ixn of
haftmann@33042
  1009
                  SOME (SOME t) => if is_proj t then union (op =) ixns ixns' else ixns'
haftmann@33042
  1010
                | _ => union (op =) ixns ixns'))
wenzelm@17492
  1011
                  (needed prop ts'' prfs, add_npvars false true [] ([], prop));
wenzelm@17492
  1012
            val insts' = map
wenzelm@17492
  1013
              (fn (ixn, x as SOME _) => if member (op =) nvs ixn then (false, x) else (true, NONE)
wenzelm@17492
  1014
                | (_, x) => (false, x)) insts
wenzelm@17492
  1015
          in ([], false, insts' @ map (pair false) ts'', prf) end
wenzelm@17492
  1016
    and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) =
haftmann@33042
  1017
          union (op =) (if b then map (fst o dest_Var) (vars_of t) else []) (needed u ts prfs)
wenzelm@17492
  1018
      | needed (Var (ixn, _)) (_::_) _ = [ixn]
wenzelm@17492
  1019
      | needed _ _ _ = [];
wenzelm@17492
  1020
  in shrink end;
berghofe@11519
  1021
berghofe@11519
  1022
berghofe@11519
  1023
(**** Simple first order matching functions for terms and proofs ****)
berghofe@11519
  1024
berghofe@11519
  1025
exception PMatch;
berghofe@11519
  1026
berghofe@11519
  1027
(** see pattern.ML **)
berghofe@11519
  1028
wenzelm@33317
  1029
fun flt (i: int) = filter (fn n => n < i);
berghofe@12279
  1030
berghofe@12279
  1031
fun fomatch Ts tymatch j =
berghofe@11519
  1032
  let
berghofe@11519
  1033
    fun mtch (instsp as (tyinsts, insts)) = fn
berghofe@11519
  1034
        (Var (ixn, T), t)  =>
berghofe@12279
  1035
          if j>0 andalso not (null (flt j (loose_bnos t)))
berghofe@12279
  1036
          then raise PMatch
berghofe@12279
  1037
          else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))),
berghofe@12279
  1038
            (ixn, t) :: insts)
berghofe@11519
  1039
      | (Free (a, T), Free (b, U)) =>
wenzelm@20147
  1040
          if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
berghofe@11519
  1041
      | (Const (a, T), Const (b, U))  =>
wenzelm@20147
  1042
          if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
berghofe@11519
  1043
      | (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u)
berghofe@12279
  1044
      | (Bound i, Bound j) => if i=j then instsp else raise PMatch
berghofe@11519
  1045
      | _ => raise PMatch
berghofe@11519
  1046
  in mtch end;
berghofe@11519
  1047
berghofe@12279
  1048
fun match_proof Ts tymatch =
berghofe@11519
  1049
  let
skalberg@15531
  1050
    fun optmatch _ inst (NONE, _) = inst
skalberg@15531
  1051
      | optmatch _ _ (SOME _, NONE) = raise PMatch
skalberg@15531
  1052
      | optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y)
berghofe@12279
  1053
berghofe@12279
  1054
    fun matcht Ts j (pinst, tinst) (t, u) =
berghofe@12279
  1055
      (pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u));
berghofe@12279
  1056
    fun matchT (pinst, (tyinsts, insts)) p =
berghofe@12279
  1057
      (pinst, (tymatch (tyinsts, K p), insts));
skalberg@15570
  1058
    fun matchTs inst (Ts, Us) = Library.foldl (uncurry matchT) (inst, Ts ~~ Us);
berghofe@12279
  1059
berghofe@12279
  1060
    fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) =
berghofe@12279
  1061
          if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst)
berghofe@12279
  1062
          else (case apfst (flt i) (apsnd (flt j)
berghofe@12279
  1063
                  (prf_add_loose_bnos 0 0 prf ([], []))) of
berghofe@12279
  1064
              ([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
berghofe@12279
  1065
            | ([], _) => if j = 0 then
berghofe@12279
  1066
                   ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
berghofe@12279
  1067
                 else raise PMatch
berghofe@12279
  1068
            | _ => raise PMatch)
berghofe@12279
  1069
      | mtch Ts i j inst (prf1 % opt1, prf2 % opt2) =
berghofe@12279
  1070
          optmatch (matcht Ts j) (mtch Ts i j inst (prf1, prf2)) (opt1, opt2)
berghofe@12279
  1071
      | mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') =
berghofe@12279
  1072
          mtch Ts i j (mtch Ts i j inst (prf1, prf1')) (prf2, prf2')
berghofe@12279
  1073
      | mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) =
wenzelm@18485
  1074
          mtch (the_default dummyT opU :: Ts) i (j+1)
berghofe@12279
  1075
            (optmatch matchT inst (opT, opU)) (prf1, prf2)
berghofe@12279
  1076
      | mtch Ts i j inst (prf1, Abst (_, opU, prf2)) =
wenzelm@18485
  1077
          mtch (the_default dummyT opU :: Ts) i (j+1) inst
berghofe@12279
  1078
            (incr_pboundvars 0 1 prf1 %> Bound 0, prf2)
berghofe@12279
  1079
      | mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) =
berghofe@12279
  1080
          mtch Ts (i+1) j (optmatch (matcht Ts j) inst (opt, opu)) (prf1, prf2)
berghofe@12279
  1081
      | mtch Ts i j inst (prf1, AbsP (_, _, prf2)) =
berghofe@12279
  1082
          mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2)
wenzelm@28803
  1083
      | mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) =
wenzelm@28803
  1084
          if s1 = s2 then optmatch matchTs inst (opTs, opUs)
wenzelm@28803
  1085
          else raise PMatch
wenzelm@31943
  1086
      | mtch Ts i j inst (OfClass (T1, c1), OfClass (T2, c2)) =
wenzelm@31903
  1087
          if c1 = c2 then matchT inst (T1, T2)
wenzelm@31903
  1088
          else raise PMatch
wenzelm@28803
  1089
      | mtch Ts i j inst (PThm (_, ((name1, prop1, opTs), _)), PThm (_, ((name2, prop2, opUs), _))) =
wenzelm@28803
  1090
          if name1 = name2 andalso prop1 = prop2 then
berghofe@12279
  1091
            optmatch matchTs inst (opTs, opUs)
berghofe@11519
  1092
          else raise PMatch
berghofe@12279
  1093
      | mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch
berghofe@12279
  1094
      | mtch _ _ _ _ _ = raise PMatch
berghofe@12279
  1095
  in mtch Ts 0 0 end;
berghofe@11519
  1096
berghofe@11519
  1097
fun prf_subst (pinst, (tyinsts, insts)) =
berghofe@11519
  1098
  let
wenzelm@32049
  1099
    val substT = Envir.subst_type_same tyinsts;
wenzelm@32049
  1100
    val substTs = Same.map substT;
berghofe@11519
  1101
wenzelm@32049
  1102
    fun subst' lev (Var (xi, _)) =
wenzelm@32049
  1103
        (case AList.lookup (op =) insts xi of
wenzelm@32049
  1104
          NONE => raise Same.SAME
skalberg@15531
  1105
        | SOME u => incr_boundvars lev u)
wenzelm@32049
  1106
      | subst' _ (Const (s, T)) = Const (s, substT T)
wenzelm@32049
  1107
      | subst' _ (Free (s, T)) = Free (s, substT T)
wenzelm@32049
  1108
      | subst' lev (Abs (a, T, body)) =
wenzelm@32049
  1109
          (Abs (a, substT T, Same.commit (subst' (lev + 1)) body)
wenzelm@32049
  1110
            handle Same.SAME => Abs (a, T, subst' (lev + 1) body))
wenzelm@32049
  1111
      | subst' lev (f $ t) =
wenzelm@32049
  1112
          (subst' lev f $ Same.commit (subst' lev) t
wenzelm@32049
  1113
            handle Same.SAME => f $ subst' lev t)
wenzelm@32049
  1114
      | subst' _ _ = raise Same.SAME;
berghofe@11519
  1115
berghofe@11519
  1116
    fun subst plev tlev (AbsP (a, t, body)) =
wenzelm@32049
  1117
          (AbsP (a, Same.map_option (subst' tlev) t, Same.commit (subst (plev + 1) tlev) body)
wenzelm@32049
  1118
            handle Same.SAME => AbsP (a, t, subst (plev + 1) tlev body))
berghofe@11519
  1119
      | subst plev tlev (Abst (a, T, body)) =
wenzelm@32049
  1120
          (Abst (a, Same.map_option substT T, Same.commit (subst plev (tlev + 1)) body)
wenzelm@32049
  1121
            handle Same.SAME => Abst (a, T, subst plev (tlev + 1) body))
wenzelm@32049
  1122
      | subst plev tlev (prf %% prf') =
wenzelm@32049
  1123
          (subst plev tlev prf %% Same.commit (subst plev tlev) prf'
wenzelm@32049
  1124
            handle Same.SAME => prf %% subst plev tlev prf')
wenzelm@32049
  1125
      | subst plev tlev (prf % t) =
wenzelm@32049
  1126
          (subst plev tlev prf % Same.commit (Same.map_option (subst' tlev)) t
wenzelm@32049
  1127
            handle Same.SAME => prf % Same.map_option (subst' tlev) t)
wenzelm@32049
  1128
      | subst plev tlev (Hyp (Var (xi, _))) =
wenzelm@32049
  1129
          (case AList.lookup (op =) pinst xi of
wenzelm@32049
  1130
            NONE => raise Same.SAME
wenzelm@32049
  1131
          | SOME prf' => incr_pboundvars plev tlev prf')
wenzelm@32049
  1132
      | subst _ _ (PAxm (id, prop, Ts)) = PAxm (id, prop, Same.map_option substTs Ts)
wenzelm@31943
  1133
      | subst _ _ (OfClass (T, c)) = OfClass (substT T, c)
wenzelm@32049
  1134
      | subst _ _ (Oracle (id, prop, Ts)) = Oracle (id, prop, Same.map_option substTs Ts)
wenzelm@32049
  1135
      | subst _ _ (Promise (i, prop, Ts)) = Promise (i, prop, substTs Ts)
wenzelm@28803
  1136
      | subst _ _ (PThm (i, ((id, prop, Ts), body))) =
wenzelm@32049
  1137
          PThm (i, ((id, prop, Same.map_option substTs Ts), body))
wenzelm@32049
  1138
      | subst _ _ _ = raise Same.SAME;
wenzelm@32049
  1139
  in fn t => subst 0 0 t handle Same.SAME => t end;
berghofe@11519
  1140
wenzelm@21646
  1141
(*A fast unification filter: true unless the two terms cannot be unified.
berghofe@12871
  1142
  Terms must be NORMAL.  Treats all Vars as distinct. *)
berghofe@12871
  1143
fun could_unify prf1 prf2 =
berghofe@12871
  1144
  let
berghofe@12871
  1145
    fun matchrands (prf1 %% prf2) (prf1' %% prf2') =
berghofe@12871
  1146
          could_unify prf2 prf2' andalso matchrands prf1 prf1'
skalberg@15531
  1147
      | matchrands (prf % SOME t) (prf' % SOME t') =
berghofe@12871
  1148
          Term.could_unify (t, t') andalso matchrands prf prf'
berghofe@12871
  1149
      | matchrands (prf % _) (prf' % _) = matchrands prf prf'
berghofe@12871
  1150
      | matchrands _ _ = true
berghofe@12871
  1151
berghofe@12871
  1152
    fun head_of (prf %% _) = head_of prf
berghofe@12871
  1153
      | head_of (prf % _) = head_of prf
berghofe@12871
  1154
      | head_of prf = prf
berghofe@12871
  1155
berghofe@12871
  1156
  in case (head_of prf1, head_of prf2) of
berghofe@12871
  1157
        (_, Hyp (Var _)) => true
berghofe@12871
  1158
      | (Hyp (Var _), _) => true
wenzelm@28803
  1159
      | (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2
wenzelm@31943
  1160
      | (OfClass (_, c), OfClass (_, d)) => c = d andalso matchrands prf1 prf2
wenzelm@28803
  1161
      | (PThm (_, ((a, propa, _), _)), PThm (_, ((b, propb, _), _))) =>
berghofe@12871
  1162
          a = b andalso propa = propb andalso matchrands prf1 prf2
wenzelm@28803
  1163
      | (PBound i, PBound j) => i = j andalso matchrands prf1 prf2
berghofe@12871
  1164
      | (AbsP _, _) =>  true   (*because of possible eta equality*)
berghofe@12871
  1165
      | (Abst _, _) =>  true
berghofe@12871
  1166
      | (_, AbsP _) =>  true
berghofe@12871
  1167
      | (_, Abst _) =>  true
berghofe@12871
  1168
      | _ => false
berghofe@12871
  1169
  end;
berghofe@12871
  1170
wenzelm@28329
  1171
berghofe@11519
  1172
(**** rewriting on proof terms ****)
berghofe@11519
  1173
wenzelm@33722
  1174
val no_skel = PBound 0;
wenzelm@33722
  1175
val normal_skel = Hyp (Var ((Name.uu, 0), propT));
berghofe@13102
  1176
berghofe@12279
  1177
fun rewrite_prf tymatch (rules, procs) prf =
berghofe@11519
  1178
  let
wenzelm@33722
  1179
    fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, no_skel)
wenzelm@33722
  1180
      | rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, no_skel)
wenzelm@33722
  1181
      | rew Ts prf =
wenzelm@33722
  1182
          (case get_first (fn r => r Ts prf) procs of
wenzelm@33722
  1183
            NONE => get_first (fn (prf1, prf2) => SOME (prf_subst
wenzelm@33722
  1184
              (match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2)
wenzelm@33722
  1185
                 handle PMatch => NONE) (filter (could_unify prf o fst) rules)
wenzelm@33722
  1186
          | some => some);
berghofe@11519
  1187
berghofe@11615
  1188
    fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) =
berghofe@11519
  1189
          if prf_loose_Pbvar1 prf' 0 then rew Ts prf
berghofe@11519
  1190
          else
berghofe@11519
  1191
            let val prf'' = incr_pboundvars (~1) 0 prf'
wenzelm@33722
  1192
            in SOME (the_default (prf'', no_skel) (rew Ts prf'')) end
skalberg@15531
  1193
      | rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) =
berghofe@11519
  1194
          if prf_loose_bvar1 prf' 0 then rew Ts prf
berghofe@11519
  1195
          else
berghofe@11519
  1196
            let val prf'' = incr_pboundvars 0 (~1) prf'
wenzelm@33722
  1197
            in SOME (the_default (prf'', no_skel) (rew Ts prf'')) end
berghofe@11519
  1198
      | rew0 Ts prf = rew Ts prf;
berghofe@11519
  1199
skalberg@15531
  1200
    fun rew1 _ (Hyp (Var _)) _ = NONE
berghofe@13102
  1201
      | rew1 Ts skel prf = (case rew2 Ts skel prf of
skalberg@15531
  1202
          SOME prf1 => (case rew0 Ts prf1 of
wenzelm@19502
  1203
              SOME (prf2, skel') => SOME (the_default prf2 (rew1 Ts skel' prf2))
skalberg@15531
  1204
            | NONE => SOME prf1)
skalberg@15531
  1205
        | NONE => (case rew0 Ts prf of
wenzelm@19502
  1206
              SOME (prf1, skel') => SOME (the_default prf1 (rew1 Ts skel' prf1))
skalberg@15531
  1207
            | NONE => NONE))
berghofe@11519
  1208
skalberg@15531
  1209
    and rew2 Ts skel (prf % SOME t) = (case prf of
berghofe@11519
  1210
            Abst (_, _, body) =>
berghofe@11519
  1211
              let val prf' = prf_subst_bounds [t] body
wenzelm@33722
  1212
              in SOME (the_default prf' (rew2 Ts no_skel prf')) end
wenzelm@33722
  1213
          | _ => (case rew1 Ts (case skel of skel' % _ => skel' | _ => no_skel) prf of
skalberg@15531
  1214
              SOME prf' => SOME (prf' % SOME t)
skalberg@15531
  1215
            | NONE => NONE))
skalberg@15570
  1216
      | rew2 Ts skel (prf % NONE) = Option.map (fn prf' => prf' % NONE)
wenzelm@33722
  1217
          (rew1 Ts (case skel of skel' % _ => skel' | _ => no_skel) prf)
berghofe@13102
  1218
      | rew2 Ts skel (prf1 %% prf2) = (case prf1 of
berghofe@11519
  1219
            AbsP (_, _, body) =>
berghofe@11519
  1220
              let val prf' = prf_subst_pbounds [prf2] body
wenzelm@33722
  1221
              in SOME (the_default prf' (rew2 Ts no_skel prf')) end
berghofe@13102
  1222
          | _ =>
berghofe@13102
  1223
            let val (skel1, skel2) = (case skel of
berghofe@13102
  1224
                skel1 %% skel2 => (skel1, skel2)
wenzelm@33722
  1225
              | _ => (no_skel, no_skel))
berghofe@13102
  1226
            in case rew1 Ts skel1 prf1 of
skalberg@15531
  1227
                SOME prf1' => (case rew1 Ts skel2 prf2 of
skalberg@15531
  1228
                    SOME prf2' => SOME (prf1' %% prf2')
skalberg@15531
  1229
                  | NONE => SOME (prf1' %% prf2))
skalberg@15531
  1230
              | NONE => (case rew1 Ts skel2 prf2 of
skalberg@15531
  1231
                    SOME prf2' => SOME (prf1 %% prf2')
skalberg@15531
  1232
                  | NONE => NONE)
berghofe@13102
  1233
            end)
wenzelm@19502
  1234
      | rew2 Ts skel (Abst (s, T, prf)) = (case rew1 (the_default dummyT T :: Ts)
wenzelm@33722
  1235
              (case skel of Abst (_, _, skel') => skel' | _ => no_skel) prf of
skalberg@15531
  1236
            SOME prf' => SOME (Abst (s, T, prf'))
skalberg@15531
  1237
          | NONE => NONE)
berghofe@13102
  1238
      | rew2 Ts skel (AbsP (s, t, prf)) = (case rew1 Ts
wenzelm@33722
  1239
              (case skel of AbsP (_, _, skel') => skel' | _ => no_skel) prf of
skalberg@15531
  1240
            SOME prf' => SOME (AbsP (s, t, prf'))
skalberg@15531
  1241
          | NONE => NONE)
wenzelm@32049
  1242
      | rew2 _ _ _ = NONE;
berghofe@11519
  1243
wenzelm@33722
  1244
  in the_default prf (rew1 [] no_skel prf) end;
berghofe@11519
  1245
wenzelm@17203
  1246
fun rewrite_proof thy = rewrite_prf (fn (tyenv, f) =>
wenzelm@17203
  1247
  Sign.typ_match thy (f ()) tyenv handle Type.TYPE_MATCH => raise PMatch);
berghofe@11519
  1248
berghofe@11715
  1249
fun rewrite_proof_notypes rews = rewrite_prf fst rews;
berghofe@11615
  1250
wenzelm@16940
  1251
berghofe@11519
  1252
(**** theory data ****)
berghofe@11519
  1253
wenzelm@33522
  1254
structure ProofData = Theory_Data
wenzelm@22846
  1255
(
wenzelm@33722
  1256
  type T =
wenzelm@33722
  1257
    (stamp * (proof * proof)) list *
wenzelm@33722
  1258
    (stamp * (typ list -> proof -> (proof * proof) option)) list;
berghofe@11519
  1259
berghofe@12233
  1260
  val empty = ([], []);
wenzelm@16458
  1261
  val extend = I;
wenzelm@33522
  1262
  fun merge ((rules1, procs1), (rules2, procs2)) : T =
wenzelm@28803
  1263
    (AList.merge (op =) (K true) (rules1, rules2),
haftmann@22662
  1264
      AList.merge (op =) (K true) (procs1, procs2));
wenzelm@22846
  1265
);
berghofe@11519
  1266
wenzelm@28803
  1267
fun get_data thy = let val (rules, procs) = ProofData.get thy in (map #2 rules, map #2 procs) end;
wenzelm@28803
  1268
fun rew_proof thy = rewrite_prf fst (get_data thy);
berghofe@23780
  1269
wenzelm@28803
  1270
fun add_prf_rrule r = (ProofData.map o apfst) (cons (stamp (), r));
wenzelm@28803
  1271
fun add_prf_rproc p = (ProofData.map o apsnd) (cons (stamp (), p));
wenzelm@28803
  1272
wenzelm@28803
  1273
wenzelm@28828
  1274
(***** promises *****)
berghofe@11519
  1275
wenzelm@28828
  1276
fun promise_proof thy i prop =
wenzelm@28828
  1277
  let
wenzelm@28828
  1278
    val _ = prop |> Term.exists_subterm (fn t =>
wenzelm@28828
  1279
      (Term.is_Free t orelse Term.is_Var t) andalso
wenzelm@28828
  1280
        error ("promise_proof: illegal variable " ^ Syntax.string_of_term_global thy t));
wenzelm@28828
  1281
    val _ = prop |> Term.exists_type (Term.exists_subtype
wenzelm@28828
  1282
      (fn TFree (a, _) => error ("promise_proof: illegal type variable " ^ quote a)
wenzelm@28828
  1283
        | _ => false));
wenzelm@28828
  1284
  in Promise (i, prop, map TVar (Term.add_tvars prop [])) end;
wenzelm@28828
  1285
wenzelm@33722
  1286
fun fulfill_norm_proof thy ps body0 =
wenzelm@33722
  1287
  let
wenzelm@33722
  1288
    val PBody {oracles = oracles0, thms = thms0, proof = proof0} = body0;
wenzelm@33722
  1289
    val oracles = fold (fn (_, PBody {oracles, ...}) => merge_oracles oracles) ps oracles0;
wenzelm@33722
  1290
    val thms = fold (fn (_, PBody {thms, ...}) => merge_thms thms) ps thms0;
wenzelm@33722
  1291
    val proofs = fold (fn (i, PBody {proof, ...}) => Inttab.update (i, proof)) ps Inttab.empty;
wenzelm@28875
  1292
wenzelm@33722
  1293
    fun fill (Promise (i, prop, Ts)) =
wenzelm@33722
  1294
          (case Inttab.lookup proofs i of
wenzelm@33722
  1295
            NONE => NONE
wenzelm@33722
  1296
          | SOME prf => SOME (instantiate (Term.add_tvars prop [] ~~ Ts, []) prf, normal_skel))
wenzelm@33722
  1297
      | fill _ = NONE;
wenzelm@33722
  1298
    val (rules, procs) = get_data thy;
wenzelm@33722
  1299
    val proof = rewrite_prf fst (rules, K fill :: procs) proof0;
wenzelm@33722
  1300
  in PBody {oracles = oracles, thms = thms, proof = proof} end;
wenzelm@28828
  1301
wenzelm@32810
  1302
fun fulfill_proof_future _ [] body = Future.value body
wenzelm@32810
  1303
  | fulfill_proof_future thy promises body =
wenzelm@29642
  1304
      Future.fork_deps (map snd promises) (fn () =>
wenzelm@33722
  1305
        fulfill_norm_proof thy (map (apsnd Future.join) promises) body);
wenzelm@29642
  1306
wenzelm@28828
  1307
wenzelm@28828
  1308
(***** theorems *****)
berghofe@11519
  1309
wenzelm@32810
  1310
fun thm_proof thy name hyps concl promises body =
berghofe@11519
  1311
  let
wenzelm@28803
  1312
    val PBody {oracles = oracles0, thms = thms0, proof = prf} = body;
wenzelm@32810
  1313
    val prop = Logic.list_implies (hyps, concl);
berghofe@11519
  1314
    val nvs = needed_vars prop;
berghofe@11519
  1315
    val args = map (fn (v as Var (ixn, _)) =>
wenzelm@17492
  1316
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
berghofe@28812
  1317
      map SOME (frees_of prop);
wenzelm@28803
  1318
wenzelm@28803
  1319
    val proof0 =
wenzelm@28876
  1320
      if ! proofs = 2 then
wenzelm@32785
  1321
        #4 (shrink_proof [] 0 (rew_proof thy (fold_rev implies_intr_proof hyps prf)))
wenzelm@28876
  1322
      else MinProof;
wenzelm@29642
  1323
    val body0 = PBody {oracles = oracles0, thms = thms0, proof = proof0};
wenzelm@28803
  1324
wenzelm@32810
  1325
    fun new_prf () = (serial (), name, prop, fulfill_proof_future thy promises body0);
wenzelm@28815
  1326
    val (i, name, prop, body') =
wenzelm@28803
  1327
      (case strip_combt (fst (strip_combP prf)) of
wenzelm@28803
  1328
        (PThm (i, ((old_name, prop', NONE), body')), args') =>
wenzelm@28815
  1329
          if (old_name = "" orelse old_name = name) andalso prop = prop' andalso args = args'
wenzelm@28815
  1330
          then (i, name, prop, body')
wenzelm@28803
  1331
          else new_prf ()
wenzelm@28815
  1332
      | _ => new_prf ());
wenzelm@28815
  1333
    val head = PThm (i, ((name, prop, NONE), body'));
berghofe@11519
  1334
  in
wenzelm@28815
  1335
    ((i, (name, prop, body')), proof_combP (proof_combt' (head, args), map Hyp hyps))
berghofe@11519
  1336
  end;
berghofe@11519
  1337
wenzelm@21646
  1338
fun get_name hyps prop prf =
wenzelm@12923
  1339
  let val prop = Logic.list_implies (hyps, prop) in
wenzelm@12923
  1340
    (case strip_combt (fst (strip_combP prf)) of
wenzelm@32183
  1341
      (PThm (_, ((name, prop', _), _)), _) => if prop = prop' then name else ""
wenzelm@21646
  1342
    | _ => "")
wenzelm@12923
  1343
  end;
berghofe@11519
  1344
berghofe@11519
  1345
end;
berghofe@11519
  1346
wenzelm@32094
  1347
structure Basic_Proofterm : BASIC_PROOFTERM = Proofterm;
wenzelm@32094
  1348
open Basic_Proofterm;