src/Pure/proofterm.ML
author wenzelm
Sat, 20 Aug 2011 18:11:17 +0200
changeset 44332 e10f6b873f88
parent 44331 aa9c1e9ef2ce
child 44333 cc53ce50f738
permissions -rw-r--r--
tuned future priorities (again);
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
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     2
    Author:     Stefan Berghofer, TU Muenchen
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     3
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     4
LF style proof terms.
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     5
*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     6
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
     7
infix 8 % %% %>;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     8
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     9
signature BASIC_PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    10
sig
32738
15bb09ca0378 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32726
diff changeset
    11
  val proofs: int Unsynchronized.ref
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    12
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    13
  datatype proof =
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    14
     MinProof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    15
   | PBound of int
11519
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
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    18
   | op % of proof * term option
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    19
   | op %% 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
   | PAxm of string * term * typ list option
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
    22
   | OfClass of typ * class
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    23
   | Oracle of string * term * typ list option
28828
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
    24
   | Promise of serial * term * typ list
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
    25
   | PThm of serial * ((string * term * typ list option) * proof_body future)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    26
  and proof_body = PBody of
39687
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
    27
    {oracles: (string * term) Ord_List.T,
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
    28
     thms: (serial * (string * term * proof_body future)) Ord_List.T,
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    29
     proof: proof}
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    30
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
    31
  val %> : proof * term -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    32
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    33
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    34
signature PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    35
sig
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    36
  include BASIC_PROOFTERM
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    37
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
    38
  type oracle = string * term
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
    39
  type pthm = serial * (string * term * proof_body future)
44331
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
    40
  val check_body_thms: proof_body -> proof_body future
32094
89b9210c7506 prefer simultaneous join -- for improved scheduling;
wenzelm
parents: 32057
diff changeset
    41
  val proof_of: proof_body -> proof
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
    42
  val join_proof: proof_body future -> proof
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
    43
  val fold_proof_atoms: bool -> (proof -> 'a -> 'a) -> proof list -> 'a -> 'a
32810
f3466a5645fa back to simple fold_body_thms and fulfill_proof/thm_proof (reverting a900d3cd47cc) -- the cycle check is implicit in the future computation of join_proofs;
wenzelm
parents: 32785
diff changeset
    44
  val fold_body_thms: (string * term * proof_body -> 'a -> 'a) -> proof_body list -> 'a -> 'a
30712
fc9d8b1bf1e0 status_of: simultaneous list;
wenzelm
parents: 30711
diff changeset
    45
  val status_of: proof_body list -> {failed: bool, oracle: bool, unfinished: bool}
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    46
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    47
  val oracle_ord: oracle * oracle -> order
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    48
  val thm_ord: pthm * pthm -> order
39687
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
    49
  val merge_oracles: oracle Ord_List.T -> oracle Ord_List.T -> oracle Ord_List.T
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
    50
  val merge_thms: pthm Ord_List.T -> pthm Ord_List.T -> pthm Ord_List.T
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
    51
  val all_oracles_of: proof_body -> oracle Ord_List.T
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
    52
  val approximate_proof_body: proof -> proof_body
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    53
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    54
  (** primitive operations **)
41698
90597e044e5f clarified Proofterm.proofs_enabled;
wenzelm
parents: 41674
diff changeset
    55
  val proofs_enabled: unit -> bool
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    56
  val proof_combt: proof * term list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    57
  val proof_combt': proof * term option list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    58
  val proof_combP: proof * proof list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    59
  val strip_combt: proof -> proof * term option list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    60
  val strip_combP: proof -> proof * proof list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    61
  val strip_thm: proof_body -> proof_body
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
    62
  val map_proof_same: term Same.operation -> typ Same.operation
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
    63
    -> (typ * class -> proof) -> proof Same.operation
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
    64
  val map_proof_terms_same: term Same.operation -> typ Same.operation -> proof Same.operation
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
    65
  val map_proof_types_same: typ Same.operation -> proof Same.operation
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    66
  val map_proof_terms: (term -> term) -> (typ -> typ) -> proof -> proof
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
    67
  val map_proof_types: (typ -> typ) -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    68
  val fold_proof_terms: (term -> 'a -> 'a) -> (typ -> 'a -> 'a) -> proof -> 'a -> 'a
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    69
  val maxidx_proof: proof -> int -> int
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    70
  val size_of_proof: proof -> int
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    71
  val change_type: typ list option -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    72
  val prf_abstract_over: term -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    73
  val prf_incr_bv: int -> int -> int -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    74
  val incr_pboundvars: int -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    75
  val prf_loose_bvar1: proof -> int -> bool
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    76
  val prf_loose_Pbvar1: proof -> int -> bool
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    77
  val prf_add_loose_bnos: int -> int -> proof -> int list * int list -> int list * int list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    78
  val norm_proof: Envir.env -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    79
  val norm_proof': Envir.env -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    80
  val prf_subst_bounds: term list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    81
  val prf_subst_pbounds: proof list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    82
  val freeze_thaw_prf: proof -> proof * (proof -> proof)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    83
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    84
  (** proof terms for specific inference rules **)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    85
  val implies_intr_proof: term -> proof -> proof
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
    86
  val implies_intr_proof': term -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    87
  val forall_intr_proof: term -> string -> proof -> proof
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
    88
  val forall_intr_proof': term -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    89
  val varify_proof: term -> (string * sort) list -> proof -> proof
36619
deadcd0ec431 renamed Proofterm.freezeT to Proofterm.legacy_freezeT (cf. 88756a5a92fc);
wenzelm
parents: 35851
diff changeset
    90
  val legacy_freezeT: term -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    91
  val rotate_proof: term list -> term -> int -> proof -> proof
36742
6f8bbe9ca8a2 tuned signature;
wenzelm
parents: 36741
diff changeset
    92
  val permute_prems_proof: term list -> int -> int -> proof -> proof
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
    93
  val generalize: string list * string list -> int -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    94
  val instantiate: ((indexname * sort) * typ) list * ((indexname * typ) * term) list
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
    95
    -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    96
  val lift_proof: term -> int -> term -> proof -> proof
32027
9dd548810ed1 tuned incr_indexes;
wenzelm
parents: 32024
diff changeset
    97
  val incr_indexes: int -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    98
  val assumption_proof: term list -> term -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    99
  val bicompose_proof: bool -> term list -> term list -> term list -> term option ->
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   100
    int -> int -> proof -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   101
  val equality_axms: (string * term) list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   102
  val reflexive_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   103
  val symmetric_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   104
  val transitive_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   105
  val equal_intr_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   106
  val equal_elim_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   107
  val abstract_rule_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   108
  val combination_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   109
  val reflexive: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   110
  val symmetric: proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   111
  val transitive: term -> typ -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   112
  val abstract_rule: term -> string -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   113
  val combination: term -> term -> term -> term -> typ -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   114
  val equal_intr: term -> term -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   115
  val equal_elim: term -> term -> proof -> proof -> proof
36621
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   116
  val strip_shyps_proof: Sorts.algebra -> (typ * sort) list -> (typ * sort) list ->
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   117
    sort list -> proof -> proof
36740
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   118
  val classrel_proof: theory -> class * class -> proof
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   119
  val arity_proof: theory -> string * sort list * class -> proof
36741
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   120
  val of_sort_proof: theory -> (typ * class -> proof) -> typ * sort -> proof list
36740
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   121
  val install_axclass_proofs:
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   122
   {classrel_proof: theory -> class * class -> proof,
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   123
    arity_proof: theory -> string * sort list * class -> proof} -> unit
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   124
  val axm_proof: string -> term -> proof
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   125
  val oracle_proof: string -> term -> oracle * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   126
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   127
  (** rewriting on proof terms **)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   128
  val add_prf_rrule: proof * proof -> theory -> theory
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   129
  val add_prf_rproc: (typ list -> term option list -> proof -> (proof * proof) option) -> theory -> theory
33722
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
   130
  val no_skel: proof
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
   131
  val normal_skel: proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   132
  val rewrite_proof: theory -> (proof * proof) list *
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   133
    (typ list -> term option list -> proof -> (proof * proof) option) list -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   134
  val rewrite_proof_notypes: (proof * proof) list *
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   135
    (typ list -> term option list -> proof -> (proof * proof) option) list -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   136
  val rew_proof: theory -> proof -> proof
36877
7699f7fafde7 added Proofterm.get_name variants according to krauss/schropp;
wenzelm
parents: 36742
diff changeset
   137
7699f7fafde7 added Proofterm.get_name variants according to krauss/schropp;
wenzelm
parents: 36742
diff changeset
   138
  val promise_proof: theory -> serial -> term -> proof
7699f7fafde7 added Proofterm.get_name variants according to krauss/schropp;
wenzelm
parents: 36742
diff changeset
   139
  val fulfill_norm_proof: theory -> (serial * proof_body) list -> proof_body -> proof_body
36882
f33760bb8ca0 conditionally unconstrain thm proofs -- loosely based on the version by krauss/schropp;
wenzelm
parents: 36880
diff changeset
   140
  val thm_proof: theory -> string -> sort list -> term list -> term ->
36877
7699f7fafde7 added Proofterm.get_name variants according to krauss/schropp;
wenzelm
parents: 36742
diff changeset
   141
    (serial * proof_body future) list -> proof_body -> pthm * proof
