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