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