36883
4ed0d72def50 added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents: 36882
diff changeset
   142
  val unconstrain_thm_proof: theory -> sort list -> term ->
4ed0d72def50 added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents: 36882
diff changeset
   143
    (serial * proof_body future) list -> proof_body -> pthm * proof
37297
a1acd424645a always unconstrain thm proofs;
wenzelm
parents: 37251
diff changeset
   144
  val get_name: sort list -> term list -> term -> proof -> string
36877
7699f7fafde7 added Proofterm.get_name variants according to krauss/schropp;
wenzelm
parents: 36742
diff changeset
   145
  val guess_name: proof -> string
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   146
end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   147
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   148
structure Proofterm : PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   149
struct
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   150
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   151
(***** datatype proof *****)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   152
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   153
datatype proof =
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   154
   MinProof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   155
 | PBound of int
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   156
 | Abst of string * typ option * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   157
 | AbsP of string * term option * proof
12497
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   158
 | op % of proof * term option
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   159
 | op %% of proof * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   160
 | Hyp of term
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   161
 | PAxm of string * term * typ list option
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
   162
 | OfClass of typ * class
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   163
 | Oracle of string * term * typ list option
28828
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
   164
 | Promise of serial * term * typ list
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
   165
 | PThm of serial * ((string * term * typ list option) * proof_body future)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   166
and proof_body = PBody of
39687
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   167
  {oracles: (string * term) Ord_List.T,
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   168
   thms: (serial * (string * term * proof_body future)) Ord_List.T,
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   169
   proof: proof};
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   170
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   171
type oracle = string * term;
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
   172
