src/Pure/proofterm.ML
author wenzelm
Sat, 21 Jan 2006 23:02:14 +0100
changeset 18728 6790126ab5f6
parent 18485 5959295f82d3
child 18928 042608ffa2ec
permissions -rw-r--r--
simplified type attribute;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     1
(*  Title:      Pure/proofterm.ML
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     2
    ID:         $Id$
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     3
    Author:     Stefan Berghofer, TU Muenchen
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     4
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     5
LF style proof terms.
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     6
*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     7
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
     8
infix 8 % %% %>;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     9
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    10
signature BASIC_PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    11
sig
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
    12
  val proofs: int ref
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    13
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    14
  datatype proof =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    15
     PBound of int
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    16
   | Abst of string * typ option * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    17
   | AbsP of string * term option * proof
17756
d4a35f82fbb4 minor tweaks for Poplog/ML;
wenzelm
parents: 17492
diff changeset
    18
   | % of proof * term option
d4a35f82fbb4 minor tweaks for Poplog/ML;
wenzelm
parents: 17492
diff changeset
    19
   | %% of proof * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    20
   | Hyp of term
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    21
   | PThm of (string * (string * string list) list) * proof * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    22
   | PAxm of string * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    23
   | Oracle of string * term * typ list option
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    24
   | MinProof of ((string * term) * proof) list * (string * term) list * (string * term) list;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    25
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
    26
  val %> : proof * term -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    27
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    28
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    29
signature PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    30
sig
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    31
  include BASIC_PROOFTERM
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    32
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    33
  val infer_derivs : (proof -> proof -> proof) -> bool * proof -> bool * proof -> bool * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    34
  val infer_derivs' : (proof -> proof) -> (bool * proof -> bool * proof)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    35
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    36
  (** primitive operations **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    37
  val proof_combt : proof * term list -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    38
  val proof_combt' : proof * term option list -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    39
  val proof_combP : proof * proof list -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    40
  val strip_combt : proof -> proof * term option list
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    41
  val strip_combP : proof -> proof * proof list
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    42
  val strip_thm : proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    43
  val map_proof_terms : (term -> term) -> (typ -> typ) -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    44
  val fold_proof_terms : (term * 'a -> 'a) -> (typ * 'a -> 'a) -> 'a * proof -> 'a
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    45
  val add_prf_names : string list * proof -> string list
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    46
  val add_prf_tfree_names : string list * proof -> string list
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    47
  val add_prf_tvar_ixns : indexname list * proof -> indexname list
12868
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
    48
  val maxidx_of_proof : proof -> int
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
    49
  val size_of_proof : proof -> int
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
    50
  val change_type : typ list option -> proof -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    51
  val prf_abstract_over : term -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    52
  val prf_incr_bv : int -> int -> int -> int -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    53
  val incr_pboundvars : int -> int -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    54
  val prf_loose_bvar1 : proof -> int -> bool
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    55
  val prf_loose_Pbvar1 : proof -> int -> bool
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
    56
  val prf_add_loose_bnos : int -> int -> proof ->
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
    57
    int list * int list -> int list * int list
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    58
  val norm_proof : Envir.env -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    59
  val norm_proof' : Envir.env -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    60
  val prf_subst_bounds : term list -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    61
  val prf_subst_pbounds : proof list -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    62
  val freeze_thaw_prf : proof -> proof * (proof -> proof)
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    63
  val proof_of_min_axm : string * term -> proof
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    64
  val proof_of_min_thm : (string * term) * proof -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    65
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    66
  val thms_of_proof : proof -> (term * proof) list Symtab.table ->
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    67
    (term * proof) list Symtab.table
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    68
  val axms_of_proof : proof -> proof Symtab.table -> proof Symtab.table
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
    69
  val oracles_of_proof : (string * term) list -> proof -> (string * term) list
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    70
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    71
  (** proof terms for specific inference rules **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    72
  val implies_intr_proof : term -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    73
  val forall_intr_proof : term -> string -> proof -> proof
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
    74
  val varify_proof : term -> (string * sort) list -> proof -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    75
  val freezeT : term -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    76
  val rotate_proof : term list -> term -> int -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    77
  val permute_prems_prf : term list -> int -> int -> proof -> proof
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
    78
  val instantiate : ((indexname * sort) * typ) list * ((indexname * typ) * term) list
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
    79
    -> proof -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    80
  val lift_proof : term -> int -> term -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    81
  val assumption_proof : term list -> term -> int -> proof -> proof
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
    82
  val bicompose_proof : bool -> term list -> term list -> term list -> term option ->
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    83
    int -> proof -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    84
  val equality_axms : (string * term) list
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    85
  val reflexive_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    86
  val symmetric_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    87
  val transitive_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    88
  val equal_intr_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    89
  val equal_elim_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    90
  val abstract_rule_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    91
  val combination_axm : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    92
  val reflexive : proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    93
  val symmetric : proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    94
  val transitive : term -> typ -> proof -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    95
  val abstract_rule : term -> string -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    96
  val combination : term -> term -> term -> term -> typ -> proof -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    97
  val equal_intr : term -> term -> proof -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    98
  val equal_elim : term -> term -> proof -> proof -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    99
  val axm_proof : string -> term -> proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   100
  val oracle_proof : string -> term -> proof
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
   101
  val thm_proof : theory -> string * (string * string list) list ->
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   102
    term list -> term -> proof -> proof
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
   103
  val get_name_tags : term list -> term -> proof -> string * (string * string list) list
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   104
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   105
  (** rewriting on proof terms **)
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
   106
  val add_prf_rrules : (proof * proof) list -> theory -> theory
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
   107
  val add_prf_rprocs : (string * (Term.typ list -> proof -> proof option)) list ->
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
   108
    theory -> theory
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17017
diff changeset
   109
  val rewrite_proof : theory -> (proof * proof) list *
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   110
    (string * (typ list -> proof -> proof option)) list -> proof -> proof
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   111
  val rewrite_proof_notypes : (proof * proof) list *
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   112
    (string * (typ list -> proof -> proof option)) list -> proof -> proof
16536
c5744af6b28a renamed init to init_data;
wenzelm
parents: 16458
diff changeset
   113
  val init_data: theory -> theory
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   114
  
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   115
end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   116
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   117
structure Proofterm : PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   118
struct
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   119
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   120
open Envir;
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   121
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   122
datatype proof =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   123
   PBound of int
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   124
 | Abst of string * typ option * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   125
 | AbsP of string * term option * proof
12497
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   126
 | op % of proof * term option
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   127
 | op %% of proof * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   128
 | Hyp of term
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   129
 | PThm of (string * (string * string list) list) * proof * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   130
 | PAxm of string * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   131
 | Oracle of string * term * typ list option
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   132
 | MinProof of ((string * term) * proof) list * (string * term) list * (string * term) list;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   133
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   134
fun proof_of_min_axm (s, prop) = PAxm (s, prop, NONE);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   135
fun proof_of_min_thm ((s, prop), prf) = PThm ((s, []), prf, prop, NONE);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   136
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   137
val string_term_ord = prod_ord fast_string_ord Term.fast_term_ord;
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   138
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   139
fun oracles_of_proof oras prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   140
  let
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   141
    fun oras_of (Abst (_, _, prf)) = oras_of prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   142
      | oras_of (AbsP (_, _, prf)) = oras_of prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   143
      | oras_of (prf % _) = oras_of prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   144
      | oras_of (prf1 %% prf2) = oras_of prf1 #> oras_of prf2
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   145
      | oras_of (PThm ((name, _), prf, prop, _)) = (fn tabs as (thms, oras) =>
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   146
          case Symtab.lookup thms name of
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   147
            NONE => oras_of prf (Symtab.update (name, [prop]) thms, oras)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   148
          | SOME ps => if member (op =) ps prop then tabs else
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   149
              oras_of prf (Symtab.update (name, prop::ps) thms, oras))
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   150
      | oras_of (Oracle (s, prop, _)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   151
          apsnd (OrdList.insert string_term_ord (s, prop))
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   152
      | oras_of (MinProof (thms, _, oras)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   153
          apsnd (OrdList.union string_term_ord oras) #>
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   154
          fold (oras_of o proof_of_min_thm) thms
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   155
      | oras_of _ = I
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   156
  in
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   157
    snd (oras_of prf (Symtab.empty, oras))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   158
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   159
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   160
fun thms_of_proof (Abst (_, _, prf)) = thms_of_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   161
  | thms_of_proof (AbsP (_, _, prf)) = thms_of_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   162
  | thms_of_proof (prf1 %% prf2) = thms_of_proof prf1 #> thms_of_proof prf2
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   163
  | thms_of_proof (prf % _) = thms_of_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   164
  | thms_of_proof (prf' as PThm ((s, _), prf, prop, _)) = (fn tab =>
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   165
      case Symtab.lookup tab s of
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   166
        NONE => thms_of_proof prf (Symtab.update (s, [(prop, prf')]) tab)
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   167
      | SOME ps => if exists (equal prop o fst) ps then tab else
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   168
          thms_of_proof prf (Symtab.update (s, (prop, prf')::ps) tab))
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   169
  | thms_of_proof (MinProof (prfs, _, _)) = fold (thms_of_proof o proof_of_min_thm) prfs
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   170
  | thms_of_proof _ = I;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   171
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   172
fun axms_of_proof (Abst (_, _, prf)) = axms_of_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   173
  | axms_of_proof (AbsP (_, _, prf)) = axms_of_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   174
  | axms_of_proof (prf1 %% prf2) = axms_of_proof prf1 #> axms_of_proof prf2
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   175
  | axms_of_proof (prf % _) = axms_of_proof prf
17412
e26cb20ef0cc TableFun/Symtab: curried lookup and update;
wenzelm
parents: 17325
diff changeset
   176
  | axms_of_proof (prf as PAxm (s, _, _)) = Symtab.update (s, prf)
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   177
  | axms_of_proof (MinProof (_, prfs, _)) = fold (axms_of_proof o proof_of_min_axm) prfs
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   178
  | axms_of_proof _ = I;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   179
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   180
(** collect all theorems, axioms and oracles **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   181
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   182
fun map3 f g h (thms, axms, oras) = (f thms, g axms, h oras);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   183
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   184
fun mk_min_proof (Abst (_, _, prf)) = mk_min_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   185
  | mk_min_proof (AbsP (_, _, prf)) = mk_min_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   186
  | mk_min_proof (prf % _) = mk_min_proof prf
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   187
  | mk_min_proof (prf1 %% prf2) = mk_min_proof prf1 #> mk_min_proof prf2
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   188
  | mk_min_proof (PThm ((s, _), prf, prop, _)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   189
      map3 (OrdList.insert (string_term_ord o pairself fst) ((s, prop), prf)) I I
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   190
  | mk_min_proof (PAxm (s, prop, _)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   191
      map3 I (OrdList.insert string_term_ord (s, prop)) I
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   192
  | mk_min_proof (Oracle (s, prop, _)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   193
      map3 I I (OrdList.insert string_term_ord (s, prop))
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   194
  | mk_min_proof (MinProof (thms, axms, oras)) =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   195
      map3 (OrdList.union (string_term_ord o pairself fst) thms)
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   196
        (OrdList.union string_term_ord axms) (OrdList.union string_term_ord oras)
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   197
  | mk_min_proof _ = I;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   198
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   199
(** proof objects with different levels of detail **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   200
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   201
val proofs = ref 2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   202
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   203
fun err_illegal_level i =
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   204
  error ("Illegal level of detail for proof objects: " ^ string_of_int i);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   205
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   206
fun if_ora b = if b then oracles_of_proof else K;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   207
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   208
fun infer_derivs f (ora1, prf1) (ora2, prf2) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   209
  (ora1 orelse ora2, 
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   210
   case !proofs of
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   211
     2 => f prf1 prf2
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   212
   | 1 => MinProof (([], [], []) |> mk_min_proof prf1 |> mk_min_proof prf2)
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   213
   | 0 => MinProof ([], [], if_ora ora2 (if_ora ora1 [] prf1) prf2)
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
   214
   | i => err_illegal_level i);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   215
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   216
fun infer_derivs' f = infer_derivs (K f) (false, MinProof ([], [], []));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   217
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   218
fun (prf %> t) = prf % SOME t;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   219
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   220
val proof_combt = Library.foldl (op %>);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   221
val proof_combt' = Library.foldl (op %);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   222
val proof_combP = Library.foldl (op %%);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   223
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   224
fun strip_combt prf = 
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   225
    let fun stripc (prf % t, ts) = stripc (prf, t::ts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   226
          | stripc  x =  x 
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   227
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   228
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   229
fun strip_combP prf = 
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   230
    let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   231
          | stripc  x =  x
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   232
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   233
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   234
fun strip_thm prf = (case strip_combt (fst (strip_combP prf)) of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   235
      (PThm (_, prf', _, _), _) => prf'
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   236
    | _ => prf);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   237
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   238
val mk_Abst = foldr (fn ((s, T:typ), prf) => Abst (s, NONE, prf));
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   239
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   240
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   241
fun apsome' f NONE = raise SAME
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   242
  | apsome' f (SOME x) = SOME (f x);
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   243
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   244
fun same f x =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   245
  let val x' = f x
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   246
  in if x = x' then raise SAME else x' end;
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   247
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   248
fun map_proof_terms f g =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   249
  let
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   250
    fun mapp (Abst (s, T, prf)) = (Abst (s, apsome' (same g) T, mapph prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   251
          handle SAME => Abst (s, T, mapp prf))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   252
      | mapp (AbsP (s, t, prf)) = (AbsP (s, apsome' (same f) t, mapph prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   253
          handle SAME => AbsP (s, t, mapp prf))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   254
      | mapp (prf % t) = (mapp prf % Option.map f t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   255
          handle SAME => prf % apsome' (same f) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   256
      | mapp (prf1 %% prf2) = (mapp prf1 %% mapph prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   257
          handle SAME => prf1 %% mapp prf2)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   258
      | mapp (PThm (a, prf, prop, SOME Ts)) =
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   259
          PThm (a, prf, prop, SOME (same (map g) Ts))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   260
      | mapp (PAxm (a, prop, SOME Ts)) =
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   261
          PAxm (a, prop, SOME (same (map g) Ts))
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   262
      | mapp _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   263
    and mapph prf = (mapp prf handle SAME => prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   264
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   265
  in mapph end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   266
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   267
fun fold_proof_terms f g (a, Abst (_, SOME T, prf)) = fold_proof_terms f g (g (T, a), prf)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   268
  | fold_proof_terms f g (a, Abst (_, NONE, prf)) = fold_proof_terms f g (a, prf)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   269
  | fold_proof_terms f g (a, AbsP (_, SOME t, prf)) = fold_proof_terms f g (f (t, a), prf)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   270
  | fold_proof_terms f g (a, AbsP (_, NONE, prf)) = fold_proof_terms f g (a, prf)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   271
  | fold_proof_terms f g (a, prf % SOME t) = f (t, fold_proof_terms f g (a, prf))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   272
  | fold_proof_terms f g (a, prf % NONE) = fold_proof_terms f g (a, prf)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   273
  | fold_proof_terms f g (a, prf1 %% prf2) = fold_proof_terms f g
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   274
      (fold_proof_terms f g (a, prf1), prf2)
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   275
  | fold_proof_terms _ g (a, PThm (_, _, _, SOME Ts)) = foldr g a Ts
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   276
  | fold_proof_terms _ g (a, PAxm (_, prop, SOME Ts)) = foldr g a Ts
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   277
  | fold_proof_terms _ _ (a, _) = a;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   278
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   279
val add_prf_names = fold_proof_terms add_term_names ((uncurry K) o swap);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   280
val add_prf_tfree_names = fold_proof_terms add_term_tfree_names add_typ_tfree_names;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   281
val add_prf_tvar_ixns = fold_proof_terms add_term_tvar_ixns (add_typ_ixns o swap);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   282
12868
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
   283
fun maxidx_of_proof prf = fold_proof_terms
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
   284
  (Int.max o apfst maxidx_of_term) (Int.max o apfst maxidx_of_typ) (~1, prf); 
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
   285
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   286
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf
13749
6844c38d74df size_of_proof no longer includes size_of_term
berghofe
parents: 13744
diff changeset
   287
  | size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   288
  | size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2
13749
6844c38d74df size_of_proof no longer includes size_of_term
berghofe
parents: 13744
diff changeset
   289
  | size_of_proof (prf % _) = 1 + size_of_proof prf
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   290
  | size_of_proof _ = 1;
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   291
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   292
fun change_type opTs (PThm (name, prf, prop, _)) = PThm (name, prf, prop, opTs)
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   293
  | change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs)
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   294
  | change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs)
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   295
  | change_type _ prf = prf;
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   296
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   297
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   298
(***** utilities *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   299
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   300
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   301
  | strip_abs _ t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   302
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   303
fun mk_abs Ts t = Library.foldl (fn (t', T) => Abs ("", T, t')) (t, Ts);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   304
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   305
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   306
(*Abstraction of a proof term over its occurrences of v, 
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   307
    which must contain no loose bound variables.
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   308
  The resulting proof term is ready to become the body of an Abst.*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   309
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   310
fun prf_abstract_over v =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   311
  let
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   312
    fun abst' lev u = if v aconv u then Bound lev else
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   313
      (case u of
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   314
         Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   315
       | f $ t => (abst' lev f $ absth' lev t handle SAME => f $ abst' lev t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   316
       | _ => raise SAME)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   317
    and absth' lev t = (abst' lev t handle SAME => t);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   318
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   319
    fun abst lev (AbsP (a, t, prf)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   320
          (AbsP (a, apsome' (abst' lev) t, absth lev prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   321
           handle SAME => AbsP (a, t, abst lev prf))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   322
      | abst lev (Abst (a, T, prf)) = Abst (a, T, abst (lev + 1) prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   323
      | abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   324
          handle SAME => prf1 %% abst lev prf2)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   325
      | abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   326
          handle SAME => prf % apsome' (abst' lev) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   327
      | abst _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   328
    and absth lev prf = (abst lev prf handle SAME => prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   329
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   330
  in absth 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   331
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   332
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   333
(*increments a proof term's non-local bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   334
  required when moving a proof term within abstractions
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   335
     inc is  increment for bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   336
     lev is  level at which a bound variable is considered 'loose'*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   337
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   338
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   339
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   340
fun prf_incr_bv' incP inct Plev tlev (PBound i) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   341
      if i >= Plev then PBound (i+incP) else raise SAME 
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   342
  | prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   343
      (AbsP (a, apsome' (same (incr_bv' inct tlev)) t,
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   344
         prf_incr_bv incP inct (Plev+1) tlev body) handle SAME =>
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   345
           AbsP (a, t, prf_incr_bv' incP inct (Plev+1) tlev body))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   346
  | prf_incr_bv' incP inct Plev tlev (Abst (a, T, body)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   347
      Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   348
  | prf_incr_bv' incP inct Plev tlev (prf %% prf') = 
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   349
      (prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf'
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   350
       handle SAME => prf %% prf_incr_bv' incP inct Plev tlev prf')
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   351
  | prf_incr_bv' incP inct Plev tlev (prf % t) = 
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   352
      (prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   353
       handle SAME => prf % apsome' (same (incr_bv' inct tlev)) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   354
  | prf_incr_bv' _ _ _ _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   355
and prf_incr_bv incP inct Plev tlev prf =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   356
      (prf_incr_bv' incP inct Plev tlev prf handle SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   357
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   358
fun incr_pboundvars  0 0 prf = prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   359
  | incr_pboundvars incP inct prf = prf_incr_bv incP inct 0 0 prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   360
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   361
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   362
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   363
  | prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   364
  | prf_loose_bvar1 (_ % NONE) _ = true
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   365
  | prf_loose_bvar1 (AbsP (_, SOME t, prf)) k = loose_bvar1 (t, k) orelse prf_loose_bvar1 prf k
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   366
  | prf_loose_bvar1 (AbsP (_, NONE, _)) k = true
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   367
  | prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   368
  | prf_loose_bvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   369
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   370
fun prf_loose_Pbvar1 (PBound i) k = i = k
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   371
  | prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   372
  | prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   373
  | prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   374
  | prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   375
  | prf_loose_Pbvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   376
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   377
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   378
      if i < plev then (is, js) else (insert (op =) (i-plev) is, js)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   379
  | prf_add_loose_bnos plev tlev (prf1 %% prf2) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   380
      prf_add_loose_bnos plev tlev prf2
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   381
        (prf_add_loose_bnos plev tlev prf1 p)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   382
  | prf_add_loose_bnos plev tlev (prf % opt) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   383
      prf_add_loose_bnos plev tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   384
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   385
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   386
  | prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   387
      prf_add_loose_bnos (plev+1) tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   388
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   389
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   390
  | prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   391
      prf_add_loose_bnos plev (tlev+1) prf p
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   392
  | prf_add_loose_bnos _ _ _ _ = ([], []);
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   393
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   394
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   395
(**** substitutions ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   396
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   397
fun del_conflicting_tvars envT T = Term.instantiateT
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   398
  (List.mapPartial (fn ixnS as (_, S) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   399
     (Type.lookup (envT, ixnS); NONE) handle TYPE _ =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   400
        SOME (ixnS, TFree ("'dummy", S))) (typ_tvars T)) T;
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   401
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   402
fun del_conflicting_vars env t = Term.instantiate
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   403
  (List.mapPartial (fn ixnS as (_, S) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   404
     (Type.lookup (type_env env, ixnS); NONE) handle TYPE _ =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   405
        SOME (ixnS, TFree ("'dummy", S))) (term_tvars t),
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   406
   List.mapPartial (fn Var (ixnT as (_, T)) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   407
     (Envir.lookup (env, ixnT); NONE) handle TYPE _ =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   408
        SOME (ixnT, Free ("dummy", T))) (term_vars t)) t;
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   409
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   410
fun norm_proof env =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   411
  let
12497
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   412
    val envT = type_env env;
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   413
    fun msg s = warning ("type conflict in norm_proof:\n" ^ s);
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   414
    fun htype f t = f env t handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   415
      (msg s; f env (del_conflicting_vars env t));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   416
    fun htypeT f T = f envT T handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   417
      (msg s; f envT (del_conflicting_tvars envT T));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   418
    fun htypeTs f Ts = f envT Ts handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   419
      (msg s; f envT (map (del_conflicting_tvars envT) Ts));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   420
    fun norm (Abst (s, T, prf)) = (Abst (s, apsome' (htypeT norm_type_same) T, normh prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   421
          handle SAME => Abst (s, T, norm prf))
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   422
      | norm (AbsP (s, t, prf)) = (AbsP (s, apsome' (htype norm_term_same) t, normh prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   423
          handle SAME => AbsP (s, t, norm prf))
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   424
      | norm (prf % t) = (norm prf % Option.map (htype norm_term) t
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   425
          handle SAME => prf % apsome' (htype norm_term_same) t)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   426
      | norm (prf1 %% prf2) = (norm prf1 %% normh prf2
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   427
          handle SAME => prf1 %% norm prf2)
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   428
      | norm (PThm (s, prf, t, Ts)) = PThm (s, prf, t, apsome' (htypeTs norm_types_same) Ts)
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   429
      | norm (PAxm (s, prop, Ts)) = PAxm (s, prop, apsome' (htypeTs norm_types_same) Ts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   430
      | norm _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   431
    and normh prf = (norm prf handle SAME => prf);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   432
  in normh end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   433
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   434
(***** Remove some types in proof term (to save space) *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   435
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   436
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   437
  | remove_types (t $ u) = remove_types t $ remove_types u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   438
  | remove_types (Const (s, _)) = Const (s, dummyT)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   439
  | remove_types t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   440
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   441
fun remove_types_env (Envir.Envir {iTs, asol, maxidx}) =
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   442
  Envir.Envir {iTs = iTs, asol = Vartab.map (apsnd remove_types) asol,
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   443
    maxidx = maxidx};
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   444
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   445
fun norm_proof' env prf = norm_proof (remove_types_env env) prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   446
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   447
(**** substitution of bound variables ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   448
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   449
fun prf_subst_bounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   450
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   451
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   452
    fun subst' lev (Bound i) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   453
         (if i<lev then raise SAME    (*var is locally bound*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   454
          else  incr_boundvars lev (List.nth (args, i-lev))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   455
                  handle Subscript => Bound (i-n)  (*loose: change it*))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   456
      | subst' lev (Abs (a, T, body)) = Abs (a, T,  subst' (lev+1) body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   457
      | subst' lev (f $ t) = (subst' lev f $ substh' lev t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   458
          handle SAME => f $ subst' lev t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   459
      | subst' _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   460
    and substh' lev t = (subst' lev t handle SAME => t);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   461
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   462
    fun subst lev (AbsP (a, t, body)) = (AbsP (a, apsome' (subst' lev) t, substh lev body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   463
          handle SAME => AbsP (a, t, subst lev body))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   464
      | subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   465
      | subst lev (prf %% prf') = (subst lev prf %% substh lev prf'
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   466
          handle SAME => prf %% subst lev prf')
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   467
      | subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   468
          handle SAME => prf % apsome' (subst' lev) t)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   469
      | subst _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   470
    and substh lev prf = (subst lev prf handle SAME => prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   471
  in case args of [] => prf | _ => substh 0 prf end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   472
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   473
fun prf_subst_pbounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   474
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   475
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   476
    fun subst (PBound i) Plev tlev =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   477
 	 (if i < Plev then raise SAME    (*var is locally bound*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   478
          else incr_pboundvars Plev tlev (List.nth (args, i-Plev))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   479
                 handle Subscript => PBound (i-n)  (*loose: change it*))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   480
      | subst (AbsP (a, t, body)) Plev tlev = AbsP (a, t, subst body (Plev+1) tlev)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   481
      | subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1))
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   482
      | subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   483
          handle SAME => prf %% subst prf' Plev tlev)
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   484
      | subst (prf % t) Plev tlev = subst prf Plev tlev % t
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   485
      | subst  prf _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   486
    and substh prf Plev tlev = (subst prf Plev tlev handle SAME => prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   487
  in case args of [] => prf | _ => substh prf 0 0 end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   488
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   489
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   490
(**** Freezing and thawing of variables in proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   491
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   492
fun frzT names =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   493
  map_type_tvar (fn (ixn, xs) => TFree ((the o AList.lookup (op =) names) ixn, xs));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   494
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   495
fun thawT names =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   496
  map_type_tfree (fn (s, xs) => case AList.lookup (op =) names s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   497
      NONE => TFree (s, xs)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   498
    | SOME ixn => TVar (ixn, xs));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   499
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   500
fun freeze names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   501
      freeze names names' t $ freeze names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   502
  | freeze names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   503
      Abs (s, frzT names' T, freeze names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   504
  | freeze names names' (Const (s, T)) = Const (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   505
  | freeze names names' (Free (s, T)) = Free (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   506
  | freeze names names' (Var (ixn, T)) =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   507
      Free ((the o AList.lookup (op =) names) ixn, frzT names' T)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   508
  | freeze names names' t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   509
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   510
fun thaw names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   511
      thaw names names' t $ thaw names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   512
  | thaw names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   513
      Abs (s, thawT names' T, thaw names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   514
  | thaw names names' (Const (s, T)) = Const (s, thawT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   515
  | thaw names names' (Free (s, T)) = 
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   516
      let val T' = thawT names' T
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   517
      in case AList.lookup (op =) names s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   518
          NONE => Free (s, T')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   519
        | SOME ixn => Var (ixn, T')
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   520
      end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   521
  | thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   522
  | thaw names names' t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   523
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   524
fun freeze_thaw_prf prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   525
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   526
    val (fs, Tfs, vs, Tvs) = fold_proof_terms
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   527
      (fn (t, (fs, Tfs, vs, Tvs)) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   528
         (add_term_frees (t, fs), add_term_tfree_names (t, Tfs),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   529
          add_term_vars (t, vs), add_term_tvar_ixns (t, Tvs)))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   530
      (fn (T, (fs, Tfs, vs, Tvs)) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   531
         (fs, add_typ_tfree_names (T, Tfs),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   532
          vs, add_typ_ixns (Tvs, T)))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   533
            (([], [], [], []), prf);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   534
    val fs' = map (fst o dest_Free) fs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   535
    val vs' = map (fst o dest_Var) vs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   536
    val names = vs' ~~ variantlist (map fst vs', fs');
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   537
    val names' = Tvs ~~ variantlist (map fst Tvs, Tfs);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   538
    val rnames = map swap names;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   539
    val rnames' = map swap names';
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   540
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   541
    (map_proof_terms (freeze names names') (frzT names') prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   542
     map_proof_terms (thaw rnames rnames') (thawT rnames'))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   543
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   544
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   545
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   546
(***** implication introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   547
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   548
fun implies_intr_proof h prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   549
  let
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   550
    fun abshyp i (Hyp t) = if h aconv t then PBound i else raise SAME
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   551
      | abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   552
      | abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i+1) prf)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   553
      | abshyp i (prf % t) = abshyp i prf % t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   554
      | abshyp i (prf1 %% prf2) = (abshyp i prf1 %% abshyph i prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   555
          handle SAME => prf1 %% abshyp i prf2)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   556
      | abshyp _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   557
    and abshyph i prf = (abshyp i prf handle SAME => prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   558
  in
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   559
    AbsP ("H", NONE (*h*), abshyph 0 prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   560
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   561
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   562
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   563
(***** forall introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   564
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   565
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   566
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   567
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   568
(***** varify *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   569
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   570
fun varify_proof t fixed prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   571
  let
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   572
    val fs = add_term_tfrees (t, []) \\ fixed;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   573
    val ixns = add_term_tvar_ixns (t, []);
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   574
    val fmap = fs ~~ variantlist (map fst fs, map #1 ixns)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   575
    fun thaw (f as (a, S)) =
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   576
      (case AList.lookup (op =) fmap f of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   577
        NONE => TFree f
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   578
      | SOME b => TVar ((b, 0), S));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   579
  in map_proof_terms (map_term_types (map_type_tfree thaw)) (map_type_tfree thaw) prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   580
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   581
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   582
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   583
local
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   584
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   585
fun new_name (ix, (pairs,used)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   586
  let val v = variant used (string_of_indexname ix)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   587
  in  ((ix, v) :: pairs, v :: used)  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   588
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   589
fun freeze_one alist (ix, sort) = (case AList.lookup (op =) alist ix of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   590
    NONE => TVar (ix, sort)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   591
  | SOME name => TFree (name, sort));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   592
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   593
in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   594
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   595
fun freezeT t prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   596
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   597
    val used = it_term_types add_typ_tfree_names (t, [])
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   598
    and tvars = map #1 (it_term_types add_typ_tvars (t, []));
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   599
    val (alist, _) = foldr new_name ([], used) tvars;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   600
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   601
    (case alist of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   602
      [] => prf (*nothing to do!*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   603
    | _ =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   604
      let val frzT = map_type_tvar (freeze_one alist)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   605
      in map_proof_terms (map_term_types frzT) frzT prf end)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   606
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   607
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   608
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   609
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   610
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   611
(***** rotate assumptions *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   612
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   613
fun rotate_proof Bs Bi m prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   614
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   615
    val params = Term.strip_all_vars Bi;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   616
    val asms = Logic.strip_imp_prems (Term.strip_all_body Bi);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   617
    val i = length asms;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   618
    val j = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   619
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   620
    mk_AbsP (j+1, proof_combP (prf, map PBound
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   621
      (j downto 1) @ [mk_Abst (mk_AbsP (i,
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   622
        proof_combP (proof_combt (PBound i, map Bound ((length params - 1) downto 0)),
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   623
          map PBound (((i-m-1) downto 0) @ ((i-1) downto (i-m)))))) params]))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   624
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   625
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   626
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   627
(***** permute premises *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   628
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   629
fun permute_prems_prf prems j k prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   630
  let val n = length prems
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   631
  in mk_AbsP (n, proof_combP (prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   632
    map PBound ((n-1 downto n-j) @ (k-1 downto 0) @ (n-j-1 downto k))))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   633
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   634
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   635
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   636
(***** instantiation *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   637
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   638
fun instantiate (instT, inst) prf =
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   639
  map_proof_terms (Term.instantiate (instT, map (apsnd remove_types) inst))
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   640
    (Term.instantiateT instT) prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   641
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   642
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   643
(***** lifting *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   644
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   645
fun lift_proof Bi inc prop prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   646
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   647
    fun lift'' Us Ts t = strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   648
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   649
    fun lift' Us Ts (Abst (s, T, prf)) =
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   650
          (Abst (s, apsome' (same (Logic.incr_tvar inc)) T, lifth' Us (dummyT::Ts) prf)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   651
           handle SAME => Abst (s, T, lift' Us (dummyT::Ts) prf))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   652
      | lift' Us Ts (AbsP (s, t, prf)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   653
          (AbsP (s, apsome' (same (lift'' Us Ts)) t, lifth' Us Ts prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   654
           handle SAME => AbsP (s, t, lift' Us Ts prf))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   655
      | lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   656
          handle SAME => prf % apsome' (same (lift'' Us Ts)) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   657
      | lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   658
          handle SAME => prf1 %% lift' Us Ts prf2)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   659
      | lift' _ _ (PThm (s, prf, prop, Ts)) =
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   660
          PThm (s, prf, prop, apsome' (same (map (Logic.incr_tvar inc))) Ts)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   661
      | lift' _ _ (PAxm (s, prop, Ts)) =
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
   662
          PAxm (s, prop, apsome' (same (map (Logic.incr_tvar inc))) Ts)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   663
      | lift' _ _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   664
    and lifth' Us Ts prf = (lift' Us Ts prf handle SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   665
18030
5dadabde8fe4 Logic.lift_all;
wenzelm
parents: 17756
diff changeset
   666
    val ps = map (Logic.lift_all inc Bi) (Logic.strip_imp_prems prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   667
    val k = length ps;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   668
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   669
    fun mk_app (b, (i, j, prf)) = 
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   670
          if b then (i-1, j, prf %% PBound i) else (i, j-1, prf %> Bound j);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   671
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   672
    fun lift Us bs i j (Const ("==>", _) $ A $ B) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   673
	    AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   674
      | lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) = 
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   675
	    Abst (a, NONE (*T*), lift (T::Us) (false::bs) i (j+1) t)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   676
      | lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf,
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
   677
            map (fn k => (#3 (foldr mk_app (i-1, j-1, PBound k) bs)))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   678
              (i + k - 1 downto i));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   679
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   680
    mk_AbsP (k, lift [] [] 0 0 Bi)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   681
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   682
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   683
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   684
(***** proof by assumption *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   685
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   686
fun mk_asm_prf (Const ("==>", _) $ A $ B) i = AbsP ("H", NONE (*A*), mk_asm_prf B (i+1))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   687
  | mk_asm_prf (Const ("all", _) $ Abs (a, T, t)) i = Abst (a, NONE (*T*), mk_asm_prf t i)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   688
  | mk_asm_prf _ i = PBound i;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   689
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   690
fun assumption_proof Bs Bi n prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   691
  mk_AbsP (length Bs, proof_combP (prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   692
    map PBound (length Bs - 1 downto 0) @ [mk_asm_prf Bi (~n)]));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   693
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   694
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   695
(***** Composition of object rule with proof state *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   696
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   697
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   698
      AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   699
  | flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   700
      Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   701
  | flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   702
      map Bound (j-1 downto 0)), map PBound (i-1 downto 0 \ i-n));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   703
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   704
fun bicompose_proof flatten Bs oldAs newAs A n rprf sprf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   705
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   706
    val la = length newAs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   707
    val lb = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   708
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   709
    mk_AbsP (lb+la, proof_combP (sprf,
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   710
      map PBound (lb + la - 1 downto la)) %%
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   711
        proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) (~n)] else []) @
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   712
          map (if flatten then flatten_params_proof 0 0 n else PBound o snd)
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   713
            (oldAs ~~ (la - 1 downto 0))))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   714
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   715
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   716
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   717
(***** axioms for equality *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   718
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   719
val aT = TFree ("'a", []);
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   720
val bT = TFree ("'b", []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   721
val x = Free ("x", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   722
val y = Free ("y", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   723
val z = Free ("z", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   724
val A = Free ("A", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   725
val B = Free ("B", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   726
val f = Free ("f", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   727
val g = Free ("g", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   728
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   729
local open Logic in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   730
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   731
val equality_axms =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   732
  [("reflexive", mk_equals (x, x)),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   733
   ("symmetric", mk_implies (mk_equals (x, y), mk_equals (y, x))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   734
   ("transitive", list_implies ([mk_equals (x, y), mk_equals (y, z)], mk_equals (x, z))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   735
   ("equal_intr", list_implies ([mk_implies (A, B), mk_implies (B, A)], mk_equals (A, B))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   736
   ("equal_elim", list_implies ([mk_equals (A, B), A], B)),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   737
   ("abstract_rule", Logic.mk_implies
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   738
      (all aT $ Abs ("x", aT, equals bT $ (f $ Bound 0) $ (g $ Bound 0)),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   739
       equals (aT --> bT) $
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   740
         Abs ("x", aT, f $ Bound 0) $ Abs ("x", aT, g $ Bound 0))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   741
   ("combination", Logic.list_implies
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   742
      ([Logic.mk_equals (f, g), Logic.mk_equals (x, y)],
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   743
       Logic.mk_equals (f $ x, g $ y)))];
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   744
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   745
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   746
  equal_elim_axm, abstract_rule_axm, combination_axm] =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   747
    map (fn (s, t) => PAxm ("ProtoPure." ^ s, varify t, NONE)) equality_axms;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   748
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   749
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   750
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   751
val reflexive = reflexive_axm % NONE;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   752
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   753
fun symmetric (prf as PAxm ("ProtoPure.reflexive", _, _) % _) = prf
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   754
  | symmetric prf = symmetric_axm % NONE % NONE %% prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   755
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   756
fun transitive _ _ (PAxm ("ProtoPure.reflexive", _, _) % _) prf2 = prf2
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   757
  | transitive _ _ prf1 (PAxm ("ProtoPure.reflexive", _, _) % _) = prf1
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   758
  | transitive u (Type ("prop", [])) prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   759
      transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   760
  | transitive u T prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   761
      transitive_axm % NONE % NONE % NONE %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   762
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   763
fun abstract_rule x a prf =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   764
  abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   765
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   766
fun check_comb (PAxm ("ProtoPure.combination", _, _) % f % g % _ % _ %% prf %% _) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   767
      isSome f orelse check_comb prf
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   768
  | check_comb (PAxm ("ProtoPure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   769
      check_comb prf1 andalso check_comb prf2
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   770
  | check_comb (PAxm ("ProtoPure.symmetric", _, _) % _ % _ %% prf) = check_comb prf
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   771
  | check_comb _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   772
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   773
fun combination f g t u (Type (_, [T, U])) prf1 prf2 =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   774
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   775
    val f = Envir.beta_norm f;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   776
    val g = Envir.beta_norm g;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   777
    val prf =  if check_comb prf1 then
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   778
        combination_axm % NONE % NONE
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   779
      else (case prf1 of
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   780
          PAxm ("ProtoPure.reflexive", _, _) % _ =>
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   781
            combination_axm %> remove_types f % NONE
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   782
        | _ => combination_axm %> remove_types f %> remove_types g)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   783
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   784
    (case T of
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   785
       Type ("fun", _) => prf %
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   786
         (case head_of f of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   787
            Abs _ => SOME (remove_types t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   788
          | Var _ => SOME (remove_types t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   789
          | _ => NONE) %
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   790
         (case head_of g of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   791
            Abs _ => SOME (remove_types u)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   792
          | Var _ => SOME (remove_types u)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   793
          | _ => NONE) %% prf1 %% prf2
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   794
     | _ => prf % NONE % NONE %% prf1 %% prf2)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   795
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   796
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   797
fun equal_intr A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   798
  equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   799
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   800
fun equal_elim A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   801
  equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   802
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   803
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   804
(***** axioms and theorems *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   805
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   806
fun vars_of t = rev (fold_aterms (fn v as Var _ => insert (op =) v | _ => I) t []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   807
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   808
fun test_args _ [] = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   809
  | test_args is (Bound i :: ts) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   810
      not (member (op =) is i) andalso test_args (i :: is) ts
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   811
  | test_args _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   812
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   813
fun is_fun (Type ("fun", _)) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   814
  | is_fun (TVar _) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   815
  | is_fun _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   816
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   817
fun add_funvars Ts (vs, t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   818
  if is_fun (fastype_of1 (Ts, t)) then
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   819
    vs union List.mapPartial (fn Var (ixn, T) =>
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   820
      if is_fun T then SOME ixn else NONE | _ => NONE) (vars_of t)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   821
  else vs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   822
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   823
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   824
      add_npvars q p Ts (add_npvars q (not p) Ts (vs, t), u)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   825
  | add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   826
      add_npvars q p Ts (vs, if p andalso q then betapply (t, Var (("",0), T)) else t)
12041
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   827
  | add_npvars q p Ts (vs, Abs (_, T, t)) = add_npvars q p (T::Ts) (vs, t)
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   828
  | add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t)
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   829
and add_npvars' Ts (vs, t) = (case strip_comb t of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   830
    (Var (ixn, _), ts) => if test_args [] ts then vs
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   831
      else Library.foldl (add_npvars' Ts)
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   832
        (AList.update (op =) (ixn,
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   833
          Library.foldl (add_funvars Ts) ((these ooo AList.lookup) (op =) vs ixn, ts)) vs, ts)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   834
  | (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts)
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   835
  | (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   836
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   837
fun prop_vars (Const ("==>", _) $ P $ Q) = prop_vars P union prop_vars Q
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   838
  | prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   839
  | prop_vars t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   840
      (Var (ixn, _), _) => [ixn] | _ => []);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   841
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   842
fun is_proj t =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   843
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   844
    fun is_p i t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   845
        (Bound j, []) => false
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   846
      | (Bound j, ts) => j >= i orelse exists (is_p i) ts
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   847
      | (Abs (_, _, u), _) => is_p (i+1) u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   848
      | (_, ts) => exists (is_p i) ts)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   849
  in (case strip_abs_body t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   850
        Bound _ => true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   851
      | t' => is_p 0 t')
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   852
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   853
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   854
fun needed_vars prop = 
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   855
  Library.foldl op union ([], map op ins (add_npvars true true [] ([], prop))) union
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   856
  prop_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   857
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   858
fun gen_axm_proof c name prop =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   859
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   860
    val nvs = needed_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   861
    val args = map (fn (v as Var (ixn, _)) =>
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   862
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
16983
c895701d55ea replaced atless by term_ord;
wenzelm
parents: 16940
diff changeset
   863
      map SOME (sort Term.term_ord (term_frees prop));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   864
  in
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   865
    proof_combt' (c (name, prop, NONE), args)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   866
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   867
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   868
val axm_proof = gen_axm_proof PAxm;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   869
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   870
val dummy = Const (Term.dummy_patternN, dummyT);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   871
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   872
fun oracle_proof name prop =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   873
  if !proofs = 0 then Oracle (name, dummy, NONE)
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   874
  else gen_axm_proof Oracle name prop;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   875
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   876
fun shrink_proof thy =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   877
  let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   878
    val compress_typ = Compress.typ thy;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   879
    val compress_term = Compress.term thy;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   880
  
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   881
    fun shrink ls lev (prf as Abst (a, T, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   882
          let val (b, is, ch, body') = shrink ls (lev+1) body
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   883
          in (b, is, ch, if ch then Abst (a, Option.map compress_typ T, body') else prf) end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   884
      | shrink ls lev (prf as AbsP (a, t, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   885
          let val (b, is, ch, body') = shrink (lev::ls) lev body
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   886
          in (b orelse member (op =) is 0, List.mapPartial (fn 0 => NONE | i => SOME (i-1)) is,
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   887
            ch, if ch then AbsP (a, Option.map compress_term t, body') else prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   888
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   889
      | shrink ls lev prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   890
          let val (is, ch, _, prf') = shrink' ls lev [] [] prf
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   891
          in (false, is, ch, prf') end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   892
    and shrink' ls lev ts prfs (prf as prf1 %% prf2) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   893
          let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   894
            val p as (_, is', ch', prf') = shrink ls lev prf2;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   895
            val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   896
          in (is union is', ch orelse ch', ts',
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   897
              if ch orelse ch' then prf'' %% prf' else prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   898
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   899
      | shrink' ls lev ts prfs (prf as prf1 % t) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   900
          let val (is, ch, (ch', t')::ts', prf') = shrink' ls lev (t::ts) prfs prf1
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   901
          in (is, ch orelse ch', ts',
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   902
              if ch orelse ch' then prf' % Option.map compress_term t' else prf) end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   903
      | shrink' ls lev ts prfs (prf as PBound i) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   904
          (if exists (fn SOME (Bound j) => lev-j <= List.nth (ls, i) | _ => true) ts
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   905
             orelse not (null (duplicates
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   906
               (Library.foldl (fn (js, SOME (Bound j)) => j :: js | (js, _) => js) ([], ts))))
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   907
             orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   908
      | shrink' ls lev ts prfs (Hyp t) = ([], false, map (pair false) ts, Hyp (compress_term t))
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   909
      | shrink' ls lev ts prfs (prf as MinProof _) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   910
          ([], false, map (pair false) ts, prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   911
      | shrink' ls lev ts prfs prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   912
          let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   913
            val prop = (case prf of PThm (_, _, prop, _) => prop | PAxm (_, prop, _) => prop
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   914
              | Oracle (_, prop, _) => prop | _ => error "shrink: proof not in normal form");
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   915
            val vs = vars_of prop;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   916
            val (ts', ts'') = splitAt (length vs, ts)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   917
            val insts = Library.take (length ts', map (fst o dest_Var) vs) ~~ ts';
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   918
            val nvs = Library.foldl (fn (ixns', (ixn, ixns)) =>
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   919
              insert (op =) ixn (case AList.lookup (op =) insts ixn of
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   920
                  SOME (SOME t) => if is_proj t then ixns union ixns' else ixns'
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   921
                | _ => ixns union ixns'))
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   922
                  (needed prop ts'' prfs, add_npvars false true [] ([], prop));
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   923
            val insts' = map
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   924
              (fn (ixn, x as SOME _) => if member (op =) nvs ixn then (false, x) else (true, NONE)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   925
                | (_, x) => (false, x)) insts
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   926
          in ([], false, insts' @ map (pair false) ts'', prf) end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   927
    and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   928
          (if b then map (fst o dest_Var) (vars_of t) else []) union needed u ts prfs
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   929
      | needed (Var (ixn, _)) (_::_) _ = [ixn]
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   930
      | needed _ _ _ = [];
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   931
  in shrink end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   932
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   933
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   934
(**** Simple first order matching functions for terms and proofs ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   935
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   936
exception PMatch;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   937
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   938
(** see pattern.ML **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   939
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   940
fun flt (i: int) = List.filter (fn n => n < i);
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   941
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   942
fun fomatch Ts tymatch j =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   943
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   944
    fun mtch (instsp as (tyinsts, insts)) = fn
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   945
        (Var (ixn, T), t)  =>
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   946
          if j>0 andalso not (null (flt j (loose_bnos t)))
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   947
          then raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   948
          else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))),
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   949
            (ixn, t) :: insts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   950
      | (Free (a, T), Free (b, U)) =>
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   951
	  if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   952
      | (Const (a, T), Const (b, U))  =>
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   953
	  if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   954
      | (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   955
      | (Bound i, Bound j) => if i=j then instsp else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   956
      | _ => raise PMatch
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   957
  in mtch end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   958
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   959
fun match_proof Ts tymatch =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   960
  let
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   961
    fun optmatch _ inst (NONE, _) = inst
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   962
      | optmatch _ _ (SOME _, NONE) = raise PMatch
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   963
      | optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   964
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   965
    fun matcht Ts j (pinst, tinst) (t, u) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   966
      (pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u));
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   967
    fun matchT (pinst, (tyinsts, insts)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   968
      (pinst, (tymatch (tyinsts, K p), insts));
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   969
    fun matchTs inst (Ts, Us) = Library.foldl (uncurry matchT) (inst, Ts ~~ Us);
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   970
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   971
    fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   972
          if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   973
          else (case apfst (flt i) (apsnd (flt j)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   974
                  (prf_add_loose_bnos 0 0 prf ([], []))) of
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   975
              ([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   976
            | ([], _) => if j = 0 then
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   977
                   ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   978
                 else raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   979
            | _ => raise PMatch)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   980
      | mtch Ts i j inst (prf1 % opt1, prf2 % opt2) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   981
          optmatch (matcht Ts j) (mtch Ts i j inst (prf1, prf2)) (opt1, opt2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   982
      | mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   983
          mtch Ts i j (mtch Ts i j inst (prf1, prf1')) (prf2, prf2')
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   984
      | mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   985
          mtch (the_default dummyT opU :: Ts) i (j+1)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   986
            (optmatch matchT inst (opT, opU)) (prf1, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   987
      | mtch Ts i j inst (prf1, Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   988
          mtch (the_default dummyT opU :: Ts) i (j+1) inst
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   989
            (incr_pboundvars 0 1 prf1 %> Bound 0, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   990
      | mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   991
          mtch Ts (i+1) j (optmatch (matcht Ts j) inst (opt, opu)) (prf1, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   992
      | mtch Ts i j inst (prf1, AbsP (_, _, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   993
          mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   994
      | mtch Ts i j inst (PThm ((name1, _), _, prop1, opTs),
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   995
            PThm ((name2, _), _, prop2, opUs)) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   996
          if name1=name2 andalso prop1=prop2 then
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   997
            optmatch matchTs inst (opTs, opUs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   998
          else raise PMatch
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   999
      | mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1000
          if s1=s2 then optmatch matchTs inst (opTs, opUs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1001
          else raise PMatch
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1002
      | mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1003
      | mtch _ _ _ _ _ = raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1004
  in mtch Ts 0 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1005
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1006
fun prf_subst (pinst, (tyinsts, insts)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1007
  let
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
  1008
    val substT = Envir.typ_subst_TVars tyinsts;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1009
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
  1010
    fun subst' lev (t as Var (ixn, _)) = (case AList.lookup (op =) insts ixn of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1011
          NONE => t
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1012
        | SOME u => incr_boundvars lev u)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1013
      | subst' lev (Const (s, T)) = Const (s, substT T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1014
      | subst' lev (Free (s, T)) = Free (s, substT T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1015
      | subst' lev (Abs (a, T, body)) = Abs (a, substT T, subst' (lev+1) body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1016
      | subst' lev (f $ t) = subst' lev f $ subst' lev t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1017
      | subst' _ t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1018
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1019
    fun subst plev tlev (AbsP (a, t, body)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1020
          AbsP (a, Option.map (subst' tlev) t, subst (plev+1) tlev body)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1021
      | subst plev tlev (Abst (a, T, body)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1022
          Abst (a, Option.map substT T, subst plev (tlev+1) body)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1023
      | subst plev tlev (prf %% prf') = subst plev tlev prf %% subst plev tlev prf'
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1024
      | subst plev tlev (prf % t) = subst plev tlev prf % Option.map (subst' tlev) t
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
  1025
      | subst plev tlev (prf as Hyp (Var (ixn, _))) = (case AList.lookup (op =) pinst ixn of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1026
          NONE => prf
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1027
        | SOME prf' => incr_pboundvars plev tlev prf')
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1028
      | subst _ _ (PThm (id, prf, prop, Ts)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1029
          PThm (id, prf, prop, Option.map (map substT) Ts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1030
      | subst _ _ (PAxm (id, prop, Ts)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1031
          PAxm (id, prop, Option.map (map substT) Ts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1032
      | subst _ _ t = t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1033
  in subst 0 0 end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1034
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1035
(*A fast unification filter: true unless the two terms cannot be unified. 
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1036
  Terms must be NORMAL.  Treats all Vars as distinct. *)
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1037
fun could_unify prf1 prf2 =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1038
  let
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1039
    fun matchrands (prf1 %% prf2) (prf1' %% prf2') =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1040
          could_unify prf2 prf2' andalso matchrands prf1 prf1'
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1041
      | matchrands (prf % SOME t) (prf' % SOME t') =
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1042
          Term.could_unify (t, t') andalso matchrands prf prf'
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1043
      | matchrands (prf % _) (prf' % _) = matchrands prf prf'
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1044
      | matchrands _ _ = true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1045
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1046
    fun head_of (prf %% _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1047
      | head_of (prf % _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1048
      | head_of prf = prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1049
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1050
  in case (head_of prf1, head_of prf2) of
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1051
        (_, Hyp (Var _)) => true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1052
      | (Hyp (Var _), _) => true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1053
      | (PThm ((a, _), _, propa, _), PThm ((b, _), _, propb, _)) =>
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1054
          a = b andalso propa = propb andalso matchrands prf1 prf2
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1055
      | (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1056
      | (PBound i, PBound j) =>  i = j andalso matchrands prf1 prf2
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1057
      | (AbsP _, _) =>  true   (*because of possible eta equality*)
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1058
      | (Abst _, _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1059
      | (_, AbsP _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1060
      | (_, Abst _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1061
      | _ => false
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1062
  end;
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1063
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1064
(**** rewriting on proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1065
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1066
val skel0 = PBound 0;
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1067
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1068
fun rewrite_prf tymatch (rules, procs) prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1069
  let
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1070
    fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, skel0)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1071
      | rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, skel0)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1072
      | rew Ts prf = (case get_first (fn (_, r) => r Ts prf) procs of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1073
          SOME prf' => SOME (prf', skel0)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1074
        | NONE => get_first (fn (prf1, prf2) => SOME (prf_subst
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1075
            (match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1076
               handle PMatch => NONE) (List.filter (could_unify prf o fst) rules));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1077
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1078
    fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1079
          if prf_loose_Pbvar1 prf' 0 then rew Ts prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1080
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1081
            let val prf'' = incr_pboundvars (~1) 0 prf'
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1082
            in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1083
      | rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1084
          if prf_loose_bvar1 prf' 0 then rew Ts prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1085
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1086
            let val prf'' = incr_pboundvars 0 (~1) prf'
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1087
            in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1088
      | rew0 Ts prf = rew Ts prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1089
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1090
    fun rew1 _ (Hyp (Var _)) _ = NONE
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1091
      | rew1 Ts skel prf = (case rew2 Ts skel prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1092
          SOME prf1 => (case rew0 Ts prf1 of
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1093
              SOME (prf2, skel') => SOME (getOpt (rew1 Ts skel' prf2, prf2))
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1094
            | NONE => SOME prf1)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1095
        | NONE => (case rew0 Ts prf of
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1096
              SOME (prf1, skel') => SOME (getOpt (rew1 Ts skel' prf1, prf1))
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1097
            | NONE => NONE))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1098
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1099
    and rew2 Ts skel (prf % SOME t) = (case prf of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1100
            Abst (_, _, body) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1101
              let val prf' = prf_subst_bounds [t] body
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1102
              in SOME (getOpt (rew2 Ts skel0 prf', prf')) end
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1103
          | _ => (case rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1104
              SOME prf' => SOME (prf' % SOME t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1105
            | NONE => NONE))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1106
      | rew2 Ts skel (prf % NONE) = Option.map (fn prf' => prf' % NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1107
          (rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf)
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1108
      | rew2 Ts skel (prf1 %% prf2) = (case prf1 of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1109
            AbsP (_, _, body) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1110
              let val prf' = prf_subst_pbounds [prf2] body
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1111
              in SOME (getOpt (rew2 Ts skel0 prf', prf')) end
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1112
          | _ =>
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1113
            let val (skel1, skel2) = (case skel of
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1114
                skel1 %% skel2 => (skel1, skel2)
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1115
              | _ => (skel0, skel0))
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1116
            in case rew1 Ts skel1 prf1 of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1117
                SOME prf1' => (case rew1 Ts skel2 prf2 of
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1118
                    SOME prf2' => SOME (prf1' %% prf2')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1119
                  | NONE => SOME (prf1' %% prf2))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1120
              | NONE => (case rew1 Ts skel2 prf2 of
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1121
                    SOME prf2' => SOME (prf1 %% prf2')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1122
                  | NONE => NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1123
            end)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1124
      | rew2 Ts skel (Abst (s, T, prf)) = (case rew1 (getOpt (T,dummyT) :: Ts)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1125
              (case skel of Abst (_, _, skel') => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1126
            SOME prf' => SOME (Abst (s, T, prf'))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1127
          | NONE => NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1128
      | rew2 Ts skel (AbsP (s, t, prf)) = (case rew1 Ts
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1129
              (case skel of AbsP (_, _, skel') => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1130
            SOME prf' => SOME (AbsP (s, t, prf'))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1131
          | NONE => NONE)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1132
      | rew2 _ _ _ = NONE
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1133
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1134
  in getOpt (rew1 [] skel0 prf, prf) end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1135
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17017
diff changeset
  1136
fun rewrite_proof thy = rewrite_prf (fn (tyenv, f) =>
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17017
diff changeset
  1137
  Sign.typ_match thy (f ()) tyenv handle Type.TYPE_MATCH => raise PMatch);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1138
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
  1139
fun rewrite_proof_notypes rews = rewrite_prf fst rews;
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1140
16940
d14ec6f2d29b adapted Type.typ_match;
wenzelm
parents: 16880
diff changeset
  1141
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1142
(**** theory data ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1143
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1144
structure ProofData = TheoryDataFun
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1145
(struct
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1146
  val name = "Pure/proof";
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1147
  type T = ((proof * proof) list *
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1148
    (string * (typ list -> proof -> proof option)) list);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1149
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1150
  val empty = ([], []);
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1151
  val copy = I;
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1152
  val extend = I;
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1153
  fun merge _ ((rules1, procs1), (rules2, procs2)) =
12293
ce14a4faeded use merge_lists, merge_alists;
wenzelm
parents: 12279
diff changeset
  1154
    (merge_lists rules1 rules2, merge_alists procs1 procs2);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1155
  fun print _ _ = ();
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1156
end);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1157
16536
c5744af6b28a renamed init to init_data;
wenzelm
parents: 16458
diff changeset
  1158
val init_data = ProofData.init;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1159
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1160
fun add_prf_rrules rs thy =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1161
  let val r = ProofData.get thy
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1162
  in ProofData.put (rs @ fst r, snd r) thy end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1163
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1164
fun add_prf_rprocs ps thy =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1165
  let val r = ProofData.get thy
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1166
  in ProofData.put (fst r, ps @ snd r) thy end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1167
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1168
fun thm_proof thy (name, tags) hyps prop prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1169
  let
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1170
    val prop = Logic.list_implies (hyps, prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1171
    val nvs = needed_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1172
    val args = map (fn (v as Var (ixn, _)) =>
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1173
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
16983
c895701d55ea replaced atless by term_ord;
wenzelm
parents: 16940
diff changeset
  1174
      map SOME (sort Term.term_ord (term_frees prop));
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
  1175
    val opt_prf = if ! proofs = 2 then
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1176
        #4 (shrink_proof thy [] 0 (rewrite_prf fst (ProofData.get thy)
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15570
diff changeset
  1177
          (foldr (uncurry implies_intr_proof) prf hyps)))
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
  1178
      else MinProof (mk_min_proof prf ([], [], []));
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1179
    val head = (case strip_combt (fst (strip_combP prf)) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1180
        (PThm ((old_name, _), prf', prop', NONE), args') =>
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1181
          if (old_name="" orelse old_name=name) andalso
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1182
             prop = prop' andalso args = args' then
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1183
            PThm ((name, tags), prf', prop, NONE)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1184
          else
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1185
            PThm ((name, tags), opt_prf, prop, NONE)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1186
      | _ => PThm ((name, tags), opt_prf, prop, NONE))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1187
  in
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1188
    proof_combP (proof_combt' (head, args), map Hyp hyps)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1189
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1190
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1191
fun get_name_tags hyps prop prf =
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1192
  let val prop = Logic.list_implies (hyps, prop) in
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1193
    (case strip_combt (fst (strip_combP prf)) of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1194
      (PThm ((name, tags), _, prop', _), _) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1195
        if prop=prop' then (name, tags) else ("", [])
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1196
    | (PAxm (name, prop', _), _) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1197
        if prop=prop' then (name, []) else ("", [])
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1198
    | _ => ("", []))
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1199
  end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1200
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1201
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1202
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1203
structure BasicProofterm : BASIC_PROOFTERM = Proofterm;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1204
open BasicProofterm;