type pthm = serial * (string * term * proof_body future);
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   173
44331
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   174
fun join_thms (thms: pthm list) = ignore (Future.joins (map (#3 o #2) thms));
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   175
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   176
fun check_body_thms (body as PBody {thms, ...}) =
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   177
  (singleton o Future.cond_forks)
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   178
    {name = "Proofterm.check_body_thms", group = NONE,
44332
e10f6b873f88 tuned future priorities (again);
wenzelm
parents: 44331
diff changeset
   179
      deps = map (Future.task_of o #3 o #2) thms, pri = 0, interrupts = true}
44331
aa9c1e9ef2ce clarified fulfill_norm_proof: no join_thms yet;
wenzelm
parents: 44330
diff changeset
   180
    (fn () => (join_thms thms; body));
44303
4e2abb045eac incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm
parents: 44302
diff changeset
   181
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   182
fun proof_of (PBody {proof, ...}) = proof;
32094
89b9210c7506 prefer simultaneous join -- for improved scheduling;
wenzelm
parents: 32057
diff changeset
   183
val join_proof = Future.join #> proof_of;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   184
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   185
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   186
(***** proof atoms *****)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   187
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   188
fun fold_proof_atoms all f =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   189
  let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   190
    fun app (Abst (_, _, prf)) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   191
      | app (AbsP (_, _, prf)) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   192
      | app (prf % _) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   193
      | app (prf1 %% prf2) = app prf1 #> app prf2
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   194
      | app (prf as PThm (i, (_, body))) = (fn (x, seen) =>
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   195
          if Inttab.defined seen i then (x, seen)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   196
          else
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   197
            let val (x', seen') =
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
   198
              (if all then app (join_proof body) else I) (x, Inttab.update (i, ()) seen)
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   199
            in (f prf x', seen') end)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   200
      | app prf = (fn (x, seen) => (f prf x, seen));
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   201
  in fn prfs => fn x => #1 (fold app prfs (x, Inttab.empty)) end;
19357
dade85a75c9f Added alternative version of thms_of_proof that does not recursively
berghofe
parents: 19304
diff changeset
   202
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   203
fun fold_body_thms f =
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   204
  let
32726
a900d3cd47cc fold_body_thms: pass pthm identifier;
wenzelm
parents: 32711
diff changeset
   205
    fun app (PBody {thms, ...}) =
44303
4e2abb045eac incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm
parents: 44302
diff changeset
   206
      tap join_thms thms |> fold (fn (i, (name, prop, body)) => fn (x, seen) =>
32726
a900d3cd47cc fold_body_thms: pass pthm identifier;
wenzelm
parents: 32711
diff changeset
   207
        if Inttab.defined seen i then (x, seen)
32094
89b9210c7506 prefer simultaneous join -- for improved scheduling;
wenzelm
parents: 32057
diff changeset
   208
        else
89b9210c7506 prefer simultaneous join -- for improved scheduling;
wenzelm
parents: 32057
diff changeset
   209
          let
89b9210c7506 prefer simultaneous join -- for improved scheduling;
wenzelm
parents: 32057
diff changeset
   210
            val body' = Future.join body;
32726
a900d3cd47cc fold_body_thms: pass pthm identifier;
wenzelm
parents: 32711
diff changeset
   211
            val (x', seen') = app body' (x, Inttab.update (i, ()) seen);
44303
4e2abb045eac incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm
parents: 44302
diff changeset
   212
          in (f (name, prop, body') x', seen') end);
32726
a900d3cd47cc fold_body_thms: pass pthm identifier;
wenzelm
parents: 32711
diff changeset
   213
  in fn bodies => fn x => #1 (fold app bodies (x, Inttab.empty)) end;
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   214
30712
fc9d8b1bf1e0 status_of: simultaneous list;
wenzelm
parents: 30711
diff changeset
   215
fun status_of bodies =
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   216
  let
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   217
    fun status (PBody {oracles, thms, ...}) x =
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   218
      let
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   219
        val ((oracle, unfinished, failed), seen) =
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   220
          (thms, x) |-> fold (fn (i, (_, _, body)) => fn (st, seen) =>
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   221
            if Inttab.defined seen i then (st, seen)
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   222
            else
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   223
              let val seen' = Inttab.update (i, ()) seen in
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   224
                (case Future.peek body of
43761
e72ba84ae58f tuned signature -- corresponding to Scala version;
wenzelm
parents: 43329
diff changeset
   225
                  SOME (Exn.Res body') => status body' (st, seen')
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   226
                | SOME (Exn.Exn _) =>
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   227
                    let val (oracle, unfinished, _) = st
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   228
                    in ((oracle, unfinished, true), seen') end
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   229
                | NONE =>
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   230
                    let val (oracle, _, failed) = st
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   231
                    in ((oracle, true, failed), seen') end)
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   232
              end);
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   233
      in ((oracle orelse not (null oracles), unfinished, failed), seen) end;
32057
wenzelm
parents: 32054
diff changeset
   234
    val (oracle, unfinished, failed) =
wenzelm
parents: 32054
diff changeset
   235
      #1 (fold status bodies ((false, false, false), Inttab.empty));
30711
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   236
  in {oracle = oracle, unfinished = unfinished, failed = failed} end;
952fdbee1b48 display derivation status of thms;
wenzelm
parents: 30146
diff changeset
   237
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   238
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   239
(* proof body *)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   240
35408
b48ab741683b modernized structure Term_Ord;
wenzelm
parents: 33957
diff changeset
   241
val oracle_ord = prod_ord fast_string_ord Term_Ord.fast_term_ord;
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   242
fun thm_ord ((i, _): pthm, (j, _)) = int_ord (j, i);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   243
39687
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   244
val merge_oracles = Ord_List.union oracle_ord;
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   245
val merge_thms = Ord_List.union thm_ord;
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   246
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   247
val all_oracles_of =
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   248
  let
32057
wenzelm
parents: 32054
diff changeset
   249
    fun collect (PBody {oracles, thms, ...}) =
44303
4e2abb045eac incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm
parents: 44302
diff changeset
   250
      tap join_thms thms |> fold (fn (i, (_, _, body)) => fn (x, seen) =>
32057
wenzelm
parents: 32054
diff changeset
   251
        if Inttab.defined seen i then (x, seen)
wenzelm
parents: 32054
diff changeset
   252
        else
wenzelm
parents: 32054
diff changeset
   253
          let
wenzelm
parents: 32054
diff changeset
   254
            val body' = Future.join body;
wenzelm
parents: 32054
diff changeset
   255
            val (x', seen') = collect body' (x, Inttab.update (i, ()) seen);
44303
4e2abb045eac incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm
parents: 44302
diff changeset
   256
          in (merge_oracles oracles x', seen') end);
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   257
  in fn body => #1 (collect body ([], Inttab.empty)) end;
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   258
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   259
fun approximate_proof_body prf =
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   260
  let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   261
    val (oracles, thms) = fold_proof_atoms false
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   262
      (fn Oracle (s, prop, _) => apfst (cons (s, prop))
28815
80bb72a0f577 proof_body/pthm: removed redundant types field;
wenzelm
parents: 28812
diff changeset
   263
        | PThm (i, ((name, prop, _), body)) => apsnd (cons (i, (name, prop, body)))
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   264
        | _ => I) [prf] ([], []);
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   265
  in
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   266
    PBody
39687
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   267
     {oracles = Ord_List.make oracle_ord oracles,
4e9b6ada3a21 modernized structure Ord_List;
wenzelm
parents: 39020
diff changeset
   268
      thms = Ord_List.make thm_ord thms,
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   269
      proof = prf}
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
   270
  end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   271
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   272
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   273
(***** proof objects with different levels of detail *****)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   274
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   275
fun (prf %> t) = prf % SOME t;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   276
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   277
val proof_combt = Library.foldl (op %>);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   278
val proof_combt' = Library.foldl (op %);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   279
val proof_combP = Library.foldl (op %%);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   280
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   281
fun strip_combt prf =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   282
    let fun stripc (prf % t, ts) = stripc (prf, t::ts)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   283
          | stripc  x =  x
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   284
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   285
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   286
fun strip_combP prf =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   287
    let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   288
          | stripc  x =  x
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   289
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   290
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   291
fun strip_thm (body as PBody {proof, ...}) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   292
  (case strip_combt (fst (strip_combP proof)) of
29635
31d14e9fa0da proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents: 29270
diff changeset
   293
    (PThm (_, (_, body')), _) => Future.join body'
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   294
  | _ => body);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   295
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   296
val mk_Abst = fold_rev (fn (s, T:typ) => fn prf => Abst (s, NONE, prf));
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   297
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
   298
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   299
fun map_proof_same term typ ofclass =
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   300
  let
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   301
    val typs = Same.map typ;
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   302
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   303
    fun proof (Abst (s, T, prf)) =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   304
          (Abst (s, Same.map_option typ T, Same.commit proof prf)
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   305
            handle Same.SAME => Abst (s, T, proof prf))
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   306
      | proof (AbsP (s, t, prf)) =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   307
          (AbsP (s, Same.map_option term t, Same.commit proof prf)
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   308
            handle Same.SAME => AbsP (s, t, proof prf))
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   309
      | proof (prf % t) =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   310
          (proof prf % Same.commit (Same.map_option term) t
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   311
            handle Same.SAME => prf % Same.map_option term t)
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   312
      | proof (prf1 %% prf2) =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   313
          (proof prf1 %% Same.commit proof prf2
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   314
            handle Same.SAME => prf1 %% proof prf2)
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   315
      | proof (PAxm (a, prop, SOME Ts)) = PAxm (a, prop, SOME (typs Ts))
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   316
      | proof (OfClass T_c) = ofclass T_c
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   317
      | proof (Oracle (a, prop, SOME Ts)) = Oracle (a, prop, SOME (typs Ts))
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   318
      | proof (Promise (i, prop, Ts)) = Promise (i, prop, typs Ts)
32057
wenzelm
parents: 32054
diff changeset
   319
      | proof (PThm (i, ((a, prop, SOME Ts), body))) =
wenzelm
parents: 32054
diff changeset
   320
          PThm (i, ((a, prop, SOME (typs Ts)), body))
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   321
      | proof _ = raise Same.SAME;
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   322
  in proof end;
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   323
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   324
fun map_proof_terms_same term typ = map_proof_same term typ (fn (T, c) => OfClass (typ T, c));
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   325
fun map_proof_types_same typ = map_proof_terms_same (Term_Subst.map_types_same typ) typ;
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   326
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   327
fun same eq f x =
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   328
  let val x' = f x
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   329
  in if eq (x, x') then raise Same.SAME else x' end;
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   330
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   331
fun map_proof_terms f g = Same.commit (map_proof_terms_same (same (op =) f) (same (op =) g));
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   332
fun map_proof_types f = Same.commit (map_proof_types_same (same (op =) f));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   333
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   334
fun fold_proof_terms f g (Abst (_, SOME T, prf)) = g T #> fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   335
  | fold_proof_terms f g (Abst (_, NONE, prf)) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   336
  | fold_proof_terms f g (AbsP (_, SOME t, prf)) = f t #> fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   337
  | fold_proof_terms f g (AbsP (_, NONE, prf)) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   338
  | fold_proof_terms f g (prf % SOME t) = fold_proof_terms f g prf #> f t
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   339
  | fold_proof_terms f g (prf % NONE) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   340
  | fold_proof_terms f g (prf1 %% prf2) =
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   341
      fold_proof_terms f g prf1 #> fold_proof_terms f g prf2
20159
wenzelm
parents: 20147
diff changeset
   342
  | fold_proof_terms _ g (PAxm (_, _, SOME Ts)) = fold g Ts
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
   343
  | fold_proof_terms _ g (OfClass (T, _)) = g T
28828
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
   344
  | fold_proof_terms _ g (Oracle (_, _, SOME Ts)) = fold g Ts
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
   345
  | fold_proof_terms _ g (Promise (_, _, Ts)) = fold g Ts
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   346
  | fold_proof_terms _ g (PThm (_, ((_, _, SOME Ts), _))) = fold g Ts
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   347
  | fold_proof_terms _ _ _ = I;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   348
20300
963bf056e8f7 replaced maxidx_of_proof by maxidx_proof;
wenzelm
parents: 20159
diff changeset
   349
fun maxidx_proof prf = fold_proof_terms Term.maxidx_term Term.maxidx_typ prf;
12868
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
   350
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   351
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
   352
  | size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   353
  | size_of_proof (prf % _) = 1 + size_of_proof prf
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   354
  | size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   355
  | size_of_proof _ = 1;
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   356
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   357
fun change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs)
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
   358
  | change_type (SOME [T]) (OfClass (_, c)) = OfClass (T, c)
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   359
  | change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs)
36879
201a4afd8533 raise Fail uniformly for proofterm errors, which appear to be rather low-level;
wenzelm
parents: 36878
diff changeset
   360
  | change_type opTs (Promise _) = raise Fail "change_type: unexpected promise"
32057
wenzelm
parents: 32054
diff changeset
   361
  | change_type opTs (PThm (i, ((name, prop, _), body))) =
wenzelm
parents: 32054
diff changeset
   362
      PThm (i, ((name, prop, opTs), body))
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   363
  | change_type _ prf = prf;
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   364
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   365
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   366
(***** utilities *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   367
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   368
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   369
  | strip_abs _ t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   370
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   371
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
   372
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   373
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   374
(*Abstraction of a proof term over its occurrences of v,
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   375
    which must contain no loose bound variables.
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   376
  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
   377
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   378
fun prf_abstract_over v =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   379
  let
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   380
    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
   381
      (case u of
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   382
         Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   383
       | f $ t => (abst' lev f $ absth' lev t handle Same.SAME => f $ abst' lev t)
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   384
       | _ => raise Same.SAME)
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   385
    and absth' lev t = (abst' lev t handle Same.SAME => t);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   386
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   387
    fun abst lev (AbsP (a, t, prf)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   388
          (AbsP (a, Same.map_option (abst' lev) t, absth lev prf)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   389
           handle Same.SAME => AbsP (a, t, abst lev prf))
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   390
      | 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
   391
      | abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   392
          handle Same.SAME => prf1 %% abst lev prf2)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   393
      | abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   394
          handle Same.SAME => prf % Same.map_option (abst' lev) t)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   395
      | abst _ _ = raise Same.SAME
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   396
    and absth lev prf = (abst lev prf handle Same.SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   397
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   398
  in absth 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   399
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   400
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   401
(*increments a proof term's non-local bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   402
  required when moving a proof term within abstractions
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   403
     inc is  increment for bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   404
     lev is  level at which a bound variable is considered 'loose'*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   405
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   406
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   407
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   408
fun prf_incr_bv' incP inct Plev tlev (PBound i) =
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   409
      if i >= Plev then PBound (i+incP) else raise Same.SAME
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   410
  | prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   411
      (AbsP (a, Same.map_option (same (op =) (incr_bv' inct tlev)) t,
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   412
         prf_incr_bv incP inct (Plev+1) tlev body) handle Same.SAME =>
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   413
           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
   414
  | 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
   415
      Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   416
  | prf_incr_bv' incP inct Plev tlev (prf %% prf') =
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   417
      (prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf'
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   418
       handle Same.SAME => prf %% prf_incr_bv' incP inct Plev tlev prf')
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   419
  | prf_incr_bv' incP inct Plev tlev (prf % t) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   420
      (prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   421
       handle Same.SAME => prf % Same.map_option (same (op =) (incr_bv' inct tlev)) t)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   422
  | prf_incr_bv' _ _ _ _ _ = raise Same.SAME
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   423
and prf_incr_bv incP inct Plev tlev prf =
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   424
      (prf_incr_bv' incP inct Plev tlev prf handle Same.SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   425
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   426
fun incr_pboundvars  0 0 prf = prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   427
  | 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
   428
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   429
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   430
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
   431
  | 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
   432
  | prf_loose_bvar1 (_ % NONE) _ = true
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   433
  | 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
   434
  | prf_loose_bvar1 (AbsP (_, NONE, _)) k = true
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   435
  | prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   436
  | prf_loose_bvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   437
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   438
fun prf_loose_Pbvar1 (PBound i) k = i = k
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   439
  | 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
   440
  | prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   441
  | prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   442
  | prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   443
  | prf_loose_Pbvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   444
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   445
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   446
      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
   447
  | prf_add_loose_bnos plev tlev (prf1 %% prf2) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   448
      prf_add_loose_bnos plev tlev prf2
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   449
        (prf_add_loose_bnos plev tlev prf1 p)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   450
  | prf_add_loose_bnos plev tlev (prf % opt) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   451
      prf_add_loose_bnos plev tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   452
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   453
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   454
  | prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   455
      prf_add_loose_bnos (plev+1) tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   456
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   457
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   458
  | prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   459
      prf_add_loose_bnos plev (tlev+1) prf p
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   460
  | prf_add_loose_bnos _ _ _ _ = ([], []);
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   461
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   462
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   463
(**** substitutions ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   464
31977
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31943
diff changeset
   465
fun del_conflicting_tvars envT T = Term_Subst.instantiateT
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   466
  (map_filter (fn ixnS as (_, S) =>
26328
b2d6f520172c Type.lookup now curried
haftmann
parents: 23780
diff changeset
   467
     (Type.lookup envT ixnS; NONE) handle TYPE _ =>
44118
69e29cf993c0 avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44116
diff changeset
   468
        SOME (ixnS, TFree ("'dummy", S))) (Term.add_tvarsT T [])) T;
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   469
31977
e03059ae2d82 renamed structure TermSubst to Term_Subst;
wenzelm
parents: 31943
diff changeset
   470
fun del_conflicting_vars env t = Term_Subst.instantiate
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   471
  (map_filter (fn ixnS as (_, S) =>
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   472
     (Type.lookup (Envir.type_env env) ixnS; NONE) handle TYPE _ =>
44118
69e29cf993c0 avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44116
diff changeset
   473
        SOME (ixnS, TFree ("'dummy", S))) (Term.add_tvars t []),
69e29cf993c0 avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44116
diff changeset
   474
   map_filter (fn (ixnT as (_, T)) =>
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   475
     (Envir.lookup (env, ixnT); NONE) handle TYPE _ =>
44118
69e29cf993c0 avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44116
diff changeset
   476
        SOME (ixnT, Free ("dummy", T))) (Term.add_vars t [])) t;
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   477
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   478
fun norm_proof env =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   479
  let
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   480
    val envT = Envir.type_env env;
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   481
    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
   482
    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
   483
      (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
   484
    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
   485
      (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
   486
    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
   487
      (msg s; f envT (map (del_conflicting_tvars envT) Ts));
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   488
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   489
    fun norm (Abst (s, T, prf)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   490
          (Abst (s, Same.map_option (htypeT Envir.norm_type_same) T, Same.commit norm prf)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   491
            handle Same.SAME => Abst (s, T, norm prf))
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   492
      | norm (AbsP (s, t, prf)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   493
          (AbsP (s, Same.map_option (htype Envir.norm_term_same) t, Same.commit norm prf)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   494
            handle Same.SAME => AbsP (s, t, norm prf))
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   495
      | norm (prf % t) =
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   496
          (norm prf % Option.map (htype Envir.norm_term) t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   497
            handle Same.SAME => prf % Same.map_option (htype Envir.norm_term_same) t)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   498
      | norm (prf1 %% prf2) =
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   499
          (norm prf1 %% Same.commit norm prf2
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   500
            handle Same.SAME => prf1 %% norm prf2)
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   501
      | norm (PAxm (s, prop, Ts)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   502
          PAxm (s, prop, Same.map_option (htypeTs Envir.norm_types_same) Ts)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   503
      | norm (OfClass (T, c)) =
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   504
          OfClass (htypeT Envir.norm_type_same T, c)
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   505
      | norm (Oracle (s, prop, Ts)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   506
          Oracle (s, prop, Same.map_option (htypeTs Envir.norm_types_same) Ts)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   507
      | norm (Promise (i, prop, Ts)) =
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   508
          Promise (i, prop, htypeTs Envir.norm_types_same Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   509
      | norm (PThm (i, ((s, t, Ts), body))) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   510
          PThm (i, ((s, t, Same.map_option (htypeTs Envir.norm_types_same) Ts), body))
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   511
      | norm _ = raise Same.SAME;
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   512
  in Same.commit norm end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   513
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   514
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   515
(***** Remove some types in proof term (to save space) *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   516
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   517
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   518
  | remove_types (t $ u) = remove_types t $ remove_types u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   519
  | remove_types (Const (s, _)) = Const (s, dummyT)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   520
  | remove_types t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   521
32032
a6a6e8031c14 tuned/modernized Envir operations;
wenzelm
parents: 32027
diff changeset
   522
fun remove_types_env (Envir.Envir {maxidx, tenv, tyenv}) =
39020
ac0f24f850c9 replaced Table.map' by Table.map
haftmann
parents: 37297
diff changeset
   523
  Envir.Envir {maxidx = maxidx, tenv = Vartab.map (K (apsnd remove_types)) tenv, tyenv = tyenv};
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   524
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   525
fun norm_proof' env prf = norm_proof (remove_types_env env) prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   526
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   527
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   528
(**** substitution of bound variables ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   529
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   530
fun prf_subst_bounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   531
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   532
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   533
    fun subst' lev (Bound i) =
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   534
         (if i<lev then raise Same.SAME    (*var is locally bound*)
30146
a77fc0209723 eliminated NJ's List.nth;
wenzelm
parents: 29642
diff changeset
   535
          else  incr_boundvars lev (nth args (i-lev))
43278
1fbdcebb364b more robust exception pattern General.Subscript;
wenzelm
parents: 41699
diff changeset
   536
                  handle General.Subscript => Bound (i-n))  (*loose: change it*)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   537
      | 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
   538
      | subst' lev (f $ t) = (subst' lev f $ substh' lev t
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   539
          handle Same.SAME => f $ subst' lev t)
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   540
      | subst' _ _ = raise Same.SAME
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   541
    and substh' lev t = (subst' lev t handle Same.SAME => t);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   542
32057
wenzelm
parents: 32054
diff changeset
   543
    fun subst lev (AbsP (a, t, body)) =
wenzelm
parents: 32054
diff changeset
   544
        (AbsP (a, Same.map_option (subst' lev) t, substh lev body)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   545
          handle Same.SAME => AbsP (a, t, subst lev body))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   546
      | subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   547
      | subst lev (prf %% prf') = (subst lev prf %% substh lev prf'
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   548
          handle Same.SAME => prf %% subst lev prf')
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   549
      | subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   550
          handle Same.SAME => prf % Same.map_option (subst' lev) t)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   551
      | subst _ _ = raise Same.SAME
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   552
    and substh lev prf = (subst lev prf handle Same.SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   553
  in case args of [] => prf | _ => substh 0 prf end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   554
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   555
fun prf_subst_pbounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   556
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   557
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   558
    fun subst (PBound i) Plev tlev =
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   559
         (if i < Plev then raise Same.SAME    (*var is locally bound*)
30146
a77fc0209723 eliminated NJ's List.nth;
wenzelm
parents: 29642
diff changeset
   560
          else incr_pboundvars Plev tlev (nth args (i-Plev))
43278
1fbdcebb364b more robust exception pattern General.Subscript;
wenzelm
parents: 41699
diff changeset
   561
                 handle General.Subscript => PBound (i-n)  (*loose: change it*))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   562
      | 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
   563
      | subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1))
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   564
      | subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   565
          handle Same.SAME => prf %% subst prf' Plev tlev)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   566
      | subst (prf % t) Plev tlev = subst prf Plev tlev % t
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   567
      | subst  prf _ _ = raise Same.SAME
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   568
    and substh prf Plev tlev = (subst prf Plev tlev handle Same.SAME => prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   569
  in case args of [] => prf | _ => substh prf 0 0 end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   570
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   571
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   572
(**** Freezing and thawing of variables in proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   573
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   574
local
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   575
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   576
fun frzT names =
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   577
  map_type_tvar (fn (ixn, S) => TFree (the (AList.lookup (op =) names ixn), S));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   578
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   579
fun thawT names =
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   580
  map_type_tfree (fn (a, S) =>
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   581
    (case AList.lookup (op =) names a of
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   582
      NONE => TFree (a, S)
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   583
    | SOME ixn => TVar (ixn, S)));
11519
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 freeze names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   586
      freeze names names' t $ freeze names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   587
  | freeze names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   588
      Abs (s, frzT names' T, freeze names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   589
  | freeze names names' (Const (s, T)) = Const (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   590
  | freeze names names' (Free (s, T)) = Free (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   591
  | freeze names names' (Var (ixn, T)) =
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   592
      Free (the (AList.lookup (op =) names ixn), frzT names' T)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   593
  | freeze names names' t = t;
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 thaw names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   596
      thaw names names' t $ thaw names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   597
  | thaw names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   598
      Abs (s, thawT names' T, thaw names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   599
  | thaw names names' (Const (s, T)) = Const (s, thawT names' T)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   600
  | thaw names names' (Free (s, T)) =
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   601
      let val T' = thawT names' T in
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   602
        (case AList.lookup (op =) names s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   603
          NONE => Free (s, T')
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   604
        | SOME ixn => Var (ixn, T'))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   605
      end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   606
  | thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   607
  | thaw names names' t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   608
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   609
in
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   610
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   611
fun freeze_thaw_prf prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   612
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   613
    val (fs, Tfs, vs, Tvs) = fold_proof_terms
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   614
      (fn t => fn (fs, Tfs, vs, Tvs) =>
29261
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   615
         (Term.add_free_names t fs, Term.add_tfree_names t Tfs,
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   616
          Term.add_var_names t vs, Term.add_tvar_names t Tvs))
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   617
      (fn T => fn (fs, Tfs, vs, Tvs) =>
29261
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   618
         (fs, Term.add_tfree_namesT T Tfs,
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   619
          vs, Term.add_tvar_namesT T Tvs))
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   620
      prf ([], [], [], []);
29261
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   621
    val names = vs ~~ Name.variant_list fs (map fst vs);
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20000
diff changeset
   622
    val names' = Tvs ~~ Name.variant_list Tfs (map fst Tvs);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   623
    val rnames = map swap names;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   624
    val rnames' = map swap names';
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   625
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   626
    (map_proof_terms (freeze names names') (frzT names') prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   627
     map_proof_terms (thaw rnames rnames') (thawT rnames'))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   628
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   629
44101
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   630
end;
202d2f56560c misc tuning and clarification;
wenzelm
parents: 44100
diff changeset
   631
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   632
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   633
(***** implication introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   634
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   635
fun gen_implies_intr_proof f h prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   636
  let
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   637
    fun abshyp i (Hyp t) = if h aconv t then PBound i else raise Same.SAME
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   638
      | abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf)
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   639
      | abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i + 1) prf)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   640
      | abshyp i (prf % t) = abshyp i prf % t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   641
      | abshyp i (prf1 %% prf2) =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   642
          (abshyp i prf1 %% abshyph i prf2
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   643
            handle Same.SAME => prf1 %% abshyp i prf2)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   644
      | abshyp _ _ = raise Same.SAME
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   645
    and abshyph i prf = (abshyp i prf handle Same.SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   646
  in
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   647
    AbsP ("H", f h, abshyph 0 prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   648
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   649
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   650
val implies_intr_proof = gen_implies_intr_proof (K NONE);
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   651
val implies_intr_proof' = gen_implies_intr_proof SOME;
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   652
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   653
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   654
(***** forall introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   655
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   656
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
   657
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   658
fun forall_intr_proof' t prf =
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   659
  let val (a, T) = (case t of Var ((a, _), T) => (a, T) | Free p => p)
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   660
  in Abst (a, SOME T, prf_abstract_over t prf) end;
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
   661
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   662
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   663
(***** varify *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   664
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   665
fun varify_proof t fixed prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   666
  let
19304
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   667
    val fs = Term.fold_types (Term.fold_atyps
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   668
      (fn TFree v => if member (op =) fixed v then I else insert (op =) v | _ => I)) t [];
29261
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   669
    val used = Name.context
7ee78cc8ef2c freeze_thaw: canonical Term.add_XXX operations;
wenzelm
parents: 28971
diff changeset
   670
      |> fold_types (fold_atyps (fn TVar ((a, _), _) => Name.declare a | _ => I)) t;
43326
47cf4bc789aa simplified Name.variant -- discontinued builtin fold_map;
wenzelm
parents: 43324
diff changeset
   671
    val fmap = fs ~~ #1 (fold_map Name.variant (map fst fs) used);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   672
    fun thaw (f as (a, S)) =
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   673
      (case AList.lookup (op =) fmap f of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   674
        NONE => TFree f
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   675
      | SOME b => TVar ((b, 0), S));
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   676
  in map_proof_terms (map_types (map_type_tfree thaw)) (map_type_tfree thaw) prf end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   677
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   678
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   679
local
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   680
44116
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   681
fun new_name ix (pairs, used) =
43324
2b47822868e4 discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents: 43278
diff changeset
   682
  let val v = singleton (Name.variant_list used) (string_of_indexname ix)
44116
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   683
  in ((ix, v) :: pairs, v :: used) end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   684
44116
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   685
fun freeze_one alist (ix, sort) =
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   686
  (case AList.lookup (op =) alist ix of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   687
    NONE => TVar (ix, sort)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   688
  | SOME name => TFree (name, sort));
11519
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
in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   691
36619
deadcd0ec431 renamed Proofterm.freezeT to Proofterm.legacy_freezeT (cf. 88756a5a92fc);
wenzelm
parents: 35851
diff changeset
   692
fun legacy_freezeT t prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   693
  let
44116
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   694
    val used = Term.add_tfree_names t [];
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   695
    val (alist, _) = fold_rev new_name (map #1 (Term.add_tvars t [])) ([], used);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   696
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   697
    (case alist of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   698
      [] => prf (*nothing to do!*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   699
    | _ =>
44116
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   700
        let val frzT = map_type_tvar (freeze_one alist)
c70257b4cb7e avoid OldTerm operations -- with subtle changes of semantics;
wenzelm
parents: 44113
diff changeset
   701
        in map_proof_terms (map_types frzT) frzT prf end)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   702
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   703
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   704
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   705
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   706
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   707
(***** rotate assumptions *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   708
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   709
fun rotate_proof Bs Bi m prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   710
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   711
    val params = Term.strip_all_vars Bi;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   712
    val asms = Logic.strip_imp_prems (Term.strip_all_body Bi);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   713
    val i = length asms;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   714
    val j = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   715
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   716
    mk_AbsP (j+1, proof_combP (prf, map PBound
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   717
      (j downto 1) @ [mk_Abst params (mk_AbsP (i,
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   718
        proof_combP (proof_combt (PBound i, map Bound ((length params - 1) downto 0)),
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   719
          map PBound (((i-m-1) downto 0) @ ((i-1) downto (i-m))))))]))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   720
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   721
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   722
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   723
(***** permute premises *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   724
36742
6f8bbe9ca8a2 tuned signature;
wenzelm
parents: 36741
diff changeset
   725
fun permute_prems_proof prems j k prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   726
  let val n = length prems
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   727
  in mk_AbsP (n, proof_combP (prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   728
    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
   729
  end;
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
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   732
(***** generalization *****)
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   733
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   734
fun generalize (tfrees, frees) idx =
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   735
  Same.commit (map_proof_terms_same
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   736
    (Term_Subst.generalize_same (tfrees, frees) idx)
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   737
    (Term_Subst.generalizeT_same tfrees idx));
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   738
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   739
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   740
(***** instantiation *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   741
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   742
fun instantiate (instT, inst) =
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   743
  Same.commit (map_proof_terms_same
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   744
    (Term_Subst.instantiate_same (instT, map (apsnd remove_types) inst))
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   745
    (Term_Subst.instantiateT_same instT));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   746
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   747
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   748
(***** lifting *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   749
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   750
fun lift_proof Bi inc prop prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   751
  let
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   752
    fun lift'' Us Ts t =
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   753
      strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   754
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   755
    fun lift' Us Ts (Abst (s, T, prf)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   756
          (Abst (s, Same.map_option (Logic.incr_tvar_same inc) T, lifth' Us (dummyT::Ts) prf)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   757
           handle Same.SAME => Abst (s, T, lift' Us (dummyT::Ts) prf))
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   758
      | lift' Us Ts (AbsP (s, t, prf)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   759
          (AbsP (s, Same.map_option (same (op =) (lift'' Us Ts)) t, lifth' Us Ts prf)
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   760
           handle Same.SAME => AbsP (s, t, lift' Us Ts prf))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   761
      | lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   762
          handle Same.SAME => prf % Same.map_option (same (op =) (lift'' Us Ts)) t)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   763
      | lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   764
          handle Same.SAME => prf1 %% lift' Us Ts prf2)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   765
      | lift' _ _ (PAxm (s, prop, Ts)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   766
          PAxm (s, prop, (Same.map_option o Same.map) (Logic.incr_tvar_same inc) Ts)
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
   767
      | lift' _ _ (OfClass (T, c)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   768
          OfClass (Logic.incr_tvar_same inc T, c)
28828
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
   769
      | lift' _ _ (Oracle (s, prop, Ts)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   770
          Oracle (s, prop, (Same.map_option o Same.map) (Logic.incr_tvar_same inc) Ts)
28828
c25dd83a6f9f unified treatment of PAxm/Oracle/Promise in basic proof term operations;
wenzelm
parents: 28815
diff changeset
   771
      | lift' _ _ (Promise (i, prop, Ts)) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   772
          Promise (i, prop, Same.map (Logic.incr_tvar_same inc) Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   773
      | lift' _ _ (PThm (i, ((s, prop, Ts), body))) =
32024
a5e7c8e60c85 tuned map_proof_terms_option;
wenzelm
parents: 32019
diff changeset
   774
          PThm (i, ((s, prop, (Same.map_option o Same.map) (Logic.incr_tvar inc) Ts), body))
32019
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   775
      | lift' _ _ _ = raise Same.SAME
827a8ebb3b2c use structure Same;
wenzelm
parents: 31977
diff changeset
   776
    and lifth' Us Ts prf = (lift' Us Ts prf handle Same.SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   777
18030
5dadabde8fe4 Logic.lift_all;
wenzelm
parents: 17756
diff changeset
   778
    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
   779
    val k = length ps;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   780
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   781
    fun mk_app b (i, j, prf) =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   782
          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
   783
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   784
    fun lift Us bs i j (Const ("==>", _) $ A $ B) =
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   785
            AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   786
      | lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) =
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   787
            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
   788
      | lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf,
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   789
            map (fn k => (#3 (fold_rev mk_app bs (i-1, j-1, PBound k))))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   790
              (i + k - 1 downto i));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   791
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   792
    mk_AbsP (k, lift [] [] 0 0 Bi)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   793
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   794
32027
9dd548810ed1 tuned incr_indexes;
wenzelm
parents: 32024
diff changeset
   795
fun incr_indexes i =
36620
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   796
  Same.commit (map_proof_terms_same
e6bb250402b5 simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents: 36619
diff changeset
   797
    (Logic.incr_indexes_same ([], i)) (Logic.incr_tvar_same i));
32027
9dd548810ed1 tuned incr_indexes;
wenzelm
parents: 32024
diff changeset
   798
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
(***** proof by assumption *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   801
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   802
fun mk_asm_prf t i m =
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   803
  let
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   804
    fun imp_prf _ i 0 = PBound i
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   805
      | imp_prf (Const ("==>", _) $ A $ B) i m = AbsP ("H", NONE (*A*), imp_prf B (i+1) (m-1))
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   806
      | imp_prf _ i _ = PBound i;
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   807
    fun all_prf (Const ("all", _) $ Abs (a, T, t)) = Abst (a, NONE (*T*), all_prf t)
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   808
      | all_prf t = imp_prf t (~i) m
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   809
  in all_prf t end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   810
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   811
fun assumption_proof Bs Bi n prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   812
  mk_AbsP (length Bs, proof_combP (prf,
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   813
    map PBound (length Bs - 1 downto 0) @ [mk_asm_prf Bi n ~1]));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   814
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   815
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   816
(***** Composition of object rule with proof state *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   817
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   818
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   819
      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
   820
  | flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   821
      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
   822
  | flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i),
19304
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   823
      map Bound (j-1 downto 0)), map PBound (remove (op =) (i-n) (i-1 downto 0)));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   824
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   825
fun bicompose_proof flatten Bs oldAs newAs A n m rprf sprf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   826
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   827
    val la = length newAs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   828
    val lb = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   829
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   830
    mk_AbsP (lb+la, proof_combP (sprf,
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   831
      map PBound (lb + la - 1 downto la)) %%
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   832
        proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) n m] else []) @
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   833
          map (if flatten then flatten_params_proof 0 0 n else PBound o snd)
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   834
            (oldAs ~~ (la - 1 downto 0))))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   835
  end;
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
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   838
(***** axioms for equality *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   839
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   840
val aT = TFree ("'a", []);
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   841
val bT = TFree ("'b", []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   842
val x = Free ("x", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   843
val y = Free ("y", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   844
val z = Free ("z", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   845
val A = Free ("A", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   846
val B = Free ("B", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   847
val f = Free ("f", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   848
val g = Free ("g", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   849
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   850
val equality_axms =
35851
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   851
 [("reflexive", Logic.mk_equals (x, x)),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   852
  ("symmetric", Logic.mk_implies (Logic.mk_equals (x, y), Logic.mk_equals (y, x))),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   853
  ("transitive",
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   854
    Logic.list_implies ([Logic.mk_equals (x, y), Logic.mk_equals (y, z)], Logic.mk_equals (x, z))),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   855
  ("equal_intr",
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   856
    Logic.list_implies ([Logic.mk_implies (A, B), Logic.mk_implies (B, A)], Logic.mk_equals (A, B))),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   857
  ("equal_elim", Logic.list_implies ([Logic.mk_equals (A, B), A], B)),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   858
  ("abstract_rule",
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   859
    Logic.mk_implies
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   860
      (Logic.all x
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   861
        (Logic.mk_equals (f $ x, g $ x)), Logic.mk_equals (lambda x (f $ x), lambda x (g $ x)))),
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   862
  ("combination", Logic.list_implies
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   863
    ([Logic.mk_equals (f, g), Logic.mk_equals (x, y)], Logic.mk_equals (f $ x, g $ y)))];
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   864
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   865
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   866
  equal_elim_axm, abstract_rule_axm, combination_axm] =
35851
5c5f08f6d6e4 do not open ML structures;
wenzelm
parents: 35845
diff changeset
   867
    map (fn (s, t) => PAxm ("Pure." ^ s, Logic.varify_global t, NONE)) equality_axms;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   868
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   869
val reflexive = reflexive_axm % NONE;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   870
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   871
fun symmetric (prf as PAxm ("Pure.reflexive", _, _) % _) = prf
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   872
  | symmetric prf = symmetric_axm % NONE % NONE %% prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   873
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   874
fun transitive _ _ (PAxm ("Pure.reflexive", _, _) % _) prf2 = prf2
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   875
  | transitive _ _ prf1 (PAxm ("Pure.reflexive", _, _) % _) = prf1
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   876
  | transitive u (Type ("prop", [])) prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   877
      transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   878
  | transitive u T prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   879
      transitive_axm % NONE % NONE % NONE %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   880
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   881
fun abstract_rule x a prf =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   882
  abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   883
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   884
fun check_comb (PAxm ("Pure.combination", _, _) % f % g % _ % _ %% prf %% _) =
19502
wenzelm
parents: 19482
diff changeset
   885
      is_some f orelse check_comb prf
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   886
  | check_comb (PAxm ("Pure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   887
      check_comb prf1 andalso check_comb prf2
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   888
  | check_comb (PAxm ("Pure.symmetric", _, _) % _ % _ %% prf) = check_comb prf
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   889
  | check_comb _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   890
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   891
fun combination f g t u (Type (_, [T, U])) prf1 prf2 =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   892
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   893
    val f = Envir.beta_norm f;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   894
    val g = Envir.beta_norm g;
44100
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   895
    val prf =
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   896
      if check_comb prf1 then
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   897
        combination_axm % NONE % NONE
44100
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   898
      else
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   899
        (case prf1 of
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   900
          PAxm ("Pure.reflexive", _, _) % _ =>
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   901
            combination_axm %> remove_types f % NONE
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   902
        | _ => combination_axm %> remove_types f %> remove_types g)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   903
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   904
    (case T of
44100
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   905
      Type ("fun", _) => prf %
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   906
        (case head_of f of
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   907
          Abs _ => SOME (remove_types t)
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   908
        | Var _ => SOME (remove_types t)
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   909
        | _ => NONE) %
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   910
        (case head_of g of
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   911
           Abs _ => SOME (remove_types u)
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   912
        | Var _ => SOME (remove_types u)
2cf62c4e6c7a tuned whitespace;
wenzelm
parents: 43795
diff changeset
   913
        | _ => NONE) %% prf1 %% prf2
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   914
     | _ => prf % NONE % NONE %% prf1 %% prf2)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   915
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   916
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   917
fun equal_intr A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   918
  equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   919
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   920
fun equal_elim A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   921
  equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   922
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   923
36740
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   924
(**** type classes ****)
36621
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   925
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   926
fun strip_shyps_proof algebra present witnessed extra_sorts prf =
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   927
  let
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   928
    fun get S2 (T, S1) = if Sorts.sort_le algebra (S1, S2) then SOME T else NONE;
36732
9c2ee10809b2 strip_shyps_proof: dummy TFrees are called "'dummy" as in del_conflicting_tvars below;
wenzelm
parents: 36621
diff changeset
   929
    val extra = map (fn S => (TFree ("'dummy", S), S)) extra_sorts;
36621
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   930
    val replacements = present @ extra @ witnessed;
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   931
    fun replace T =
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   932
      if exists (fn (T', _) => T' = T) present then raise Same.SAME
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   933
      else
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   934
        (case get_first (get (Type.sort_of_atyp T)) replacements of
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   935
          SOME T' => T'
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   936
        | NONE => raise Fail "strip_shyps_proof: bad type variable in proof term");
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   937
  in Same.commit (map_proof_types_same (Term_Subst.map_atypsT_same replace)) prf end;
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   938
2fd4e2c76636 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents: 36620
diff changeset
   939
36740
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   940
local
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   941
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   942
type axclass_proofs =
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   943
 {classrel_proof: theory -> class * class -> proof,
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   944
  arity_proof: theory -> string * sort list * class -> proof};
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   945
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   946
val axclass_proofs: axclass_proofs Single_Assignment.var =
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   947
  Single_Assignment.var "Proofterm.axclass_proofs";
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   948
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   949
fun axclass_proof which thy x =
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   950
  (case Single_Assignment.peek axclass_proofs of
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   951
    NONE => raise Fail "Axclass proof operations not installed"
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   952
  | SOME prfs => which prfs thy x);
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   953
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   954
in
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   955
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   956
val classrel_proof = axclass_proof #classrel_proof;
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   957
val arity_proof = axclass_proof #arity_proof;
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   958
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   959
fun install_axclass_proofs prfs = Single_Assignment.assign axclass_proofs prfs;
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   960
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   961
end;
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   962
6248aa22c694 back-patching of axclass proofs;
wenzelm
parents: 36732
diff changeset
   963
36741
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   964
local
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   965
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   966
fun canonical_instance typs =
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   967
  let
43329
84472e198515 tuned signature: Name.invent and Name.invent_names;
wenzelm
parents: 43326
diff changeset
   968
    val names = Name.invent Name.context Name.aT (length typs);
36741
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   969
    val instT = map2 (fn a => fn T => (((a, 0), []), Type.strip_sorts T)) names typs;
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   970
  in instantiate (instT, []) end;
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   971
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   972
in
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   973
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   974
fun of_sort_proof thy hyps =
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   975
  Sorts.of_sort_derivation (Sign.classes_of thy)
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   976
   {class_relation = fn typ => fn (prf, c1) => fn c2 =>
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   977
      if c1 = c2 then prf
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   978
      else canonical_instance [typ] (classrel_proof thy (c1, c2)) %% prf,
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   979
    type_constructor = fn (a, typs) => fn dom => fn c =>
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   980
      let val Ss = map (map snd) dom and prfs = maps (map fst) dom
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   981
      in proof_combP (canonical_instance typs (arity_proof thy (a, Ss, c)), prfs) end,
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   982
    type_variable = fn typ => map (fn c => (hyps (typ, c), c)) (Type.sort_of_atyp typ)};
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   983
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   984
end;
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   985
d65ed9d7275e added of_sort_proof according to krauss/schropp, with slightly more direct canonical_instance;
wenzelm
parents: 36740
diff changeset
   986
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   987
(***** axioms and theorems *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   988
32738
15bb09ca0378 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32726
diff changeset
   989
val proofs = Unsynchronized.ref 2;
41698
90597e044e5f clarified Proofterm.proofs_enabled;
wenzelm
parents: 41674
diff changeset
   990
fun proofs_enabled () = ! proofs >= 2;
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   991
28812
413695e07bd4 Frees in PThms are now quantified in the order of their appearance in the
berghofe
parents: 28803
diff changeset
   992
fun vars_of t = map Var (rev (Term.add_vars t []));
413695e07bd4 Frees in PThms are now quantified in the order of their appearance in the
berghofe
parents: 28803
diff changeset
   993
fun frees_of t = map Free (rev (Term.add_frees t []));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   994
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   995
fun test_args _ [] = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   996
  | test_args is (Bound i :: ts) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   997
      not (member (op =) is i) andalso test_args (i :: is) ts
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   998
  | test_args _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   999
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1000
fun is_fun (Type ("fun", _)) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1001
  | is_fun (TVar _) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1002
  | is_fun _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1003
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1004
fun add_funvars Ts (vs, t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1005
  if is_fun (fastype_of1 (Ts, t)) then
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1006
    union (op =) vs (map_filter (fn Var (ixn, T) =>
33037
b22e44496dc2 replaced old_style infixes eq_set, subset, union, inter and variants by generic versions
haftmann
parents: 32810
diff changeset
  1007
      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
  1008
  else vs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1009
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1010
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1011
      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
  1012
  | add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1013
      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
  1014
  | 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
  1015
  | add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t)
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
  1016
and add_npvars' Ts (vs, t) = (case strip_comb t of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1017
    (Var (ixn, _), ts) => if test_args [] ts then vs
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
  1018
      else Library.foldl (add_npvars' Ts)
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
  1019
        (AList.update (op =) (ixn,
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
  1020
          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
  1021
  | (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts)
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1022
  | (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1023
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1024
fun prop_vars (Const ("==>", _) $ P $ Q) = union (op =) (prop_vars P) (prop_vars Q)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1025
  | prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1026
  | prop_vars t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1027
      (Var (ixn, _), _) => [ixn] | _ => []);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1028
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1029
fun is_proj t =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1030
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1031
    fun is_p i t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1032
        (Bound j, []) => false
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1033
      | (Bound j, ts) => j >= i orelse exists (is_p i) ts
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1034
      | (Abs (_, _, u), _) => is_p (i+1) u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1035
      | (_, ts) => exists (is_p i) ts)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1036
  in (case strip_abs_body t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1037
        Bound _ => true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1038
      | t' => is_p 0 t')
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1039
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1040
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
  1041
fun needed_vars prop =
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1042
  union (op =) (Library.foldl (uncurry (union (op =)))
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1043
    ([], map (uncurry (insert (op =))) (add_npvars true true [] ([], prop))))
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1044
  (prop_vars prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1045
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1046
fun gen_axm_proof c name prop =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1047
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1048
    val nvs = needed_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1049
    val args = map (fn (v as Var (ixn, _)) =>
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1050
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
28812
413695e07bd4 Frees in PThms are now quantified in the order of their appearance in the
berghofe
parents: 28803
diff changeset
  1051
      map SOME (frees_of prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1052
  in
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1053
    proof_combt' (c (name, prop, NONE), args)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1054
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1055
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1056
val axm_proof = gen_axm_proof PAxm;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
  1057
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
  1058
val dummy = Const (Term.dummy_patternN, dummyT);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
  1059
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
  1060
fun oracle_proof name prop =
30716
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
  1061
  if ! proofs = 0 then ((name, dummy), Oracle (name, dummy, NONE))
2ee706293eb5 removed misleading make_proof_body, make_oracles, make_thms, which essentially assume a *full* proof;
wenzelm
parents: 30712
diff changeset
  1062
  else ((name, prop), gen_axm_proof Oracle name prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1063
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1064
fun shrink_proof thy =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1065
  let
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1066
    val (typ, term) = Term_Sharing.init thy;
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1067
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1068
    fun shrink ls lev (prf as Abst (a, T, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1069
          let val (b, is, ch, body') = shrink ls (lev+1) body
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1070
          in (b, is, ch, if ch then Abst (a, Option.map typ T, body') else prf) end
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1071
      | shrink ls lev (prf as AbsP (a, t, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1072
          let val (b, is, ch, body') = shrink (lev::ls) lev body
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
  1073
          in (b orelse member (op =) is 0, map_filter (fn 0 => NONE | i => SOME (i-1)) is,
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1074
            ch, if ch then AbsP (a, Option.map term t, body') else prf)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1075
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1076
      | shrink ls lev prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1077
          let val (is, ch, _, prf') = shrink' ls lev [] [] prf
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1078
          in (false, is, ch, prf') end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1079
    and shrink' ls lev ts prfs (prf as prf1 %% prf2) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1080
          let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1081
            val p as (_, is', ch', prf') = shrink ls lev prf2;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1082
            val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1083
          in (union (op =) is is', ch orelse ch', ts',
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1084
              if ch orelse ch' then prf'' %% prf' else prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1085
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1086
      | shrink' ls lev ts prfs (prf as prf1 % t) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1087
          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
  1088
          in (is, ch orelse ch', ts',
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1089
              if ch orelse ch' then prf' % Option.map term t' else prf) end
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1090
      | shrink' ls lev ts prfs (prf as PBound i) =
30146
a77fc0209723 eliminated NJ's List.nth;
wenzelm
parents: 29642
diff changeset
  1091
          (if exists (fn SOME (Bound j) => lev-j <= nth ls i | _ => true) ts
18928
042608ffa2ec subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents: 18485
diff changeset
  1092
             orelse has_duplicates (op =)
042608ffa2ec subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents: 18485
diff changeset
  1093
               (Library.foldl (fn (js, SOME (Bound j)) => j :: js | (js, _) => js) ([], ts))
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1094
             orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf)
43795
ca5896a836ba recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents: 43761
diff changeset
  1095
      | shrink' ls lev ts prfs (Hyp t) = ([], false, map (pair false) ts, Hyp (term t))
31903
c5221dbc40f6 added pro-forma proof constructor Inclass;
wenzelm
parents: 30716
diff changeset
  1096
      | shrink' ls lev ts prfs (prf as MinProof) = ([], false, map (pair false) ts, prf)
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
  1097
      | shrink' ls lev ts prfs (prf as OfClass _) = ([], false, map (pair false) ts, prf)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1098
      | shrink' ls lev ts prfs prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1099
          let
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1100
            val prop =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1101
              (case prf of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1102
                PAxm (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1103
              | Oracle (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1104
              | Promise (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1105
              | PThm (_, ((_, prop, _), _)) => prop
36879
201a4afd8533 raise Fail uniformly for proofterm errors, which appear to be rather low-level;
wenzelm
parents: 36878
diff changeset
  1106
              | _ => raise Fail "shrink: proof not in normal form");
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1107
            val vs = vars_of prop;
19012
wenzelm
parents: 18928
diff changeset
  1108
            val (ts', ts'') = chop (length vs) ts;
33957
e9afca2118d4 normalized uncurry take/drop
haftmann
parents: 33955
diff changeset
  1109
            val insts = take (length ts') (map (fst o dest_Var) vs) ~~ ts';
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1110
            val nvs = Library.foldl (fn (ixns', (ixn, ixns)) =>
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1111
              insert (op =) ixn (case AList.lookup (op =) insts ixn of
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1112
                  SOME (SOME t) => if is_proj t then union (op =) ixns ixns' else ixns'
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1113
                | _ => union (op =) ixns ixns'))
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1114
                  (needed prop ts'' prfs, add_npvars false true [] ([], prop));
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1115
            val insts' = map
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1116
              (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
  1117
                | (_, x) => (false, x)) insts
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1118
          in ([], false, insts' @ map (pair false) ts'', prf) end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1119
    and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) =
33042
ddf1f03a9ad9 curried union as canonical list operation
haftmann
parents: 33038
diff changeset
  1120
          union (op =) (if b then map (fst o dest_Var) (vars_of t) else []) (needed u ts prfs)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1121
      | needed (Var (ixn, _)) (_::_) _ = [ixn]
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1122
      | needed _ _ _ = [];
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1123
  in shrink end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1124
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1125
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1126
(**** Simple first order matching functions for terms and proofs ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1127
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1128
exception PMatch;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1129
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1130
(** see pattern.ML **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1131
33317
b4534348b8fd standardized filter/filter_out;
wenzelm
parents: 33042
diff changeset
  1132
fun flt (i: int) = filter (fn n => n < i);
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1133
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1134
fun fomatch Ts tymatch j instsp p =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1135
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1136
    fun mtch (instsp as (tyinsts, insts)) = fn
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1137
        (Var (ixn, T), t)  =>
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1138
          if j>0 andalso not (null (flt j (loose_bnos t)))
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1139
          then raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1140
          else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))),
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1141
            (ixn, t) :: insts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1142
      | (Free (a, T), Free (b, U)) =>
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
  1143
          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
  1144
      | (Const (a, T), Const (b, U))  =>
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
  1145
          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
  1146
      | (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1147
      | (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
  1148
      | _ => raise PMatch
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1149
  in mtch instsp (pairself Envir.beta_eta_contract p) end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1150
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1151
fun match_proof Ts tymatch =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1152
  let
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1153
    fun optmatch _ inst (NONE, _) = inst
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1154
      | optmatch _ _ (SOME _, NONE) = raise PMatch
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1155
      | optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1156
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1157
    fun matcht Ts j (pinst, tinst) (t, u) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1158
      (pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u));
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1159
    fun matchT (pinst, (tyinsts, insts)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1160
      (pinst, (tymatch (tyinsts, K p), insts));
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1161
    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
  1162
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1163
    fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1164
          if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1165
          else (case apfst (flt i) (apsnd (flt j)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1166
                  (prf_add_loose_bnos 0 0 prf ([], []))) of
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1167
              ([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1168
            | ([], _) => if j = 0 then
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1169
                   ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1170
                 else raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1171
            | _ => raise PMatch)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1172
      | mtch Ts i j inst (prf1 % opt1, prf2 % opt2) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1173
          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
  1174
      | mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1175
          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
  1176
      | mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
  1177
          mtch (the_default dummyT opU :: Ts) i (j+1)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1178
            (optmatch matchT inst (opT, opU)) (prf1, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1179
      | mtch Ts i j inst (prf1, Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
  1180
          mtch (the_default dummyT opU :: Ts) i (j+1) inst
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1181
            (incr_pboundvars 0 1 prf1 %> Bound 0, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1182
      | mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1183
          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
  1184
      | mtch Ts i j inst (prf1, AbsP (_, _, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1185
          mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1186
      | mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1187
          if s1 = s2 then optmatch matchTs inst (opTs, opUs)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1188
          else raise PMatch
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
  1189
      | mtch Ts i j inst (OfClass (T1, c1), OfClass (T2, c2)) =
31903
c5221dbc40f6 added pro-forma proof constructor Inclass;
wenzelm
parents: 30716
diff changeset
  1190
          if c1 = c2 then matchT inst (T1, T2)
c5221dbc40f6 added pro-forma proof constructor Inclass;
wenzelm
parents: 30716
diff changeset
  1191
          else raise PMatch
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1192
      | mtch Ts i j inst (PThm (_, ((name1, prop1, opTs), _)), PThm (_, ((name2, prop2, opUs), _))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1193
          if name1 = name2 andalso prop1 = prop2 then
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1194
            optmatch matchTs inst (opTs, opUs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1195
          else raise PMatch
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1196
      | 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
  1197
      | mtch _ _ _ _ _ = raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1198
  in mtch Ts 0 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1199
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1200
fun prf_subst (pinst, (tyinsts, insts)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1201
  let
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1202
    val substT = Envir.subst_type_same tyinsts;
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1203
    val substTs = Same.map substT;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1204
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1205
    fun subst' lev (Var (xi, _)) =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1206
        (case AList.lookup (op =) insts xi of
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1207
          NONE => raise Same.SAME
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1208
        | SOME u => incr_boundvars lev u)
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1209
      | subst' _ (Const (s, T)) = Const (s, substT T)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1210
      | subst' _ (Free (s, T)) = Free (s, substT T)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1211
      | subst' lev (Abs (a, T, body)) =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1212
          (Abs (a, substT T, Same.commit (subst' (lev + 1)) body)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1213
            handle Same.SAME => Abs (a, T, subst' (lev + 1) body))
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1214
      | subst' lev (f $ t) =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1215
          (subst' lev f $ Same.commit (subst' lev) t
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1216
            handle Same.SAME => f $ subst' lev t)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1217
      | subst' _ _ = raise Same.SAME;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1218
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1219
    fun subst plev tlev (AbsP (a, t, body)) =
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1220
          (AbsP (a, Same.map_option (subst' tlev) t, Same.commit (subst (plev + 1) tlev) body)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1221
            handle Same.SAME => AbsP (a, t, subst (plev + 1) tlev body))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1222
      | subst plev tlev (Abst (a, T, body)) =
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1223
          (Abst (a, Same.map_option substT T, Same.commit (subst plev (tlev + 1)) body)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1224
            handle Same.SAME => Abst (a, T, subst plev (tlev + 1) body))
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1225
      | subst plev tlev (prf %% prf') =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1226
          (subst plev tlev prf %% Same.commit (subst plev tlev) prf'
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1227
            handle Same.SAME => prf %% subst plev tlev prf')
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1228
      | subst plev tlev (prf % t) =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1229
          (subst plev tlev prf % Same.commit (Same.map_option (subst' tlev)) t
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1230
            handle Same.SAME => prf % Same.map_option (subst' tlev) t)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1231
      | subst plev tlev (Hyp (Var (xi, _))) =
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1232
          (case AList.lookup (op =) pinst xi of
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1233
            NONE => raise Same.SAME
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1234
          | SOME prf' => incr_pboundvars plev tlev prf')
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1235
      | subst _ _ (PAxm (id, prop, Ts)) = PAxm (id, prop, Same.map_option substTs Ts)
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
  1236
      | subst _ _ (OfClass (T, c)) = OfClass (substT T, c)
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1237
      | subst _ _ (Oracle (id, prop, Ts)) = Oracle (id, prop, Same.map_option substTs Ts)
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1238
      | subst _ _ (Promise (i, prop, Ts)) = Promise (i, prop, substTs Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1239
      | subst _ _ (PThm (i, ((id, prop, Ts), body))) =
32049
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1240
          PThm (i, ((id, prop, Same.map_option substTs Ts), body))
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1241
      | subst _ _ _ = raise Same.SAME;
d6065a237059 tuned prf_subst: use structure Same;
wenzelm
parents: 32035
diff changeset
  1242
  in fn t => subst 0 0 t handle Same.SAME => t end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1243
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
  1244
(*A fast unification filter: true unless the two terms cannot be unified.
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1245
  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
  1246
fun could_unify prf1 prf2 =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1247
  let
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1248
    fun matchrands (prf1 %% prf2) (prf1' %% prf2') =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1249
          could_unify prf2 prf2' andalso matchrands prf1 prf1'
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1250
      | 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
  1251
          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
  1252
      | matchrands (prf % _) (prf' % _) = matchrands prf prf'
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1253
      | matchrands _ _ = true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1254
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1255
    fun head_of (prf %% _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1256
      | head_of (prf % _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1257
      | head_of prf = prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1258
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1259
  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
  1260
        (_, Hyp (Var _)) => true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1261
      | (Hyp (Var _), _) => true
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1262
      | (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2
31943
5e960a0780a2 renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents: 31903
diff changeset
  1263
      | (OfClass (_, c), OfClass (_, d)) => c = d andalso matchrands prf1 prf2
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1264
      | (PThm (_, ((a, propa, _), _)), PThm (_, ((b, propb, _), _))) =>
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1265
          a = b andalso propa = propb andalso matchrands prf1 prf2
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1266
      | (PBound i, PBound j) => i = j andalso matchrands prf1 prf2
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1267
      | (AbsP _, _) =>  true   (*because of possible eta equality*)
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1268
      | (Abst _, _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1269
      | (_, AbsP _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1270
      | (_, Abst _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1271
      | _ => false
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1272
  end;
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1273
28329
e6a5fa9f1e41 added conditional add_oracles, keep oracles_of_proof private;
wenzelm
parents: 28319
diff changeset
  1274
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1275
(**** rewriting on proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1276
33722
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1277
val no_skel = PBound 0;
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1278
val normal_skel = Hyp (Var ((Name.uu, 0), propT));
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1279
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1280
fun rewrite_prf tymatch (rules, procs) prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1281
  let
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1282
    fun rew _ _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, no_skel)
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1283
      | rew _ _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, no_skel)
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1284
      | rew Ts hs prf =
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1285
          (case get_first (fn r => r Ts hs prf) procs of
33722
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1286
            NONE => get_first (fn (prf1, prf2) => SOME (prf_subst
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1287
              (match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2)
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1288
                 handle PMatch => NONE) (filter (could_unify prf o fst) rules)
e588744f14da generalized procs for rewrite_proof: allow skeleton;
wenzelm
parents: 33522
diff changeset
  1289
          | some => some);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1290
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1291
    fun rew0 Ts hs (prf as AbsP (_, _, prf' %% PBound 0)) =
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1292
          if prf_loose_Pbvar1 prf' 0 then rew Ts hs prf
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1293
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1294
            let val prf'' = incr_pboundvars (~1) 0 prf'
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1295
            in SOME (the_default (prf'', no_skel) (rew Ts hs prf'')) end
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1296
      | rew0 Ts hs (prf as Abst (_, _, prf' % SOME (Bound 0))) =
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1297
          if prf_loose_bvar1 prf' 0 then rew Ts hs prf
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1298
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1299
            let val prf'' = incr_pboundvars 0 (~1) prf'
37231
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1300
            in SOME (the_default (prf'', no_skel) (rew Ts hs prf'')) end
e5419ecf92b7 - outer_constraints with original variable names, to ensure that argsP is consistent with args
berghofe
parents: 36883
diff changeset
  1301
      | rew0 Ts hs prf = rew Ts hs prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
<