author | wenzelm |
Fri, 02 Aug 2019 11:43:36 +0200 | |
changeset 70457 | a8b5d668bf13 |
parent 70456 | c742527a25fe |
child 70458 | 9e2173eb23eb |
permissions | -rw-r--r-- |
250 | 1 |
(* Title: Pure/thm.ML |
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29003
diff
changeset
|
3 |
Author: Makarius |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
4 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
5 |
The very core of Isabelle's Meta Logic: certified types and terms, |
59589 | 6 |
derivations, theorems, inference rules (including lifting and |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
7 |
resolution), oracles. |
0 | 8 |
*) |
9 |
||
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
10 |
infix 0 RS RSN; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
11 |
|
6089 | 12 |
signature BASIC_THM = |
59589 | 13 |
sig |
59582 | 14 |
type ctyp |
15 |
type cterm |
|
16 |
exception CTERM of string * cterm list |
|
17 |
type thm |
|
18 |
type conv = cterm -> thm |
|
19 |
exception THM of string * int * thm list |
|
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
20 |
val RSN: thm * (int * thm) -> thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
21 |
val RS: thm * thm -> thm |
59582 | 22 |
end; |
23 |
||
24 |
signature THM = |
|
25 |
sig |
|
26 |
include BASIC_THM |
|
1160 | 27 |
(*certified types*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
28 |
val typ_of: ctyp -> typ |
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
29 |
val global_ctyp_of: theory -> typ -> ctyp |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
30 |
val ctyp_of: Proof.context -> typ -> ctyp |
59582 | 31 |
val dest_ctyp: ctyp -> ctyp list |
70159 | 32 |
val dest_ctypN: int -> ctyp -> ctyp |
33 |
val dest_ctyp0: ctyp -> ctyp |
|
34 |
val dest_ctyp1: ctyp -> ctyp |
|
70156 | 35 |
val make_ctyp: ctyp -> ctyp list -> ctyp |
1160 | 36 |
(*certified terms*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
37 |
val term_of: cterm -> term |
59586 | 38 |
val typ_of_cterm: cterm -> typ |
39 |
val ctyp_of_cterm: cterm -> ctyp |
|
40 |
val maxidx_of_cterm: cterm -> int |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
41 |
val global_cterm_of: theory -> term -> cterm |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
42 |
val cterm_of: Proof.context -> term -> cterm |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
43 |
val renamed_term: term -> cterm -> cterm |
59582 | 44 |
val dest_comb: cterm -> cterm * cterm |
45 |
val dest_fun: cterm -> cterm |
|
46 |
val dest_arg: cterm -> cterm |
|
47 |
val dest_fun2: cterm -> cterm |
|
48 |
val dest_arg1: cterm -> cterm |
|
49 |
val dest_abs: string option -> cterm -> cterm * cterm |
|
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
50 |
val rename_tvar: indexname -> ctyp -> ctyp |
60951
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
51 |
val var: indexname * ctyp -> cterm |
59582 | 52 |
val apply: cterm -> cterm -> cterm |
53 |
val lambda_name: string * cterm -> cterm -> cterm |
|
54 |
val lambda: cterm -> cterm -> cterm |
|
55 |
val adjust_maxidx_cterm: int -> cterm -> cterm |
|
56 |
val incr_indexes_cterm: int -> cterm -> cterm |
|
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
57 |
val match: cterm * cterm -> |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
58 |
((indexname * sort) * ctyp) list * ((indexname * typ) * cterm) list |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
59 |
val first_order_match: cterm * cterm -> |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
60 |
((indexname * sort) * ctyp) list * ((indexname * typ) * cterm) list |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
61 |
(*theorems*) |
59582 | 62 |
val fold_terms: (term -> 'a -> 'a) -> thm -> 'a -> 'a |
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
63 |
val fold_atomic_ctyps: (ctyp -> 'a -> 'a) -> thm -> 'a -> 'a |
60818 | 64 |
val fold_atomic_cterms: (cterm -> 'a -> 'a) -> thm -> 'a -> 'a |
59582 | 65 |
val terms_of_tpairs: (term * term) list -> term list |
66 |
val full_prop_of: thm -> term |
|
65458 | 67 |
val theory_id: thm -> Context.theory_id |
68 |
val theory_name: thm -> string |
|
59582 | 69 |
val maxidx_of: thm -> int |
70 |
val maxidx_thm: thm -> int -> int |
|
61039 | 71 |
val shyps_of: thm -> sort Ord_List.T |
59582 | 72 |
val hyps_of: thm -> term list |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
73 |
val prop_of: thm -> term |
59582 | 74 |
val tpairs_of: thm -> (term * term) list |
16656 | 75 |
val concl_of: thm -> term |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
76 |
val prems_of: thm -> term list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
77 |
val nprems_of: thm -> int |
59582 | 78 |
val no_prems: thm -> bool |
79 |
val major_prem_of: thm -> term |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
80 |
val cprop_of: thm -> cterm |
18145 | 81 |
val cprem_of: thm -> int -> cterm |
69101
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
82 |
val cconcl_of: thm -> cterm |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
83 |
val cprems_of: thm -> cterm list |
60949 | 84 |
val chyps_of: thm -> cterm list |
61051 | 85 |
exception CONTEXT of string * ctyp list * cterm list * thm list * Context.generic option |
86 |
val theory_of_cterm: cterm -> theory |
|
87 |
val theory_of_thm: thm -> theory |
|
67697 | 88 |
val trim_context_ctyp: ctyp -> ctyp |
61051 | 89 |
val trim_context_cterm: cterm -> cterm |
61048 | 90 |
val trim_context: thm -> thm |
70156 | 91 |
val transfer_ctyp: theory -> ctyp -> ctyp |
61051 | 92 |
val transfer_cterm: theory -> cterm -> cterm |
38709 | 93 |
val transfer: theory -> thm -> thm |
67649 | 94 |
val transfer': Proof.context -> thm -> thm |
95 |
val transfer'': Context.generic -> thm -> thm |
|
70310
c82f59c47aaf
clarified transfer_morphism: implicit join_certificate, e.g. relevant for complex cascades of morphisms such as class locale interpretation;
wenzelm
parents:
70159
diff
changeset
|
96 |
val join_transfer: theory -> thm -> thm |
70313 | 97 |
val join_transfer_context: Proof.context * thm -> Proof.context * thm |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
98 |
val renamed_prop: term -> thm -> thm |
38709 | 99 |
val weaken: cterm -> thm -> thm |
100 |
val weaken_sorts: sort list -> cterm -> cterm |
|
101 |
val extra_shyps: thm -> sort list |
|
44333
cc53ce50f738
reverted to join_bodies/join_proofs based on fold_body_thms to regain performance (escpecially of HOL-Proofs) -- see also aa9c1e9ef2ce and 4e2abb045eac;
wenzelm
parents:
44331
diff
changeset
|
102 |
val proof_bodies_of: thm list -> proof_body list |
32725 | 103 |
val proof_body_of: thm -> proof_body |
104 |
val proof_of: thm -> proof |
|
66168 | 105 |
val consolidate: thm list -> unit |
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
49008
diff
changeset
|
106 |
val peek_status: thm -> {oracle: bool, unfinished: bool, failed: bool} |
32725 | 107 |
val future: thm future -> cterm -> thm |
64568
a504a3dec35a
more careful derivation_closed / close_derivation;
wenzelm
parents:
63858
diff
changeset
|
108 |
val derivation_closed: thm -> bool |
36744
6e1f3d609a68
renamed Thm.get_name -> Thm.derivation_name and Thm.put_name -> Thm.name_derivation, to emphasize the true nature of these operations;
wenzelm
parents:
36742
diff
changeset
|
109 |
val derivation_name: thm -> string |
6e1f3d609a68
renamed Thm.get_name -> Thm.derivation_name and Thm.put_name -> Thm.name_derivation, to emphasize the true nature of these operations;
wenzelm
parents:
36742
diff
changeset
|
110 |
val name_derivation: string -> thm -> thm |
70404 | 111 |
val close_derivation: thm -> thm |
28675
fb68c0767004
renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents:
28648
diff
changeset
|
112 |
val axiom: theory -> string -> thm |
fb68c0767004
renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents:
28648
diff
changeset
|
113 |
val axioms_of: theory -> (string * thm) list |
28017 | 114 |
val get_tags: thm -> Properties.T |
115 |
val map_tags: (Properties.T -> Properties.T) -> thm -> thm |
|
23781
ab793a6ddf9f
Added function norm_proof for normalizing the proof term
berghofe
parents:
23657
diff
changeset
|
116 |
val norm_proof: thm -> thm |
20261 | 117 |
val adjust_maxidx_thm: int -> thm -> thm |
70454 | 118 |
(*oracles*) |
119 |
val add_oracle: binding * ('a -> cterm) -> theory -> (string * ('a -> thm)) * theory |
|
120 |
val extern_oracles: bool -> Proof.context -> (Markup.T * xstring) list |
|
59589 | 121 |
(*inference rules*) |
38709 | 122 |
val assume: cterm -> thm |
123 |
val implies_intr: cterm -> thm -> thm |
|
124 |
val implies_elim: thm -> thm -> thm |
|
125 |
val forall_intr: cterm -> thm -> thm |
|
126 |
val forall_elim: cterm -> thm -> thm |
|
127 |
val reflexive: cterm -> thm |
|
128 |
val symmetric: thm -> thm |
|
129 |
val transitive: thm -> thm -> thm |
|
130 |
val beta_conversion: bool -> conv |
|
131 |
val eta_conversion: conv |
|
132 |
val eta_long_conversion: conv |
|
133 |
val abstract_rule: string -> cterm -> thm -> thm |
|
134 |
val combination: thm -> thm -> thm |
|
135 |
val equal_intr: thm -> thm -> thm |
|
136 |
val equal_elim: thm -> thm -> thm |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
137 |
val flexflex_rule: Proof.context option -> thm -> thm Seq.seq |
38709 | 138 |
val generalize: string list * string list -> int -> thm -> thm |
67697 | 139 |
val generalize_cterm: string list * string list -> int -> cterm -> cterm |
140 |
val generalize_ctyp: string list -> int -> ctyp -> ctyp |
|
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
141 |
val instantiate: ((indexname * sort) * ctyp) list * ((indexname * typ) * cterm) list -> |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
142 |
thm -> thm |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
143 |
val instantiate_cterm: ((indexname * sort) * ctyp) list * ((indexname * typ) * cterm) list -> |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
144 |
cterm -> cterm |
38709 | 145 |
val trivial: cterm -> thm |
36330
0584e203960e
renamed Drule.unconstrainTs to Thm.unconstrain_allTs to accomdate the version by krauss/schropp;
wenzelm
parents:
35986
diff
changeset
|
146 |
val of_class: ctyp * class -> thm |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
147 |
val strip_shyps: thm -> thm |
36768
46be86127972
just one version of Thm.unconstrainT, which affects all variables;
wenzelm
parents:
36744
diff
changeset
|
148 |
val unconstrainT: thm -> thm |
38709 | 149 |
val varifyT_global': (string * sort) list -> thm -> ((string * sort) * indexname) list * thm |
150 |
val varifyT_global: thm -> thm |
|
36615
88756a5a92fc
renamed Thm.freezeT to Thm.legacy_freezeT -- it is based on Type.legacy_freeze;
wenzelm
parents:
36614
diff
changeset
|
151 |
val legacy_freezeT: thm -> thm |
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
152 |
val plain_prop_of: thm -> term |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
153 |
val dest_state: thm * int -> (term * term) list * term list * term * term |
38709 | 154 |
val lift_rule: cterm -> thm -> thm |
155 |
val incr_indexes: int -> thm -> thm |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
156 |
val assumption: Proof.context option -> int -> thm -> thm Seq.seq |
31945 | 157 |
val eq_assumption: int -> thm -> thm |
158 |
val rotate_rule: int -> int -> thm -> thm |
|
159 |
val permute_prems: int -> int -> thm -> thm |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
160 |
val bicompose: Proof.context option -> {flatten: bool, match: bool, incremented: bool} -> |
52223
5bb6ae8acb87
tuned signature -- more explicit flags for low-level Thm.bicompose;
wenzelm
parents:
52222
diff
changeset
|
161 |
bool * thm * int -> int -> thm -> thm Seq.seq |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
162 |
val biresolution: Proof.context option -> bool -> (bool * thm) list -> int -> thm -> thm Seq.seq |
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
163 |
val the_classrel: theory -> class * class -> thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
164 |
val the_arity: theory -> string * sort list * class -> thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
165 |
val thynames_of_arity: theory -> string * class -> string list |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
166 |
val add_classrel: thm -> theory -> theory |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
167 |
val add_arity: thm -> theory -> theory |
6089 | 168 |
end; |
169 |
||
32590
95f4f08f950f
replaced opaque signature matching by plain old abstype (again, cf. ac4498f95d1c) -- this recovers pretty printing in SML/NJ and Poly/ML 5.3;
wenzelm
parents:
32198
diff
changeset
|
170 |
structure Thm: THM = |
0 | 171 |
struct |
250 | 172 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
173 |
(*** Certified terms and types ***) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
174 |
|
250 | 175 |
(** certified types **) |
176 |
||
70453
492cb3aaa562
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
wenzelm
parents:
70404
diff
changeset
|
177 |
datatype ctyp = Ctyp of {cert: Context.certificate, T: typ, maxidx: int, sorts: sort Ord_List.T}; |
250 | 178 |
|
179 |
fun typ_of (Ctyp {T, ...}) = T; |
|
180 |
||
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
181 |
fun global_ctyp_of thy raw_T = |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
182 |
let |
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
183 |
val T = Sign.certify_typ thy raw_T; |
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
184 |
val maxidx = Term.maxidx_of_typ T; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
185 |
val sorts = Sorts.insert_typ T []; |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
186 |
in Ctyp {cert = Context.Certificate thy, T = T, maxidx = maxidx, sorts = sorts} end; |
250 | 187 |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
188 |
val ctyp_of = global_ctyp_of o Proof_Context.theory_of; |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
189 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
190 |
fun dest_ctyp (Ctyp {cert, T = Type (_, Ts), maxidx, sorts}) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
191 |
map (fn T => Ctyp {cert = cert, T = T, maxidx = maxidx, sorts = sorts}) Ts |
16679 | 192 |
| dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []); |
15087 | 193 |
|
70159 | 194 |
fun dest_ctypN n (Ctyp {cert, T, maxidx, sorts}) = |
195 |
let fun err () = raise TYPE ("dest_ctypN", [T], []) in |
|
70153
8a23083ac011
prefer exception TYPE, e.g. when used within conversion;
wenzelm
parents:
70150
diff
changeset
|
196 |
(case T of |
8a23083ac011
prefer exception TYPE, e.g. when used within conversion;
wenzelm
parents:
70150
diff
changeset
|
197 |
Type (_, Ts) => |
70159 | 198 |
Ctyp {cert = cert, T = nth Ts n handle General.Subscript => err (), |
70153
8a23083ac011
prefer exception TYPE, e.g. when used within conversion;
wenzelm
parents:
70150
diff
changeset
|
199 |
maxidx = maxidx, sorts = sorts} |
8a23083ac011
prefer exception TYPE, e.g. when used within conversion;
wenzelm
parents:
70150
diff
changeset
|
200 |
| _ => err ()) |
8a23083ac011
prefer exception TYPE, e.g. when used within conversion;
wenzelm
parents:
70150
diff
changeset
|
201 |
end; |
70150 | 202 |
|
70159 | 203 |
val dest_ctyp0 = dest_ctypN 0; |
204 |
val dest_ctyp1 = dest_ctypN 1; |
|
205 |
||
70156 | 206 |
fun join_certificate_ctyp (Ctyp {cert, ...}) cert0 = Context.join_certificate (cert0, cert); |
207 |
fun union_sorts_ctyp (Ctyp {sorts, ...}) sorts0 = Sorts.union sorts0 sorts; |
|
208 |
fun maxidx_ctyp (Ctyp {maxidx, ...}) maxidx0 = Int.max (maxidx0, maxidx); |
|
209 |
||
210 |
fun make_ctyp (Ctyp {cert, T, maxidx = _, sorts = _}) cargs = |
|
211 |
let |
|
212 |
val As = map typ_of cargs; |
|
213 |
fun err () = raise TYPE ("make_ctyp", T :: As, []); |
|
214 |
in |
|
215 |
(case T of |
|
216 |
Type (a, args) => |
|
217 |
Ctyp { |
|
218 |
cert = fold join_certificate_ctyp cargs cert, |
|
219 |
maxidx = fold maxidx_ctyp cargs ~1, |
|
220 |
sorts = fold union_sorts_ctyp cargs [], |
|
221 |
T = if length args = length cargs then Type (a, As) else err ()} |
|
222 |
| _ => err ()) |
|
223 |
end; |
|
224 |
||
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
225 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
226 |
|
250 | 227 |
(** certified terms **) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
228 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
229 |
(*certified terms with checked typ, maxidx, and sorts*) |
70453
492cb3aaa562
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
wenzelm
parents:
70404
diff
changeset
|
230 |
datatype cterm = |
492cb3aaa562
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
wenzelm
parents:
70404
diff
changeset
|
231 |
Cterm of {cert: Context.certificate, t: term, T: typ, maxidx: int, sorts: sort Ord_List.T}; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
232 |
|
22584 | 233 |
exception CTERM of string * cterm list; |
16679 | 234 |
|
250 | 235 |
fun term_of (Cterm {t, ...}) = t; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
236 |
|
59586 | 237 |
fun typ_of_cterm (Cterm {T, ...}) = T; |
238 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
239 |
fun ctyp_of_cterm (Cterm {cert, T, maxidx, sorts, ...}) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
240 |
Ctyp {cert = cert, T = T, maxidx = maxidx, sorts = sorts}; |
2671 | 241 |
|
59586 | 242 |
fun maxidx_of_cterm (Cterm {maxidx, ...}) = maxidx; |
243 |
||
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
244 |
fun global_cterm_of thy tm = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
245 |
let |
18969 | 246 |
val (t, T, maxidx) = Sign.certify_term thy tm; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
247 |
val sorts = Sorts.insert_term t []; |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
248 |
in Cterm {cert = Context.Certificate thy, t = t, T = T, maxidx = maxidx, sorts = sorts} end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
249 |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
250 |
val cterm_of = global_cterm_of o Proof_Context.theory_of; |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
251 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
252 |
fun join_certificate0 (Cterm {cert = cert1, ...}, Cterm {cert = cert2, ...}) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
253 |
Context.join_certificate (cert1, cert2); |
60315 | 254 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
255 |
fun renamed_term t' (Cterm {cert, t, T, maxidx, sorts}) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
256 |
if t aconv t' then Cterm {cert = cert, t = t', T = T, maxidx = maxidx, sorts = sorts} |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
257 |
else raise TERM ("renamed_term: terms disagree", [t, t']); |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
258 |
|
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
259 |
|
22909 | 260 |
(* destructors *) |
261 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
262 |
fun dest_comb (Cterm {t = c $ a, T, cert, maxidx, sorts}) = |
22909 | 263 |
let val A = Term.argument_type_of c 0 in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
264 |
(Cterm {t = c, T = A --> T, cert = cert, maxidx = maxidx, sorts = sorts}, |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
265 |
Cterm {t = a, T = A, cert = cert, maxidx = maxidx, sorts = sorts}) |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
266 |
end |
22584 | 267 |
| dest_comb ct = raise CTERM ("dest_comb", [ct]); |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
268 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
269 |
fun dest_fun (Cterm {t = c $ _, T, cert, maxidx, sorts}) = |
22909 | 270 |
let val A = Term.argument_type_of c 0 |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
271 |
in Cterm {t = c, T = A --> T, cert = cert, maxidx = maxidx, sorts = sorts} end |
22909 | 272 |
| dest_fun ct = raise CTERM ("dest_fun", [ct]); |
273 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
274 |
fun dest_arg (Cterm {t = c $ a, T = _, cert, maxidx, sorts}) = |
22909 | 275 |
let val A = Term.argument_type_of c 0 |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
276 |
in Cterm {t = a, T = A, cert = cert, maxidx = maxidx, sorts = sorts} end |
22584 | 277 |
| dest_arg ct = raise CTERM ("dest_arg", [ct]); |
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
278 |
|
22909 | 279 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
280 |
fun dest_fun2 (Cterm {t = c $ _ $ _, T, cert, maxidx, sorts}) = |
22909 | 281 |
let |
282 |
val A = Term.argument_type_of c 0; |
|
283 |
val B = Term.argument_type_of c 1; |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
284 |
in Cterm {t = c, T = A --> B --> T, cert = cert, maxidx = maxidx, sorts = sorts} end |
22909 | 285 |
| dest_fun2 ct = raise CTERM ("dest_fun2", [ct]); |
286 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
287 |
fun dest_arg1 (Cterm {t = c $ a $ _, T = _, cert, maxidx, sorts}) = |
22909 | 288 |
let val A = Term.argument_type_of c 0 |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
289 |
in Cterm {t = a, T = A, cert = cert, maxidx = maxidx, sorts = sorts} end |
22909 | 290 |
| dest_arg1 ct = raise CTERM ("dest_arg1", [ct]); |
20673 | 291 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
292 |
fun dest_abs a (Cterm {t = Abs (x, T, t), T = Type ("fun", [_, U]), cert, maxidx, sorts}) = |
18944 | 293 |
let val (y', t') = Term.dest_abs (the_default x a, T, t) in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
294 |
(Cterm {t = Free (y', T), T = T, cert = cert, maxidx = maxidx, sorts = sorts}, |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
295 |
Cterm {t = t', T = U, cert = cert, maxidx = maxidx, sorts = sorts}) |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
296 |
end |
22584 | 297 |
| dest_abs _ ct = raise CTERM ("dest_abs", [ct]); |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
298 |
|
22909 | 299 |
|
300 |
(* constructors *) |
|
301 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
302 |
fun rename_tvar (a, i) (Ctyp {cert, T, maxidx, sorts}) = |
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
303 |
let |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
304 |
val S = |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
305 |
(case T of |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
306 |
TFree (_, S) => S |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
307 |
| TVar (_, S) => S |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
308 |
| _ => raise TYPE ("rename_tvar: no variable", [T], [])); |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
309 |
val _ = if i < 0 then raise TYPE ("rename_tvar: bad index", [TVar ((a, i), S)], []) else (); |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
310 |
in Ctyp {cert = cert, T = TVar ((a, i), S), maxidx = Int.max (i, maxidx), sorts = sorts} end; |
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
311 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
312 |
fun var ((x, i), Ctyp {cert, T, maxidx, sorts}) = |
60951
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
313 |
if i < 0 then raise TERM ("var: bad index", [Var ((x, i), T)]) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
314 |
else Cterm {cert = cert, t = Var ((x, i), T), T = T, maxidx = Int.max (i, maxidx), sorts = sorts}; |
60951
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
315 |
|
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
316 |
fun apply |
16656 | 317 |
(cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...}) |
318 |
(cx as Cterm {t = x, T, maxidx = maxidx2, sorts = sorts2, ...}) = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
319 |
if T = dty then |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
320 |
Cterm {cert = join_certificate0 (cf, cx), |
16656 | 321 |
t = f $ x, |
322 |
T = rty, |
|
323 |
maxidx = Int.max (maxidx1, maxidx2), |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
324 |
sorts = Sorts.union sorts1 sorts2} |
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
325 |
else raise CTERM ("apply: types don't agree", [cf, cx]) |
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
326 |
| apply cf cx = raise CTERM ("apply: first arg is not a function", [cf, cx]); |
250 | 327 |
|
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
328 |
fun lambda_name |
32198 | 329 |
(x, ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...}) |
16656 | 330 |
(ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) = |
32198 | 331 |
let val t = Term.lambda_name (x, t1) t2 in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
332 |
Cterm {cert = join_certificate0 (ct1, ct2), |
16656 | 333 |
t = t, T = T1 --> T2, |
334 |
maxidx = Int.max (maxidx1, maxidx2), |
|
335 |
sorts = Sorts.union sorts1 sorts2} |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
336 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
337 |
|
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
338 |
fun lambda t u = lambda_name ("", t) u; |
32198 | 339 |
|
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
340 |
|
22909 | 341 |
(* indexes *) |
342 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
343 |
fun adjust_maxidx_cterm i (ct as Cterm {cert, t, T, maxidx, sorts}) = |
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
344 |
if maxidx = i then ct |
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
345 |
else if maxidx < i then |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
346 |
Cterm {maxidx = i, cert = cert, t = t, T = T, sorts = sorts} |
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
347 |
else |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
348 |
Cterm {maxidx = Int.max (maxidx_of_term t, i), cert = cert, t = t, T = T, sorts = sorts}; |
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
349 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
350 |
fun incr_indexes_cterm i (ct as Cterm {cert, t, T, maxidx, sorts}) = |
22909 | 351 |
if i < 0 then raise CTERM ("negative increment", [ct]) |
352 |
else if i = 0 then ct |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
353 |
else Cterm {cert = cert, t = Logic.incr_indexes ([], [], i) t, |
22909 | 354 |
T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts}; |
355 |
||
356 |
||
2509 | 357 |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
358 |
(*** Derivations and Theorems ***) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
359 |
|
70453
492cb3aaa562
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
wenzelm
parents:
70404
diff
changeset
|
360 |
datatype thm = Thm of |
40124 | 361 |
deriv * (*derivation*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
362 |
{cert: Context.certificate, (*background theory certificate*) |
40124 | 363 |
tags: Properties.T, (*additional annotations/comments*) |
364 |
maxidx: int, (*maximum index of any Var or TVar*) |
|
365 |
shyps: sort Ord_List.T, (*sort hypotheses*) |
|
366 |
hyps: term Ord_List.T, (*hypotheses*) |
|
367 |
tpairs: (term * term) list, (*flex-flex pairs*) |
|
368 |
prop: term} (*conclusion*) |
|
28624 | 369 |
and deriv = Deriv of |
39687 | 370 |
{promises: (serial * thm future) Ord_List.T, |
70453
492cb3aaa562
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
wenzelm
parents:
70404
diff
changeset
|
371 |
body: Proofterm.proof_body}; |
0 | 372 |
|
23601 | 373 |
type conv = cterm -> thm; |
374 |
||
16725 | 375 |
(*errors involving theorems*) |
376 |
exception THM of string * int * thm list; |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
377 |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
378 |
fun rep_thm (Thm (_, args)) = args; |
0 | 379 |
|
31947
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
380 |
fun fold_terms f (Thm (_, {tpairs, prop, hyps, ...})) = |
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
381 |
fold (fn (t, u) => f t #> f u) tpairs #> f prop #> fold f hyps; |
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
382 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
383 |
fun fold_atomic_ctyps f (th as Thm (_, {cert, maxidx, shyps, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
384 |
let fun ctyp T = Ctyp {cert = cert, T = T, maxidx = maxidx, sorts = shyps} |
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
385 |
in (fold_terms o fold_types o fold_atyps) (f o ctyp) th end; |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
386 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
387 |
fun fold_atomic_cterms f (th as Thm (_, {cert, maxidx, shyps, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
388 |
let fun cterm t T = Cterm {cert = cert, t = t, T = T, maxidx = maxidx, sorts = shyps} in |
60818 | 389 |
(fold_terms o fold_aterms) |
390 |
(fn t as Const (_, T) => f (cterm t T) |
|
391 |
| t as Free (_, T) => f (cterm t T) |
|
392 |
| t as Var (_, T) => f (cterm t T) |
|
393 |
| _ => I) th |
|
394 |
end; |
|
395 |
||
16725 | 396 |
fun terms_of_tpairs tpairs = fold_rev (fn (t, u) => cons t o cons u) tpairs []; |
397 |
||
398 |
fun eq_tpairs ((t, u), (t', u')) = t aconv t' andalso u aconv u'; |
|
18944 | 399 |
fun union_tpairs ts us = Library.merge eq_tpairs (ts, us); |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
400 |
val maxidx_tpairs = fold (fn (t, u) => Term.maxidx_term t #> Term.maxidx_term u); |
16725 | 401 |
|
402 |
fun attach_tpairs tpairs prop = |
|
403 |
Logic.list_implies (map Logic.mk_equals tpairs, prop); |
|
404 |
||
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
405 |
fun full_prop_of (Thm (_, {tpairs, prop, ...})) = attach_tpairs tpairs prop; |
16945 | 406 |
|
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
407 |
|
39687 | 408 |
val union_hyps = Ord_List.union Term_Ord.fast_term_ord; |
409 |
val insert_hyps = Ord_List.insert Term_Ord.fast_term_ord; |
|
410 |
val remove_hyps = Ord_List.remove Term_Ord.fast_term_ord; |
|
22365 | 411 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
412 |
fun join_certificate1 (Cterm {cert = cert1, ...}, Thm (_, {cert = cert2, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
413 |
Context.join_certificate (cert1, cert2); |
16945 | 414 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
415 |
fun join_certificate2 (Thm (_, {cert = cert1, ...}), Thm (_, {cert = cert2, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
416 |
Context.join_certificate (cert1, cert2); |
16945 | 417 |
|
0 | 418 |
|
22365 | 419 |
(* basic components *) |
16135 | 420 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
421 |
val cert_of = #cert o rep_thm; |
65458 | 422 |
val theory_id = Context.certificate_theory_id o cert_of; |
423 |
val theory_name = Context.theory_id_name o theory_id; |
|
61050 | 424 |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
425 |
val maxidx_of = #maxidx o rep_thm; |
19910 | 426 |
fun maxidx_thm th i = Int.max (maxidx_of th, i); |
61039 | 427 |
val shyps_of = #shyps o rep_thm; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
428 |
val hyps_of = #hyps o rep_thm; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
429 |
val prop_of = #prop o rep_thm; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
430 |
val tpairs_of = #tpairs o rep_thm; |
0 | 431 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
432 |
val concl_of = Logic.strip_imp_concl o prop_of; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
433 |
val prems_of = Logic.strip_imp_prems o prop_of; |
21576 | 434 |
val nprems_of = Logic.count_prems o prop_of; |
19305 | 435 |
fun no_prems th = nprems_of th = 0; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
436 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
437 |
fun major_prem_of th = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
438 |
(case prems_of th of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
439 |
prem :: _ => Logic.strip_assums_concl prem |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
440 |
| [] => raise THM ("major_prem_of: rule with no premises", 0, [th])); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
441 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
442 |
fun cprop_of (Thm (_, {cert, maxidx, shyps, prop, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
443 |
Cterm {cert = cert, maxidx = maxidx, T = propT, t = prop, sorts = shyps}; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
444 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
445 |
fun cprem_of (th as Thm (_, {cert, maxidx, shyps, prop, ...})) i = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
446 |
Cterm {cert = cert, maxidx = maxidx, T = propT, sorts = shyps, |
18145 | 447 |
t = Logic.nth_prem (i, prop) handle TERM _ => raise THM ("cprem_of", i, [th])}; |
18035 | 448 |
|
69101
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
449 |
fun cconcl_of (th as Thm (_, {cert, maxidx, shyps, ...})) = |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
450 |
Cterm {cert = cert, maxidx = maxidx, T = propT, sorts = shyps, t = concl_of th}; |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
451 |
|
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
452 |
fun cprems_of (th as Thm (_, {cert, maxidx, shyps, ...})) = |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
453 |
map (fn t => Cterm {cert = cert, maxidx = maxidx, T = propT, sorts = shyps, t = t}) |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
454 |
(prems_of th); |
991a3feaf270
more direct implementation of distinct_subgoals_tac -- potentially more efficient;
wenzelm
parents:
68692
diff
changeset
|
455 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
456 |
fun chyps_of (Thm (_, {cert, shyps, hyps, ...})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
457 |
map (fn t => Cterm {cert = cert, maxidx = ~1, T = propT, sorts = shyps, t = t}) hyps; |
60949 | 458 |
|
61051 | 459 |
|
460 |
(* implicit theory context *) |
|
461 |
||
462 |
exception CONTEXT of string * ctyp list * cterm list * thm list * Context.generic option; |
|
463 |
||
464 |
fun theory_of_cterm (ct as Cterm {cert, ...}) = |
|
465 |
Context.certificate_theory cert |
|
466 |
handle ERROR msg => raise CONTEXT (msg, [], [ct], [], NONE); |
|
467 |
||
468 |
fun theory_of_thm th = |
|
469 |
Context.certificate_theory (cert_of th) |
|
470 |
handle ERROR msg => raise CONTEXT (msg, [], [], [th], NONE); |
|
471 |
||
67697 | 472 |
fun trim_context_ctyp cT = |
473 |
(case cT of |
|
474 |
Ctyp {cert = Context.Certificate_Id _, ...} => cT |
|
475 |
| Ctyp {cert = Context.Certificate thy, T, maxidx, sorts} => |
|
476 |
Ctyp {cert = Context.Certificate_Id (Context.theory_id thy), |
|
477 |
T = T, maxidx = maxidx, sorts = sorts}); |
|
478 |
||
61051 | 479 |
fun trim_context_cterm ct = |
480 |
(case ct of |
|
481 |
Cterm {cert = Context.Certificate_Id _, ...} => ct |
|
482 |
| Cterm {cert = Context.Certificate thy, t, T, maxidx, sorts} => |
|
483 |
Cterm {cert = Context.Certificate_Id (Context.theory_id thy), |
|
484 |
t = t, T = T, maxidx = maxidx, sorts = sorts}); |
|
485 |
||
61048 | 486 |
fun trim_context th = |
487 |
(case th of |
|
488 |
Thm (_, {cert = Context.Certificate_Id _, ...}) => th |
|
489 |
| Thm (der, {cert = Context.Certificate thy, tags, maxidx, shyps, hyps, tpairs, prop}) => |
|
490 |
Thm (der, |
|
491 |
{cert = Context.Certificate_Id (Context.theory_id thy), |
|
492 |
tags = tags, maxidx = maxidx, shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop})); |
|
493 |
||
70156 | 494 |
fun transfer_ctyp thy' cT = |
495 |
let |
|
496 |
val Ctyp {cert, T, maxidx, sorts} = cT; |
|
497 |
val _ = |
|
498 |
Context.subthy_id (Context.certificate_theory_id cert, Context.theory_id thy') orelse |
|
499 |
raise CONTEXT ("Cannot transfer: not a super theory", [cT], [], [], |
|
500 |
SOME (Context.Theory thy')); |
|
501 |
val cert' = Context.join_certificate (Context.Certificate thy', cert); |
|
502 |
in |
|
503 |
if Context.eq_certificate (cert, cert') then cT |
|
504 |
else Ctyp {cert = cert', T = T, maxidx = maxidx, sorts = sorts} |
|
505 |
end; |
|
506 |
||
61051 | 507 |
fun transfer_cterm thy' ct = |
3895 | 508 |
let |
61051 | 509 |
val Cterm {cert, t, T, maxidx, sorts} = ct; |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
510 |
val _ = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
511 |
Context.subthy_id (Context.certificate_theory_id cert, Context.theory_id thy') orelse |
61051 | 512 |
raise CONTEXT ("Cannot transfer: not a super theory", [], [ct], [], |
513 |
SOME (Context.Theory thy')); |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
514 |
val cert' = Context.join_certificate (Context.Certificate thy', cert); |
3895 | 515 |
in |
61051 | 516 |
if Context.eq_certificate (cert, cert') then ct |
517 |
else Cterm {cert = cert', t = t, T = T, maxidx = maxidx, sorts = sorts} |
|
518 |
end; |
|
519 |
||
520 |
fun transfer thy' th = |
|
521 |
let |
|
522 |
val Thm (der, {cert, tags, maxidx, shyps, hyps, tpairs, prop}) = th; |
|
523 |
val _ = |
|
524 |
Context.subthy_id (Context.certificate_theory_id cert, Context.theory_id thy') orelse |
|
525 |
raise CONTEXT ("Cannot transfer: not a super theory", [], [], [th], |
|
526 |
SOME (Context.Theory thy')); |
|
527 |
val cert' = Context.join_certificate (Context.Certificate thy', cert); |
|
528 |
in |
|
529 |
if Context.eq_certificate (cert, cert') then th |
|
16945 | 530 |
else |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
531 |
Thm (der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
532 |
{cert = cert', |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
533 |
tags = tags, |
16945 | 534 |
maxidx = maxidx, |
535 |
shyps = shyps, |
|
536 |
hyps = hyps, |
|
537 |
tpairs = tpairs, |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
538 |
prop = prop}) |
3895 | 539 |
end; |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
540 |
|
67649 | 541 |
val transfer' = transfer o Proof_Context.theory_of; |
542 |
val transfer'' = transfer o Context.theory_of; |
|
543 |
||
70310
c82f59c47aaf
clarified transfer_morphism: implicit join_certificate, e.g. relevant for complex cascades of morphisms such as class locale interpretation;
wenzelm
parents:
70159
diff
changeset
|
544 |
fun join_transfer thy th = |
c82f59c47aaf
clarified transfer_morphism: implicit join_certificate, e.g. relevant for complex cascades of morphisms such as class locale interpretation;
wenzelm
parents:
70159
diff
changeset
|
545 |
if Context.subthy_id (Context.theory_id thy, theory_id th) then th |
c82f59c47aaf
clarified transfer_morphism: implicit join_certificate, e.g. relevant for complex cascades of morphisms such as class locale interpretation;
wenzelm
parents:
70159
diff
changeset
|
546 |
else transfer thy th; |
c82f59c47aaf
clarified transfer_morphism: implicit join_certificate, e.g. relevant for complex cascades of morphisms such as class locale interpretation;
wenzelm
parents:
70159
diff
changeset
|
547 |
|
70313 | 548 |
fun join_transfer_context (ctxt, th) = |
549 |
if Context.subthy_id (Context.theory_id (Proof_Context.theory_of ctxt), theory_id th) then |
|
550 |
(Context.raw_transfer (theory_of_thm th) ctxt, th) |
|
551 |
else (ctxt, transfer' ctxt th); |
|
552 |
||
61051 | 553 |
|
554 |
(* matching *) |
|
555 |
||
556 |
local |
|
557 |
||
558 |
fun gen_match match |
|
559 |
(ct1 as Cterm {t = t1, sorts = sorts1, ...}, |
|
560 |
ct2 as Cterm {t = t2, sorts = sorts2, maxidx = maxidx2, ...}) = |
|
561 |
let |
|
562 |
val cert = join_certificate0 (ct1, ct2); |
|
563 |
val thy = Context.certificate_theory cert |
|
564 |
handle ERROR msg => raise CONTEXT (msg, [], [ct1, ct2], [], NONE); |
|
565 |
val (Tinsts, tinsts) = match thy (t1, t2) (Vartab.empty, Vartab.empty); |
|
566 |
val sorts = Sorts.union sorts1 sorts2; |
|
567 |
fun mk_cTinst ((a, i), (S, T)) = |
|
568 |
(((a, i), S), Ctyp {T = T, cert = cert, maxidx = maxidx2, sorts = sorts}); |
|
569 |
fun mk_ctinst ((x, i), (U, t)) = |
|
570 |
let val T = Envir.subst_type Tinsts U in |
|
571 |
(((x, i), T), Cterm {t = t, T = T, cert = cert, maxidx = maxidx2, sorts = sorts}) |
|
572 |
end; |
|
573 |
in (Vartab.fold (cons o mk_cTinst) Tinsts [], Vartab.fold (cons o mk_ctinst) tinsts []) end; |
|
574 |
||
575 |
in |
|
576 |
||
577 |
val match = gen_match Pattern.match; |
|
578 |
val first_order_match = gen_match Pattern.first_order_match; |
|
579 |
||
580 |
end; |
|
581 |
||
582 |
||
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
583 |
(*implicit alpha-conversion*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
584 |
fun renamed_prop prop' (Thm (der, {cert, tags, maxidx, shyps, hyps, tpairs, prop})) = |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
585 |
if prop aconv prop' then |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
586 |
Thm (der, {cert = cert, tags = tags, maxidx = maxidx, shyps = shyps, |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
587 |
hyps = hyps, tpairs = tpairs, prop = prop'}) |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
588 |
else raise TERM ("renamed_prop: props disagree", [prop, prop']); |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
589 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
590 |
fun make_context ths NONE cert = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
591 |
(Context.Theory (Context.certificate_theory cert) |
61051 | 592 |
handle ERROR msg => raise CONTEXT (msg, [], [], ths, NONE)) |
61045
c7a7f063704a
clarified exceptions: avoid interference of formal context failure with regular rule application failure (which is routinely handled in user-space);
wenzelm
parents:
61044
diff
changeset
|
593 |
| make_context ths (SOME ctxt) cert = |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
594 |
let |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
595 |
val thy_id = Context.certificate_theory_id cert; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
596 |
val thy_id' = Context.theory_id (Proof_Context.theory_of ctxt); |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
597 |
in |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
598 |
if Context.subthy_id (thy_id, thy_id') then Context.Proof ctxt |
61051 | 599 |
else raise CONTEXT ("Bad context", [], [], ths, SOME (Context.Proof ctxt)) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
600 |
end; |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
601 |
|
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
602 |
fun make_context_certificate ths opt_ctxt cert = |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
603 |
let |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
604 |
val context = make_context ths opt_ctxt cert; |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
605 |
val cert' = Context.Certificate (Context.theory_of context); |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
606 |
in (context, cert') end; |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
607 |
|
16945 | 608 |
(*explicit weakening: maps |- B to A |- B*) |
609 |
fun weaken raw_ct th = |
|
610 |
let |
|
20261 | 611 |
val ct as Cterm {t = A, T, sorts, maxidx = maxidxA, ...} = adjust_maxidx_cterm ~1 raw_ct; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
612 |
val Thm (der, {tags, maxidx, shyps, hyps, tpairs, prop, ...}) = th; |
16945 | 613 |
in |
614 |
if T <> propT then |
|
615 |
raise THM ("weaken: assumptions must have type prop", 0, []) |
|
616 |
else if maxidxA <> ~1 then |
|
617 |
raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, []) |
|
618 |
else |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
619 |
Thm (der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
620 |
{cert = join_certificate1 (ct, th), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
621 |
tags = tags, |
16945 | 622 |
maxidx = maxidx, |
623 |
shyps = Sorts.union sorts shyps, |
|
28354 | 624 |
hyps = insert_hyps A hyps, |
16945 | 625 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
626 |
prop = prop}) |
16945 | 627 |
end; |
16656 | 628 |
|
28624 | 629 |
fun weaken_sorts raw_sorts ct = |
630 |
let |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
631 |
val Cterm {cert, t, T, maxidx, sorts} = ct; |
61050 | 632 |
val thy = theory_of_cterm ct; |
28624 | 633 |
val more_sorts = Sorts.make (map (Sign.certify_sort thy) raw_sorts); |
634 |
val sorts' = Sorts.union sorts more_sorts; |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
635 |
in Cterm {cert = cert, t = t, T = T, maxidx = maxidx, sorts = sorts'} end; |
28624 | 636 |
|
16656 | 637 |
(*dangling sort constraints of a thm*) |
31947
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
638 |
fun extra_shyps (th as Thm (_, {shyps, ...})) = |
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
639 |
Sorts.subtract (fold_terms Sorts.insert_term th []) shyps; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
640 |
|
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
641 |
|
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
642 |
|
32725 | 643 |
(** derivations and promised proofs **) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
644 |
|
32059
7991cdf10a54
support for arbitrarity nested future proofs -- replaced crude order by explicit normalization (which might loop for bad dependencies);
wenzelm
parents:
32035
diff
changeset
|
645 |
fun make_deriv promises oracles thms proof = |
7991cdf10a54
support for arbitrarity nested future proofs -- replaced crude order by explicit normalization (which might loop for bad dependencies);
wenzelm
parents:
32035
diff
changeset
|
646 |
Deriv {promises = promises, body = PBody {oracles = oracles, thms = thms, proof = proof}}; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
647 |
|
70398 | 648 |
val empty_deriv = make_deriv [] [] [] MinProof; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
649 |
|
28330 | 650 |
|
28354 | 651 |
(* inference rules *) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
652 |
|
28378
60cc0359363d
promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents:
28364
diff
changeset
|
653 |
fun promise_ord ((i, _), (j, _)) = int_ord (j, i); |
28330 | 654 |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
655 |
fun deriv_rule2 f |
32059
7991cdf10a54
support for arbitrarity nested future proofs -- replaced crude order by explicit normalization (which might loop for bad dependencies);
wenzelm
parents:
32035
diff
changeset
|
656 |
(Deriv {promises = ps1, body = PBody {oracles = oras1, thms = thms1, proof = prf1}}) |
7991cdf10a54
support for arbitrarity nested future proofs -- replaced crude order by explicit normalization (which might loop for bad dependencies);
wenzelm
parents:
32035
diff
changeset
|
657 |
(Deriv {promises = ps2, body = PBody {oracles = oras2, thms = thms2, proof = prf2}}) = |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
658 |
let |
39687 | 659 |
val ps = Ord_List.union promise_ord ps1 ps2; |
44334 | 660 |
val oras = Proofterm.unions_oracles [oras1, oras2]; |
661 |
val thms = Proofterm.unions_thms [thms1, thms2]; |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
662 |
val prf = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
663 |
(case ! Proofterm.proofs of |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
664 |
2 => f prf1 prf2 |
28804
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
665 |
| 1 => MinProof |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
666 |
| 0 => MinProof |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
667 |
| i => error ("Illegal level of detail for proof objects: " ^ string_of_int i)); |
32059
7991cdf10a54
support for arbitrarity nested future proofs -- replaced crude order by explicit normalization (which might loop for bad dependencies);
wenzelm
parents:
32035
diff
changeset
|
668 |
in make_deriv ps oras thms prf end; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
669 |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
670 |
fun deriv_rule1 f = deriv_rule2 (K f) empty_deriv; |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
671 |
fun deriv_rule0 prf = deriv_rule1 I (make_deriv [] [] [] prf); |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
672 |
|
36621
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
673 |
fun deriv_rule_unconditional f (Deriv {promises, body = PBody {oracles, thms, proof}}) = |
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
674 |
make_deriv promises oracles thms (f proof); |
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
675 |
|
1238 | 676 |
|
32725 | 677 |
(* fulfilled proofs *) |
678 |
||
44331 | 679 |
fun raw_body_of (Thm (Deriv {body, ...}, _)) = body; |
680 |
fun raw_promises_of (Thm (Deriv {promises, ...}, _)) = promises; |
|
681 |
||
682 |
fun join_promises [] = () |
|
683 |
| join_promises promises = join_promises_of (Future.joins (map snd promises)) |
|
49008
a3cdb49c22cc
proper merge of promises to avoid exponential blow-up in pathologic situations (e.g. lack of PThm wrapping);
wenzelm
parents:
48263
diff
changeset
|
684 |
and join_promises_of thms = join_promises (Ord_List.make promise_ord (maps raw_promises_of thms)); |
32725 | 685 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
686 |
fun fulfill_body (th as Thm (Deriv {promises, body}, _)) = |
64571 | 687 |
let val fulfilled_promises = map #1 promises ~~ map fulfill_body (Future.joins (map #2 promises)) |
688 |
in Proofterm.fulfill_norm_proof (theory_of_thm th) fulfilled_promises body end; |
|
32725 | 689 |
|
64574
1134e4d5e5b7
consolidate nested thms with persistent result, for improved performance;
wenzelm
parents:
64573
diff
changeset
|
690 |
fun proof_bodies_of thms = (join_promises_of thms; map fulfill_body thms); |
44333
cc53ce50f738
reverted to join_bodies/join_proofs based on fold_body_thms to regain performance (escpecially of HOL-Proofs) -- see also aa9c1e9ef2ce and 4e2abb045eac;
wenzelm
parents:
44331
diff
changeset
|
691 |
val proof_body_of = singleton proof_bodies_of; |
44331 | 692 |
val proof_of = Proofterm.proof_of o proof_body_of; |
32725 | 693 |
|
66168 | 694 |
val consolidate = ignore o proof_bodies_of; |
32725 | 695 |
|
696 |
||
697 |
(* derivation status *) |
|
698 |
||
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
49008
diff
changeset
|
699 |
fun peek_status (Thm (Deriv {promises, body}, _)) = |
32725 | 700 |
let |
701 |
val ps = map (Future.peek o snd) promises; |
|
702 |
val bodies = body :: |
|
44331 | 703 |
map_filter (fn SOME (Exn.Res th) => SOME (raw_body_of th) | _ => NONE) ps; |
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
49008
diff
changeset
|
704 |
val {oracle, unfinished, failed} = Proofterm.peek_status bodies; |
32725 | 705 |
in |
706 |
{oracle = oracle, |
|
707 |
unfinished = unfinished orelse exists is_none ps, |
|
708 |
failed = failed orelse exists (fn SOME (Exn.Exn _) => true | _ => false) ps} |
|
709 |
end; |
|
710 |
||
711 |
||
712 |
(* future rule *) |
|
713 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
714 |
fun future_result i orig_cert orig_shyps orig_prop thm = |
32725 | 715 |
let |
36613
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36330
diff
changeset
|
716 |
fun err msg = raise THM ("future_result: " ^ msg, 0, [thm]); |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
717 |
val Thm (Deriv {promises, ...}, {cert, shyps, hyps, tpairs, prop, ...}) = thm; |
36613
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36330
diff
changeset
|
718 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
719 |
val _ = Context.eq_certificate (cert, orig_cert) orelse err "bad theory"; |
32725 | 720 |
val _ = prop aconv orig_prop orelse err "bad prop"; |
721 |
val _ = null tpairs orelse err "bad tpairs"; |
|
722 |
val _ = null hyps orelse err "bad hyps"; |
|
723 |
val _ = Sorts.subset (shyps, orig_shyps) orelse err "bad shyps"; |
|
724 |
val _ = forall (fn (j, _) => i <> j) promises orelse err "bad dependencies"; |
|
44331 | 725 |
val _ = join_promises promises; |
32725 | 726 |
in thm end; |
727 |
||
728 |
fun future future_thm ct = |
|
729 |
let |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
730 |
val Cterm {cert = cert, t = prop, T, maxidx, sorts} = ct; |
32725 | 731 |
val _ = T <> propT andalso raise CTERM ("future: prop expected", [ct]); |
70398 | 732 |
val _ = |
733 |
if Proofterm.proofs_enabled () |
|
734 |
then raise CTERM ("future: proof terms enabled", [ct]) else (); |
|
32725 | 735 |
|
736 |
val i = serial (); |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
737 |
val future = future_thm |> Future.map (future_result i cert sorts prop); |
32725 | 738 |
in |
70398 | 739 |
Thm (make_deriv [(i, future)] [] [] MinProof, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
740 |
{cert = cert, |
32725 | 741 |
tags = [], |
742 |
maxidx = maxidx, |
|
743 |
shyps = sorts, |
|
744 |
hyps = [], |
|
745 |
tpairs = [], |
|
746 |
prop = prop}) |
|
747 |
end; |
|
748 |
||
749 |
||
750 |
(* closed derivations with official name *) |
|
751 |
||
41699 | 752 |
(*non-deterministic, depends on unknown promises*) |
64568
a504a3dec35a
more careful derivation_closed / close_derivation;
wenzelm
parents:
63858
diff
changeset
|
753 |
fun derivation_closed (Thm (Deriv {body, ...}, _)) = |
a504a3dec35a
more careful derivation_closed / close_derivation;
wenzelm
parents:
63858
diff
changeset
|
754 |
Proofterm.compact_proof (Proofterm.proof_of body); |
a504a3dec35a
more careful derivation_closed / close_derivation;
wenzelm
parents:
63858
diff
changeset
|
755 |
|
a504a3dec35a
more careful derivation_closed / close_derivation;
wenzelm
parents:
63858
diff
changeset
|
756 |
(*non-deterministic, depends on unknown promises*) |
37297 | 757 |
fun derivation_name (Thm (Deriv {body, ...}, {shyps, hyps, prop, ...})) = |
37309 | 758 |
Proofterm.get_name shyps hyps prop (Proofterm.proof_of body); |
32725 | 759 |
|
36744
6e1f3d609a68
renamed Thm.get_name -> Thm.derivation_name and Thm.put_name -> Thm.name_derivation, to emphasize the true nature of these operations;
wenzelm
parents:
36742
diff
changeset
|
760 |
fun name_derivation name (thm as Thm (der, args)) = |
32725 | 761 |
let |
762 |
val Deriv {promises, body} = der; |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
763 |
val {shyps, hyps, prop, tpairs, ...} = args; |
32725 | 764 |
val _ = null tpairs orelse raise THM ("put_name: unsolved flex-flex constraints", 0, [thm]); |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
765 |
val thy = theory_of_thm thm; |
32725 | 766 |
|
41700
f33d5a00c25d
thm_proof: visible fulfill_body only, without joining nested thms -- retain proof irrelevance, which is important for parallel performance;
wenzelm
parents:
41699
diff
changeset
|
767 |
val ps = map (apsnd (Future.map fulfill_body)) promises; |
37309 | 768 |
val (pthm, proof) = Proofterm.thm_proof thy name shyps hyps prop ps body; |
32725 | 769 |
val der' = make_deriv [] [] [pthm] proof; |
770 |
in Thm (der', args) end; |
|
771 |
||
70404 | 772 |
fun close_derivation thm = |
773 |
if derivation_closed thm then thm else name_derivation "" thm; |
|
774 |
||
32725 | 775 |
|
1238 | 776 |
|
1529 | 777 |
(** Axioms **) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
778 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
779 |
fun axiom thy0 name = |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
780 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
781 |
fun get_ax thy = |
59884 | 782 |
Name_Space.lookup (Theory.axiom_table thy) name |
783 |
|> Option.map (fn prop => |
|
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
784 |
let |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
785 |
val der = deriv_rule0 (Proofterm.axm_proof name prop); |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
786 |
val cert = Context.Certificate thy; |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
787 |
val maxidx = maxidx_of_term prop; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
788 |
val shyps = Sorts.insert_term prop []; |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
789 |
in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
790 |
Thm (der, {cert = cert, tags = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
791 |
maxidx = maxidx, shyps = shyps, hyps = [], tpairs = [], prop = prop}) |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
792 |
end); |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
793 |
in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
794 |
(case get_first get_ax (Theory.nodes_of thy0) of |
15531 | 795 |
SOME thm => thm |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
796 |
| NONE => raise THEORY ("No axiom " ^ quote name, [thy0])) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
797 |
end; |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
798 |
|
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
799 |
(*return additional axioms of this theory node*) |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
800 |
fun axioms_of thy = |
56025 | 801 |
map (fn (name, _) => (name, axiom thy name)) (Theory.axioms_of thy); |
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
802 |
|
6089 | 803 |
|
28804
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
804 |
(* tags *) |
6089 | 805 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
806 |
val get_tags = #tags o rep_thm; |
6089 | 807 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
808 |
fun map_tags f (Thm (der, {cert, tags, maxidx, shyps, hyps, tpairs, prop})) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
809 |
Thm (der, {cert = cert, tags = f tags, maxidx = maxidx, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
810 |
shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}); |
0 | 811 |
|
812 |
||
43795
ca5896a836ba
recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents:
43761
diff
changeset
|
813 |
(* technical adjustments *) |
ca5896a836ba
recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents:
43761
diff
changeset
|
814 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
815 |
fun norm_proof (th as Thm (der, args)) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
816 |
Thm (deriv_rule1 (Proofterm.rew_proof (theory_of_thm th)) der, args); |
23781
ab793a6ddf9f
Added function norm_proof for normalizing the proof term
berghofe
parents:
23657
diff
changeset
|
817 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
818 |
fun adjust_maxidx_thm i (th as Thm (der, {cert, tags, maxidx, shyps, hyps, tpairs, prop})) = |
20261 | 819 |
if maxidx = i then th |
820 |
else if maxidx < i then |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
821 |
Thm (der, {maxidx = i, cert = cert, tags = tags, shyps = shyps, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
822 |
hyps = hyps, tpairs = tpairs, prop = prop}) |
20261 | 823 |
else |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
824 |
Thm (der, {maxidx = Int.max (maxidx_tpairs tpairs (maxidx_of_term prop), i), |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
825 |
cert = cert, tags = tags, shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}); |
564 | 826 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
827 |
|
2509 | 828 |
|
70454 | 829 |
(*** Theory data ***) |
830 |
||
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
831 |
datatype sorts = Sorts of |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
832 |
{classrels: thm Symreltab.table, |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
833 |
arities: ((class * sort list) * (thm * string)) list Symtab.table}; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
834 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
835 |
fun make_sorts (classrels, arities) = Sorts {classrels = classrels, arities = arities}; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
836 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
837 |
val empty_sorts = make_sorts (Symreltab.empty, Symtab.empty); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
838 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
839 |
fun merge_sorts |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
840 |
(Sorts {classrels = classrels1, arities = arities1}, |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
841 |
Sorts {classrels = classrels2, arities = arities2}) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
842 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
843 |
(*see Theory.at_begin hook for transitive closure of classrels and arity completion*) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
844 |
val classrels' = Symreltab.merge (K true) (classrels1, classrels2); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
845 |
val arities' = Symtab.merge_list (eq_fst op =) (arities1, arities2); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
846 |
in make_sorts (classrels', arities') end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
847 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
848 |
|
70454 | 849 |
structure Data = Theory_Data |
850 |
( |
|
851 |
type T = |
|
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
852 |
unit Name_Space.table * (*oracles: authentic derivation names*) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
853 |
sorts; (*sort algebra within the logic*) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
854 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
855 |
val empty : T = (Name_Space.empty_table "oracle", empty_sorts); |
70454 | 856 |
val extend = I; |
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
857 |
fun merge ((oracles1, sorts1), (oracles2, sorts2)) : T = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
858 |
(Name_Space.merge_tables (oracles1, oracles2), merge_sorts (sorts1, sorts2)); |
70454 | 859 |
); |
860 |
||
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
861 |
val get_oracles = #1 o Data.get; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
862 |
val map_oracles = Data.map o apfst; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
863 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
864 |
val get_sorts = (fn (_, Sorts args) => args) o Data.get; |
70457 | 865 |
val get_classrels = #classrels o get_sorts; |
866 |
val get_arities = #arities o get_sorts; |
|
867 |
||
868 |
fun map_sorts f = |
|
869 |
(Data.map o apsnd) (fn Sorts {classrels, arities} => make_sorts (f (classrels, arities))); |
|
870 |
fun map_classrels f = map_sorts (fn (classrels, arities) => (f classrels, arities)); |
|
871 |
fun map_arities f = map_sorts (fn (classrels, arities) => (classrels, f arities)); |
|
70454 | 872 |
|
873 |
||
874 |
||
875 |
(*** Oracles ***) |
|
876 |
||
877 |
fun add_oracle (b, oracle_fn) thy = |
|
878 |
let |
|
879 |
val (name, oracles') = Name_Space.define (Context.Theory thy) true (b, ()) (get_oracles thy); |
|
880 |
val thy' = map_oracles (K oracles') thy; |
|
881 |
fun invoke_oracle arg = |
|
882 |
let val Cterm {cert = cert2, t = prop, T, maxidx, sorts} = oracle_fn arg in |
|
883 |
if T <> propT then |
|
884 |
raise THM ("Oracle's result must have type prop: " ^ name, 0, []) |
|
885 |
else |
|
886 |
let val (oracle, prf) = Proofterm.oracle_proof name prop in |
|
887 |
Thm (make_deriv [] [oracle] [] prf, |
|
888 |
{cert = Context.join_certificate (Context.Certificate thy', cert2), |
|
889 |
tags = [], |
|
890 |
maxidx = maxidx, |
|
891 |
shyps = sorts, |
|
892 |
hyps = [], |
|
893 |
tpairs = [], |
|
894 |
prop = prop}) |
|
895 |
end |
|
896 |
end; |
|
897 |
in ((name, invoke_oracle), thy') end; |
|
898 |
||
899 |
fun extern_oracles verbose ctxt = |
|
900 |
map #1 (Name_Space.markup_table verbose ctxt (get_oracles (Proof_Context.theory_of ctxt))); |
|
901 |
||
902 |
||
903 |
||
1529 | 904 |
(*** Meta rules ***) |
0 | 905 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
906 |
(** primitive rules **) |
0 | 907 |
|
16656 | 908 |
(*The assumption rule A |- A*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
909 |
fun assume raw_ct = |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
910 |
let val Cterm {cert, t = prop, T, maxidx, sorts} = adjust_maxidx_cterm ~1 raw_ct in |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
911 |
if T <> propT then |
19230 | 912 |
raise THM ("assume: prop", 0, []) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
913 |
else if maxidx <> ~1 then |
19230 | 914 |
raise THM ("assume: variables", maxidx, []) |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
915 |
else Thm (deriv_rule0 (Proofterm.Hyp prop), |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
916 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
917 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
918 |
maxidx = ~1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
919 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
920 |
hyps = [prop], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
921 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
922 |
prop = prop}) |
0 | 923 |
end; |
924 |
||
1220 | 925 |
(*Implication introduction |
3529 | 926 |
[A] |
927 |
: |
|
928 |
B |
|
1220 | 929 |
------- |
67721 | 930 |
A \<Longrightarrow> B |
1220 | 931 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
932 |
fun implies_intr |
68691 | 933 |
(ct as Cterm {t = A, T, maxidx = maxidx1, sorts, ...}) |
934 |
(th as Thm (der, {maxidx = maxidx2, hyps, shyps, tpairs, prop, ...})) = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
935 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
936 |
raise THM ("implies_intr: assumptions must have type prop", 0, [th]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
937 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
938 |
Thm (deriv_rule1 (Proofterm.implies_intr_proof A) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
939 |
{cert = join_certificate1 (ct, th), |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
940 |
tags = [], |
68691 | 941 |
maxidx = Int.max (maxidx1, maxidx2), |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
942 |
shyps = Sorts.union sorts shyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
943 |
hyps = remove_hyps A hyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
944 |
tpairs = tpairs, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
945 |
prop = Logic.mk_implies (A, prop)}); |
0 | 946 |
|
1529 | 947 |
|
1220 | 948 |
(*Implication elimination |
67721 | 949 |
A \<Longrightarrow> B A |
1220 | 950 |
------------ |
951 |
B |
|
952 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
953 |
fun implies_elim thAB thA = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
954 |
let |
68691 | 955 |
val Thm (derA, {maxidx = maxidx1, hyps = hypsA, shyps = shypsA, tpairs = tpairsA, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
956 |
prop = propA, ...}) = thA |
68691 | 957 |
and Thm (der, {maxidx = maxidx2, hyps, shyps, tpairs, prop, ...}) = thAB; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
958 |
fun err () = raise THM ("implies_elim: major premise", 0, [thAB, thA]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
959 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
960 |
case prop of |
56245 | 961 |
Const ("Pure.imp", _) $ A $ B => |
20512 | 962 |
if A aconv propA then |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
963 |
Thm (deriv_rule2 (curry Proofterm.%%) der derA, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
964 |
{cert = join_certificate2 (thAB, thA), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
965 |
tags = [], |
68691 | 966 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
967 |
shyps = Sorts.union shypsA shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
968 |
hyps = union_hyps hypsA hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
969 |
tpairs = union_tpairs tpairsA tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
970 |
prop = B}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
971 |
else err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
972 |
| _ => err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
973 |
end; |
250 | 974 |
|
1220 | 975 |
(*Forall introduction. The Free or Var x must not be free in the hypotheses. |
16656 | 976 |
[x] |
977 |
: |
|
978 |
A |
|
979 |
------ |
|
67721 | 980 |
\<And>x. A |
1220 | 981 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
982 |
fun forall_intr |
68692
0c568ec56f37
proper maxidx: if x does not occur in A, its maxidx could get lost;
wenzelm
parents:
68691
diff
changeset
|
983 |
(ct as Cterm {maxidx = maxidx1, t = x, T, sorts, ...}) |
0c568ec56f37
proper maxidx: if x does not occur in A, its maxidx could get lost;
wenzelm
parents:
68691
diff
changeset
|
984 |
(th as Thm (der, {maxidx = maxidx2, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
985 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
986 |
fun result a = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
987 |
Thm (deriv_rule1 (Proofterm.forall_intr_proof x a) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
988 |
{cert = join_certificate1 (ct, th), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
989 |
tags = [], |
68692
0c568ec56f37
proper maxidx: if x does not occur in A, its maxidx could get lost;
wenzelm
parents:
68691
diff
changeset
|
990 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
991 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
992 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
993 |
tpairs = tpairs, |
46217
7b19666f0e3d
renamed Term.all to Logic.all_const, in accordance to HOLogic.all_const;
wenzelm
parents:
45443
diff
changeset
|
994 |
prop = Logic.all_const T $ Abs (a, T, abstract_over (x, prop))}); |
21798 | 995 |
fun check_occs a x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
996 |
if exists (fn t => Logic.occs (x, t)) ts then |
21798 | 997 |
raise THM ("forall_intr: variable " ^ quote a ^ " free in assumptions", 0, [th]) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
998 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
999 |
in |
52788 | 1000 |
(case x of |
21798 | 1001 |
Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result a) |
1002 |
| Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result a) |
|
52788 | 1003 |
| _ => raise THM ("forall_intr: not a variable", 0, [th])) |
0 | 1004 |
end; |
1005 |
||
1220 | 1006 |
(*Forall elimination |
67721 | 1007 |
\<And>x. A |
1220 | 1008 |
------ |
1009 |
A[t/x] |
|
1010 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1011 |
fun forall_elim |
68691 | 1012 |
(ct as Cterm {t, T, maxidx = maxidx1, sorts, ...}) |
1013 |
(th as Thm (der, {maxidx = maxidx2, shyps, hyps, tpairs, prop, ...})) = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1014 |
(case prop of |
56245 | 1015 |
Const ("Pure.all", Type ("fun", [Type ("fun", [qary, _]), _])) $ A => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1016 |
if T <> qary then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1017 |
raise THM ("forall_elim: type mismatch", 0, [th]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1018 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1019 |
Thm (deriv_rule1 (Proofterm.% o rpair (SOME t)) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1020 |
{cert = join_certificate1 (ct, th), |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1021 |
tags = [], |
68691 | 1022 |
maxidx = Int.max (maxidx1, maxidx2), |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1023 |
shyps = Sorts.union sorts shyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1024 |
hyps = hyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1025 |
tpairs = tpairs, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1026 |
prop = Term.betapply (A, t)}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1027 |
| _ => raise THM ("forall_elim: not quantified", 0, [th])); |
0 | 1028 |
|
1029 |
||
1220 | 1030 |
(* Equality *) |
0 | 1031 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1032 |
(*Reflexivity |
67721 | 1033 |
t \<equiv> t |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1034 |
*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1035 |
fun reflexive (Cterm {cert, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1036 |
Thm (deriv_rule0 Proofterm.reflexive, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1037 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1038 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1039 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1040 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1041 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1042 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1043 |
prop = Logic.mk_equals (t, t)}); |
0 | 1044 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1045 |
(*Symmetry |
67721 | 1046 |
t \<equiv> u |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1047 |
------ |
67721 | 1048 |
u \<equiv> t |
1220 | 1049 |
*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1050 |
fun symmetric (th as Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1051 |
(case prop of |
56245 | 1052 |
(eq as Const ("Pure.eq", _)) $ t $ u => |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1053 |
Thm (deriv_rule1 Proofterm.symmetric der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1054 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1055 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1056 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1057 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1058 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1059 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1060 |
prop = eq $ u $ t}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1061 |
| _ => raise THM ("symmetric", 0, [th])); |
0 | 1062 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1063 |
(*Transitivity |
67721 | 1064 |
t1 \<equiv> u u \<equiv> t2 |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1065 |
------------------ |
67721 | 1066 |
t1 \<equiv> t2 |
1220 | 1067 |
*) |
0 | 1068 |
fun transitive th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1069 |
let |
68691 | 1070 |
val Thm (der1, {maxidx = maxidx1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1071 |
prop = prop1, ...}) = th1 |
68691 | 1072 |
and Thm (der2, {maxidx = maxidx2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1073 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1074 |
fun err msg = raise THM ("transitive: " ^ msg, 0, [th1, th2]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1075 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1076 |
case (prop1, prop2) of |
56245 | 1077 |
((eq as Const ("Pure.eq", Type (_, [T, _]))) $ t1 $ u, Const ("Pure.eq", _) $ u' $ t2) => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1078 |
if not (u aconv u') then err "middle term" |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1079 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1080 |
Thm (deriv_rule2 (Proofterm.transitive u T) der1 der2, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1081 |
{cert = join_certificate2 (th1, th2), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1082 |
tags = [], |
68691 | 1083 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1084 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1085 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1086 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1087 |
prop = eq $ t1 $ t2}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1088 |
| _ => err "premises" |
0 | 1089 |
end; |
1090 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1091 |
(*Beta-conversion |
67721 | 1092 |
(\<lambda>x. t) u \<equiv> t[u/x] |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1093 |
fully beta-reduces the term if full = true |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1094 |
*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1095 |
fun beta_conversion full (Cterm {cert, t, T = _, maxidx, sorts}) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1096 |
let val t' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1097 |
if full then Envir.beta_norm t |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1098 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1099 |
(case t of Abs (_, _, bodt) $ u => subst_bound (u, bodt) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1100 |
| _ => raise THM ("beta_conversion: not a redex", 0, [])); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1101 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1102 |
Thm (deriv_rule0 Proofterm.reflexive, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1103 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1104 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1105 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1106 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1107 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1108 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1109 |
prop = Logic.mk_equals (t, t')}) |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1110 |
end; |
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1111 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1112 |
fun eta_conversion (Cterm {cert, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1113 |
Thm (deriv_rule0 Proofterm.reflexive, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1114 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1115 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1116 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1117 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1118 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1119 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1120 |
prop = Logic.mk_equals (t, Envir.eta_contract t)}); |
0 | 1121 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1122 |
fun eta_long_conversion (Cterm {cert, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1123 |
Thm (deriv_rule0 Proofterm.reflexive, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1124 |
{cert = cert, |
23493 | 1125 |
tags = [], |
1126 |
maxidx = maxidx, |
|
1127 |
shyps = sorts, |
|
1128 |
hyps = [], |
|
1129 |
tpairs = [], |
|
52131 | 1130 |
prop = Logic.mk_equals (t, Envir.eta_long [] t)}); |
23493 | 1131 |
|
0 | 1132 |
(*The abstraction rule. The Free or Var x must not be free in the hypotheses. |
1133 |
The bound variable will be named "a" (since x will be something like x320) |
|
67721 | 1134 |
t \<equiv> u |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1135 |
-------------- |
67721 | 1136 |
\<lambda>x. t \<equiv> \<lambda>x. u |
1220 | 1137 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1138 |
fun abstract_rule a |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1139 |
(Cterm {t = x, T, sorts, ...}) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1140 |
(th as Thm (der, {cert, maxidx, hyps, shyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1141 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1142 |
val (t, u) = Logic.dest_equals prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1143 |
handle TERM _ => raise THM ("abstract_rule: premise not an equality", 0, [th]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1144 |
val result = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1145 |
Thm (deriv_rule1 (Proofterm.abstract_rule x a) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1146 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1147 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1148 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1149 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1150 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1151 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1152 |
prop = Logic.mk_equals |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1153 |
(Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))}); |
21798 | 1154 |
fun check_occs a x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
1155 |
if exists (fn t => Logic.occs (x, t)) ts then |
21798 | 1156 |
raise THM ("abstract_rule: variable " ^ quote a ^ " free in assumptions", 0, [th]) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1157 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1158 |
in |
52788 | 1159 |
(case x of |
21798 | 1160 |
Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result) |
1161 |
| Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result) |
|
52788 | 1162 |
| _ => raise THM ("abstract_rule: not a variable", 0, [th])) |
0 | 1163 |
end; |
1164 |
||
1165 |
(*The combination rule |
|
67721 | 1166 |
f \<equiv> g t \<equiv> u |
1167 |
------------- |
|
1168 |
f t \<equiv> g u |
|
1220 | 1169 |
*) |
0 | 1170 |
fun combination th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1171 |
let |
68691 | 1172 |
val Thm (der1, {maxidx = maxidx1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1173 |
prop = prop1, ...}) = th1 |
68691 | 1174 |
and Thm (der2, {maxidx = maxidx2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1175 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1176 |
fun chktypes fT tT = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1177 |
(case fT of |
32784 | 1178 |
Type ("fun", [T1, _]) => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1179 |
if T1 <> tT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1180 |
raise THM ("combination: types", 0, [th1, th2]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1181 |
else () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1182 |
| _ => raise THM ("combination: not function type", 0, [th1, th2])); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1183 |
in |
52788 | 1184 |
(case (prop1, prop2) of |
56245 | 1185 |
(Const ("Pure.eq", Type ("fun", [fT, _])) $ f $ g, |
1186 |
Const ("Pure.eq", Type ("fun", [tT, _])) $ t $ u) => |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1187 |
(chktypes fT tT; |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1188 |
Thm (deriv_rule2 (Proofterm.combination f g t u fT) der1 der2, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1189 |
{cert = join_certificate2 (th1, th2), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1190 |
tags = [], |
68691 | 1191 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1192 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1193 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1194 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1195 |
prop = Logic.mk_equals (f $ t, g $ u)})) |
52788 | 1196 |
| _ => raise THM ("combination: premises", 0, [th1, th2])) |
0 | 1197 |
end; |
1198 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1199 |
(*Equality introduction |
67721 | 1200 |
A \<Longrightarrow> B B \<Longrightarrow> A |
3529 | 1201 |
---------------- |
67721 | 1202 |
A \<equiv> B |
1220 | 1203 |
*) |
0 | 1204 |
fun equal_intr th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1205 |
let |
68691 | 1206 |
val Thm (der1, {maxidx = maxidx1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1207 |
prop = prop1, ...}) = th1 |
68691 | 1208 |
and Thm (der2, {maxidx = maxidx2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1209 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1210 |
fun err msg = raise THM ("equal_intr: " ^ msg, 0, [th1, th2]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1211 |
in |
52788 | 1212 |
(case (prop1, prop2) of |
56245 | 1213 |
(Const("Pure.imp", _) $ A $ B, Const("Pure.imp", _) $ B' $ A') => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1214 |
if A aconv A' andalso B aconv B' then |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1215 |
Thm (deriv_rule2 (Proofterm.equal_intr A B) der1 der2, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1216 |
{cert = join_certificate2 (th1, th2), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1217 |
tags = [], |
68691 | 1218 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1219 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1220 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1221 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1222 |
prop = Logic.mk_equals (A, B)}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1223 |
else err "not equal" |
52788 | 1224 |
| _ => err "premises") |
1529 | 1225 |
end; |
1226 |
||
1227 |
(*The equal propositions rule |
|
67721 | 1228 |
A \<equiv> B A |
1529 | 1229 |
--------- |
1230 |
B |
|
1231 |
*) |
|
1232 |
fun equal_elim th1 th2 = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1233 |
let |
68691 | 1234 |
val Thm (der1, {maxidx = maxidx1, shyps = shyps1, hyps = hyps1, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1235 |
tpairs = tpairs1, prop = prop1, ...}) = th1 |
68691 | 1236 |
and Thm (der2, {maxidx = maxidx2, shyps = shyps2, hyps = hyps2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1237 |
tpairs = tpairs2, prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1238 |
fun err msg = raise THM ("equal_elim: " ^ msg, 0, [th1, th2]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1239 |
in |
52788 | 1240 |
(case prop1 of |
56245 | 1241 |
Const ("Pure.eq", _) $ A $ B => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1242 |
if prop2 aconv A then |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1243 |
Thm (deriv_rule2 (Proofterm.equal_elim A B) der1 der2, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1244 |
{cert = join_certificate2 (th1, th2), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1245 |
tags = [], |
68691 | 1246 |
maxidx = Int.max (maxidx1, maxidx2), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1247 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1248 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1249 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1250 |
prop = B}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1251 |
else err "not equal" |
52789 | 1252 |
| _ => err "major premise") |
1529 | 1253 |
end; |
0 | 1254 |
|
1220 | 1255 |
|
1256 |
||
0 | 1257 |
(**** Derived rules ****) |
1258 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1259 |
(*Smash unifies the list of term pairs leaving no flex-flex pairs. |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1260 |
Instantiates the theorem and deletes trivial tpairs. Resulting |
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1261 |
sequence may contain multiple elements if the tpairs are not all |
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1262 |
flex-flex.*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1263 |
fun flexflex_rule opt_ctxt (th as Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...})) = |
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1264 |
let val (context, cert') = make_context_certificate [th] opt_ctxt cert in |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1265 |
Unify.smash_unifiers context tpairs (Envir.empty maxidx) |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1266 |
|> Seq.map (fn env => |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1267 |
if Envir.is_empty env then th |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1268 |
else |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1269 |
let |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1270 |
val tpairs' = tpairs |> map (apply2 (Envir.norm_term env)) |
67721 | 1271 |
(*remove trivial tpairs, of the form t \<equiv> t*) |
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1272 |
|> filter_out (op aconv); |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1273 |
val der' = deriv_rule1 (Proofterm.norm_proof' env) der; |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1274 |
val prop' = Envir.norm_term env prop; |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1275 |
val maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'); |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1276 |
val shyps = Envir.insert_sorts env shyps; |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1277 |
in |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1278 |
Thm (der', {cert = cert', tags = [], maxidx = maxidx, |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1279 |
shyps = shyps, hyps = hyps, tpairs = tpairs', prop = prop'}) |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1280 |
end) |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1281 |
end; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1282 |
|
0 | 1283 |
|
19910 | 1284 |
(*Generalization of fixed variables |
1285 |
A |
|
1286 |
-------------------- |
|
1287 |
A[?'a/'a, ?x/x, ...] |
|
1288 |
*) |
|
1289 |
||
1290 |
fun generalize ([], []) _ th = th |
|
1291 |
| generalize (tfrees, frees) idx th = |
|
1292 |
let |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1293 |
val Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...}) = th; |
19910 | 1294 |
val _ = idx <= maxidx andalso raise THM ("generalize: bad index", idx, [th]); |
1295 |
||
33697 | 1296 |
val bad_type = |
1297 |
if null tfrees then K false |
|
1298 |
else Term.exists_subtype (fn TFree (a, _) => member (op =) tfrees a | _ => false); |
|
19910 | 1299 |
fun bad_term (Free (x, T)) = bad_type T orelse member (op =) frees x |
1300 |
| bad_term (Var (_, T)) = bad_type T |
|
1301 |
| bad_term (Const (_, T)) = bad_type T |
|
1302 |
| bad_term (Abs (_, T, t)) = bad_type T orelse bad_term t |
|
1303 |
| bad_term (t $ u) = bad_term t orelse bad_term u |
|
1304 |
| bad_term (Bound _) = false; |
|
1305 |
val _ = exists bad_term hyps andalso |
|
1306 |
raise THM ("generalize: variable free in assumptions", 0, [th]); |
|
1307 |
||
31977 | 1308 |
val gen = Term_Subst.generalize (tfrees, frees) idx; |
19910 | 1309 |
val prop' = gen prop; |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1310 |
val tpairs' = map (apply2 gen) tpairs; |
19910 | 1311 |
val maxidx' = maxidx_tpairs tpairs' (maxidx_of_term prop'); |
1312 |
in |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1313 |
Thm (deriv_rule1 (Proofterm.generalize (tfrees, frees) idx) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1314 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1315 |
tags = [], |
19910 | 1316 |
maxidx = maxidx', |
1317 |
shyps = shyps, |
|
1318 |
hyps = hyps, |
|
1319 |
tpairs = tpairs', |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1320 |
prop = prop'}) |
19910 | 1321 |
end; |
1322 |
||
67697 | 1323 |
fun generalize_cterm ([], []) _ ct = ct |
1324 |
| generalize_cterm (tfrees, frees) idx (ct as Cterm {cert, t, T, maxidx, sorts}) = |
|
1325 |
if idx <= maxidx then raise CTERM ("generalize_cterm: bad index", [ct]) |
|
1326 |
else |
|
1327 |
Cterm {cert = cert, sorts = sorts, |
|
1328 |
T = Term_Subst.generalizeT tfrees idx T, |
|
1329 |
t = Term_Subst.generalize (tfrees, frees) idx t, |
|
1330 |
maxidx = Int.max (maxidx, idx)}; |
|
1331 |
||
1332 |
fun generalize_ctyp [] _ cT = cT |
|
1333 |
| generalize_ctyp tfrees idx (Ctyp {cert, T, maxidx, sorts}) = |
|
1334 |
if idx <= maxidx then raise CTERM ("generalize_ctyp: bad index", []) |
|
1335 |
else |
|
1336 |
Ctyp {cert = cert, sorts = sorts, |
|
1337 |
T = Term_Subst.generalizeT tfrees idx T, |
|
1338 |
maxidx = Int.max (maxidx, idx)}; |
|
1339 |
||
19910 | 1340 |
|
22584 | 1341 |
(*Instantiation of schematic variables |
16656 | 1342 |
A |
1343 |
-------------------- |
|
1344 |
A[t1/v1, ..., tn/vn] |
|
1220 | 1345 |
*) |
0 | 1346 |
|
6928 | 1347 |
local |
1348 |
||
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26832
diff
changeset
|
1349 |
fun pretty_typing thy t T = Pretty.block |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26832
diff
changeset
|
1350 |
[Syntax.pretty_term_global thy t, Pretty.str " ::", Pretty.brk 1, Syntax.pretty_typ_global thy T]; |
15797 | 1351 |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1352 |
fun add_inst (v as (_, T), cu) (cert, sorts) = |
6928 | 1353 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1354 |
val Cterm {t = u, T = U, cert = cert2, sorts = sorts_u, maxidx = maxidx_u, ...} = cu; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1355 |
val cert' = Context.join_certificate (cert, cert2); |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1356 |
val sorts' = Sorts.union sorts_u sorts; |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
1357 |
in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1358 |
if T = U then ((v, (u, maxidx_u)), (cert', sorts')) |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
1359 |
else |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1360 |
let |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1361 |
val msg = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1362 |
(case cert' of |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1363 |
Context.Certificate thy' => |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1364 |
Pretty.string_of (Pretty.block |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1365 |
[Pretty.str "instantiate: type conflict", |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1366 |
Pretty.fbrk, pretty_typing thy' (Var v) T, |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1367 |
Pretty.fbrk, pretty_typing thy' u U]) |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1368 |
| Context.Certificate_Id _ => "instantiate: type conflict"); |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1369 |
in raise TYPE (msg, [T, U], [Var v, u]) end |
0 | 1370 |
end; |
1371 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1372 |
fun add_instT (v as (_, S), cU) (cert, sorts) = |
16656 | 1373 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1374 |
val Ctyp {T = U, cert = cert2, sorts = sorts_U, maxidx = maxidx_U, ...} = cU; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1375 |
val cert' = Context.join_certificate (cert, cert2); |
61051 | 1376 |
val thy' = Context.certificate_theory cert' |
1377 |
handle ERROR msg => raise CONTEXT (msg, [cU], [], [], NONE); |
|
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1378 |
val sorts' = Sorts.union sorts_U sorts; |
16656 | 1379 |
in |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1380 |
if Sign.of_sort thy' (U, S) then ((v, (U, maxidx_U)), (cert', sorts')) |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60638
diff
changeset
|
1381 |
else raise TYPE ("Type not of sort " ^ Syntax.string_of_sort_global thy' S, [U], []) |
16656 | 1382 |
end; |
0 | 1383 |
|
6928 | 1384 |
in |
1385 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1386 |
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...]. |
0 | 1387 |
Instantiates distinct Vars by terms of same type. |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1388 |
Does NOT normalize the resulting theorem!*) |
1529 | 1389 |
fun instantiate ([], []) th = th |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1390 |
| instantiate (instT, inst) th = |
16656 | 1391 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1392 |
val Thm (der, {cert, hyps, shyps, tpairs, prop, ...}) = th; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1393 |
val (inst', (instT', (cert', shyps'))) = |
61051 | 1394 |
(cert, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT |
61053 | 1395 |
handle CONTEXT (msg, cTs, cts, ths, context) => |
1396 |
raise CONTEXT (msg, cTs, cts, th :: ths, context); |
|
31977 | 1397 |
val subst = Term_Subst.instantiate_maxidx (instT', inst'); |
20512 | 1398 |
val (prop', maxidx1) = subst prop ~1; |
1399 |
val (tpairs', maxidx') = |
|
1400 |
fold_map (fn (t, u) => fn i => subst t i ||>> subst u) tpairs maxidx1; |
|
16656 | 1401 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1402 |
Thm (deriv_rule1 |
37309 | 1403 |
(fn d => Proofterm.instantiate (map (apsnd #1) instT', map (apsnd #1) inst') d) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1404 |
{cert = cert', |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1405 |
tags = [], |
20545
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1406 |
maxidx = maxidx', |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1407 |
shyps = shyps', |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1408 |
hyps = hyps, |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1409 |
tpairs = tpairs', |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1410 |
prop = prop'}) |
16656 | 1411 |
end |
1412 |
handle TYPE (msg, _, _) => raise THM (msg, 0, [th]); |
|
6928 | 1413 |
|
22584 | 1414 |
fun instantiate_cterm ([], []) ct = ct |
1415 |
| instantiate_cterm (instT, inst) ct = |
|
1416 |
let |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1417 |
val Cterm {cert, t, T, sorts, ...} = ct; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1418 |
val (inst', (instT', (cert', sorts'))) = |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1419 |
(cert, sorts) |> fold_map add_inst inst ||> fold_map add_instT instT; |
31977 | 1420 |
val subst = Term_Subst.instantiate_maxidx (instT', inst'); |
1421 |
val substT = Term_Subst.instantiateT_maxidx instT'; |
|
22584 | 1422 |
val (t', maxidx1) = subst t ~1; |
1423 |
val (T', maxidx') = substT T maxidx1; |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1424 |
in Cterm {cert = cert', t = t', T = T', sorts = sorts', maxidx = maxidx'} end |
22584 | 1425 |
handle TYPE (msg, _, _) => raise CTERM (msg, [ct]); |
1426 |
||
6928 | 1427 |
end; |
1428 |
||
0 | 1429 |
|
67721 | 1430 |
(*The trivial implication A \<Longrightarrow> A, justified by assume and forall rules. |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1431 |
A can contain Vars, not so for assume!*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1432 |
fun trivial (Cterm {cert, t = A, T, maxidx, sorts}) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1433 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1434 |
raise THM ("trivial: the term must have type prop", 0, []) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1435 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1436 |
Thm (deriv_rule0 (Proofterm.AbsP ("H", NONE, Proofterm.PBound 0)), |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1437 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1438 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1439 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1440 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1441 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1442 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1443 |
prop = Logic.mk_implies (A, A)}); |
0 | 1444 |
|
31944 | 1445 |
(*Axiom-scheme reflecting signature contents |
1446 |
T :: c |
|
1447 |
------------------- |
|
1448 |
OFCLASS(T, c_class) |
|
1449 |
*) |
|
1450 |
fun of_class (cT, raw_c) = |
|
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1451 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1452 |
val Ctyp {cert, T, ...} = cT; |
61051 | 1453 |
val thy = Context.certificate_theory cert |
1454 |
handle ERROR msg => raise CONTEXT (msg, [cT], [], [], NONE); |
|
31903 | 1455 |
val c = Sign.certify_class thy raw_c; |
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
1456 |
val Cterm {t = prop, maxidx, sorts, ...} = global_cterm_of thy (Logic.mk_of_class (T, c)); |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1457 |
in |
31944 | 1458 |
if Sign.of_sort thy (T, [c]) then |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1459 |
Thm (deriv_rule0 (Proofterm.OfClass (T, c)), |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1460 |
{cert = cert, |
31944 | 1461 |
tags = [], |
1462 |
maxidx = maxidx, |
|
1463 |
shyps = sorts, |
|
1464 |
hyps = [], |
|
1465 |
tpairs = [], |
|
1466 |
prop = prop}) |
|
1467 |
else raise THM ("of_class: type not of class " ^ Syntax.string_of_sort_global thy [c], 0, []) |
|
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1468 |
end; |
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1469 |
|
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1470 |
(*Remove extra sorts that are witnessed by type signature information*) |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1471 |
fun strip_shyps (thm as Thm (_, {shyps = [], ...})) = thm |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1472 |
| strip_shyps (thm as Thm (der, {cert, tags, maxidx, shyps, hyps, tpairs, prop})) = |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1473 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1474 |
val thy = theory_of_thm thm; |
36621
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1475 |
val algebra = Sign.classes_of thy; |
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1476 |
|
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1477 |
val present = (fold_terms o fold_types o fold_atyps_sorts) (insert (eq_fst op =)) thm []; |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1478 |
val extra = fold (Sorts.remove_sort o #2) present shyps; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1479 |
val witnessed = Sign.witness_sorts thy present extra; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1480 |
val extra' = fold (Sorts.remove_sort o #2) witnessed extra |
36621
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1481 |
|> Sorts.minimal_sorts algebra; |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1482 |
val shyps' = fold (Sorts.insert_sort o #2) present extra'; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1483 |
in |
37309 | 1484 |
Thm (deriv_rule_unconditional |
1485 |
(Proofterm.strip_shyps_proof algebra present witnessed extra') der, |
|
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1486 |
{cert = cert, tags = tags, maxidx = maxidx, |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1487 |
shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop}) |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1488 |
end; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1489 |
|
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1490 |
(*Internalize sort constraints of type variables*) |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1491 |
fun unconstrainT (thm as Thm (der, args)) = |
19505 | 1492 |
let |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1493 |
val Deriv {promises, body} = der; |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1494 |
val {cert, shyps, hyps, tpairs, prop, ...} = args; |
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1495 |
val thy = theory_of_thm thm; |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1496 |
|
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1497 |
fun err msg = raise THM ("unconstrainT: " ^ msg, 0, [thm]); |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1498 |
val _ = null hyps orelse err "illegal hyps"; |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1499 |
val _ = null tpairs orelse err "unsolved flex-flex constraints"; |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1500 |
val tfrees = rev (Term.add_tfree_names prop []); |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1501 |
val _ = null tfrees orelse err ("illegal free type variables " ^ commas_quote tfrees); |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1502 |
|
41700
f33d5a00c25d
thm_proof: visible fulfill_body only, without joining nested thms -- retain proof irrelevance, which is important for parallel performance;
wenzelm
parents:
41699
diff
changeset
|
1503 |
val ps = map (apsnd (Future.map fulfill_body)) promises; |
64573 | 1504 |
val (pthm, proof) = Proofterm.unconstrain_thm_proof thy shyps prop ps body; |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1505 |
val der' = make_deriv [] [] [pthm] proof; |
64573 | 1506 |
val prop' = Proofterm.thm_node_prop (#2 pthm); |
19505 | 1507 |
in |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1508 |
Thm (der', |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1509 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1510 |
tags = [], |
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1511 |
maxidx = maxidx_of_term prop', |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1512 |
shyps = [[]], (*potentially redundant*) |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1513 |
hyps = [], |
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1514 |
tpairs = [], |
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1515 |
prop = prop'}) |
19505 | 1516 |
end; |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1517 |
|
63611 | 1518 |
(*Replace all TFrees not fixed or in the hyps by new TVars*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1519 |
fun varifyT_global' fixed (Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...})) = |
12500 | 1520 |
let |
29272 | 1521 |
val tfrees = fold Term.add_tfrees hyps fixed; |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1522 |
val prop1 = attach_tpairs tpairs prop; |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35408
diff
changeset
|
1523 |
val (al, prop2) = Type.varify_global tfrees prop1; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1524 |
val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1525 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1526 |
(al, Thm (deriv_rule1 (Proofterm.varify_proof prop tfrees) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1527 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1528 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1529 |
maxidx = Int.max (0, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1530 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1531 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1532 |
tpairs = rev (map Logic.dest_equals ts), |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1533 |
prop = prop3})) |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1534 |
end; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1535 |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35408
diff
changeset
|
1536 |
val varifyT_global = #2 o varifyT_global' []; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1537 |
|
63611 | 1538 |
(*Replace all TVars by TFrees that are often new*) |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1539 |
fun legacy_freezeT (Thm (der, {cert, shyps, hyps, tpairs, prop, ...})) = |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1540 |
let |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1541 |
val prop1 = attach_tpairs tpairs prop; |
33832 | 1542 |
val prop2 = Type.legacy_freeze prop1; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1543 |
val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2); |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1544 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1545 |
Thm (deriv_rule1 (Proofterm.legacy_freezeT prop1) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1546 |
{cert = cert, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1547 |
tags = [], |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1548 |
maxidx = maxidx_of_term prop2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1549 |
shyps = shyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1550 |
hyps = hyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1551 |
tpairs = rev (map Logic.dest_equals ts), |
18127 | 1552 |
prop = prop3}) |
0 | 1553 |
end; |
1554 |
||
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1555 |
fun plain_prop_of raw_thm = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1556 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1557 |
val thm = strip_shyps raw_thm; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1558 |
fun err msg = raise THM ("plain_prop_of: " ^ msg, 0, [thm]); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1559 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1560 |
if not (null (hyps_of thm)) then |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1561 |
err "theorem may not contain hypotheses" |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1562 |
else if not (null (extra_shyps thm)) then |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1563 |
err "theorem may not contain sort hypotheses" |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1564 |
else if not (null (tpairs_of thm)) then |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1565 |
err "theorem may not contain flex-flex pairs" |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1566 |
else prop_of thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1567 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1568 |
|
0 | 1569 |
|
1570 |
(*** Inference rules for tactics ***) |
|
1571 |
||
1572 |
(*Destruct proof state into constraints, other goals, goal(i), rest *) |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1573 |
fun dest_state (state as Thm (_, {prop,tpairs,...}), i) = |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1574 |
(case Logic.strip_prems(i, [], prop) of |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1575 |
(B::rBs, C) => (tpairs, rev rBs, B, C) |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1576 |
| _ => raise THM("dest_state", i, [state])) |
0 | 1577 |
handle TERM _ => raise THM("dest_state", i, [state]); |
1578 |
||
46255 | 1579 |
(*Prepare orule for resolution by lifting it over the parameters and |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1580 |
assumptions of goal.*) |
18035 | 1581 |
fun lift_rule goal orule = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1582 |
let |
18035 | 1583 |
val Cterm {t = gprop, T, maxidx = gmax, sorts, ...} = goal; |
1584 |
val inc = gmax + 1; |
|
1585 |
val lift_abs = Logic.lift_abs inc gprop; |
|
1586 |
val lift_all = Logic.lift_all inc gprop; |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1587 |
val Thm (der, {maxidx, shyps, hyps, tpairs, prop, ...}) = orule; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1588 |
val (As, B) = Logic.strip_horn prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1589 |
in |
18035 | 1590 |
if T <> propT then raise THM ("lift_rule: the term must have type prop", 0, []) |
1591 |
else |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1592 |
Thm (deriv_rule1 (Proofterm.lift_proof gprop inc prop) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1593 |
{cert = join_certificate1 (goal, orule), |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1594 |
tags = [], |
18035 | 1595 |
maxidx = maxidx + inc, |
1596 |
shyps = Sorts.union shyps sorts, (*sic!*) |
|
1597 |
hyps = hyps, |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1598 |
tpairs = map (apply2 lift_abs) tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1599 |
prop = Logic.list_implies (map lift_all As, lift_all B)}) |
0 | 1600 |
end; |
1601 |
||
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1602 |
fun incr_indexes i (thm as Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1603 |
if i < 0 then raise THM ("negative increment", 0, [thm]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1604 |
else if i = 0 then thm |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1605 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1606 |
Thm (deriv_rule1 (Proofterm.incr_indexes i) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1607 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1608 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1609 |
maxidx = maxidx + i, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1610 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1611 |
hyps = hyps, |
59787 | 1612 |
tpairs = map (apply2 (Logic.incr_indexes ([], [], i))) tpairs, |
1613 |
prop = Logic.incr_indexes ([], [], i) prop}); |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1614 |
|
0 | 1615 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *) |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1616 |
fun assumption opt_ctxt i state = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1617 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1618 |
val Thm (der, {cert, maxidx, shyps, hyps, ...}) = state; |
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1619 |
val (context, cert') = make_context_certificate [state] opt_ctxt cert; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1620 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
32032 | 1621 |
fun newth n (env, tpairs) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1622 |
Thm (deriv_rule1 |
63858 | 1623 |
((if Envir.is_empty env then I else Proofterm.norm_proof' env) o |
37309 | 1624 |
Proofterm.assumption_proof Bs Bi n) der, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1625 |
{tags = [], |
32032 | 1626 |
maxidx = Envir.maxidx_of env, |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
1627 |
shyps = Envir.insert_sorts env shyps, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1628 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1629 |
tpairs = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1630 |
if Envir.is_empty env then tpairs |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1631 |
else map (apply2 (Envir.norm_term env)) tpairs, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1632 |
prop = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1633 |
if Envir.is_empty env then (*avoid wasted normalizations*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1634 |
Logic.list_implies (Bs, C) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1635 |
else (*normalize the new rule fully*) |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1636 |
Envir.norm_term env (Logic.list_implies (Bs, C)), |
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1637 |
cert = cert'}); |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1638 |
|
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1639 |
val (close, asms, concl) = Logic.assum_problems (~1, Bi); |
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1640 |
val concl' = close concl; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1641 |
fun addprfs [] _ = Seq.empty |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1642 |
| addprfs (asm :: rest) n = Seq.make (fn () => Seq.pull |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1643 |
(Seq.mapp (newth n) |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1644 |
(if Term.could_unify (asm, concl) then |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1645 |
(Unify.unifiers (context, Envir.empty maxidx, (close asm, concl') :: tpairs)) |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1646 |
else Seq.empty) |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1647 |
(addprfs rest (n + 1)))) |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1648 |
in addprfs asms 1 end; |
0 | 1649 |
|
250 | 1650 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. |
51604 | 1651 |
Checks if Bi's conclusion is alpha/eta-convertible to one of its assumptions*) |
0 | 1652 |
fun eq_assumption i state = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1653 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1654 |
val Thm (der, {cert, maxidx, shyps, hyps, ...}) = state; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1655 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1656 |
val (_, asms, concl) = Logic.assum_problems (~1, Bi); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1657 |
in |
52131 | 1658 |
(case find_index (fn asm => Envir.aeconv (asm, concl)) asms of |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1659 |
~1 => raise THM ("eq_assumption", 0, [state]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1660 |
| n => |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1661 |
Thm (deriv_rule1 (Proofterm.assumption_proof Bs Bi (n + 1)) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1662 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1663 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1664 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1665 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1666 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1667 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1668 |
prop = Logic.list_implies (Bs, C)})) |
0 | 1669 |
end; |
1670 |
||
1671 |
||
2671 | 1672 |
(*For rotate_tac: fast rotation of assumptions of subgoal i*) |
1673 |
fun rotate_rule k i state = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1674 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1675 |
val Thm (der, {cert, maxidx, shyps, hyps, ...}) = state; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1676 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
46218
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46217
diff
changeset
|
1677 |
val params = Term.strip_all_vars Bi; |
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46217
diff
changeset
|
1678 |
val rest = Term.strip_all_body Bi; |
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46217
diff
changeset
|
1679 |
val asms = Logic.strip_imp_prems rest |
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46217
diff
changeset
|
1680 |
val concl = Logic.strip_imp_concl rest; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1681 |
val n = length asms; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1682 |
val m = if k < 0 then n + k else k; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1683 |
val Bi' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1684 |
if 0 = m orelse m = n then Bi |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1685 |
else if 0 < m andalso m < n then |
19012 | 1686 |
let val (ps, qs) = chop m asms |
46218
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46217
diff
changeset
|
1687 |
in Logic.list_all (params, Logic.list_implies (qs @ ps, concl)) end |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1688 |
else raise THM ("rotate_rule", k, [state]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1689 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1690 |
Thm (deriv_rule1 (Proofterm.rotate_proof Bs Bi m) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1691 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1692 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1693 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1694 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1695 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1696 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1697 |
prop = Logic.list_implies (Bs @ [Bi'], C)}) |
2671 | 1698 |
end; |
1699 |
||
1700 |
||
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1701 |
(*Rotates a rule's premises to the left by k, leaving the first j premises |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1702 |
unchanged. Does nothing if k=0 or if k equals n-j, where n is the |
58837 | 1703 |
number of premises. Useful with eresolve_tac and underlies defer_tac*) |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1704 |
fun permute_prems j k rl = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1705 |
let |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1706 |
val Thm (der, {cert, maxidx, shyps, hyps, tpairs, prop, ...}) = rl; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1707 |
val prems = Logic.strip_imp_prems prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1708 |
and concl = Logic.strip_imp_concl prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1709 |
val moved_prems = List.drop (prems, j) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1710 |
and fixed_prems = List.take (prems, j) |
43278 | 1711 |
handle General.Subscript => raise THM ("permute_prems: j", j, [rl]); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1712 |
val n_j = length moved_prems; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1713 |
val m = if k < 0 then n_j + k else k; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1714 |
val prop' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1715 |
if 0 = m orelse m = n_j then prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1716 |
else if 0 < m andalso m < n_j then |
19012 | 1717 |
let val (ps, qs) = chop m moved_prems |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1718 |
in Logic.list_implies (fixed_prems @ qs @ ps, concl) end |
16725 | 1719 |
else raise THM ("permute_prems: k", k, [rl]); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1720 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1721 |
Thm (deriv_rule1 (Proofterm.permute_prems_proof prems j m) der, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1722 |
{cert = cert, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1723 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1724 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1725 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1726 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1727 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1728 |
prop = prop'}) |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1729 |
end; |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1730 |
|
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1731 |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1732 |
(* strip_apply f B A strips off all assumptions/parameters from A |
0 | 1733 |
introduced by lifting over B, and applies f to remaining part of A*) |
1734 |
fun strip_apply f = |
|
56245 | 1735 |
let fun strip (Const ("Pure.imp", _) $ _ $ B1) |
1736 |
(Const ("Pure.imp", _) $ A2 $ B2) = Logic.mk_implies (A2, strip B1 B2) |
|
1737 |
| strip ((c as Const ("Pure.all", _)) $ Abs (_, _, t1)) |
|
1738 |
( Const ("Pure.all", _) $ Abs (a, T, t2)) = c $ Abs (a, T, strip t1 t2) |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1739 |
| strip _ A = f A |
0 | 1740 |
in strip end; |
1741 |
||
56245 | 1742 |
fun strip_lifted (Const ("Pure.imp", _) $ _ $ B1) |
1743 |
(Const ("Pure.imp", _) $ _ $ B2) = strip_lifted B1 B2 |
|
1744 |
| strip_lifted (Const ("Pure.all", _) $ Abs (_, _, t1)) |
|
1745 |
(Const ("Pure.all", _) $ Abs (_, _, t2)) = strip_lifted t1 t2 |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1746 |
| strip_lifted _ A = A; |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1747 |
|
0 | 1748 |
(*Use the alist to rename all bound variables and some unknowns in a term |
1749 |
dpairs = current disagreement pairs; tpairs = permanent ones (flexflex); |
|
1750 |
Preserves unknowns in tpairs and on lhs of dpairs. *) |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1751 |
fun rename_bvs [] _ _ _ _ = K I |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1752 |
| rename_bvs al dpairs tpairs B As = |
20330 | 1753 |
let |
1754 |
val add_var = fold_aterms (fn Var ((x, _), _) => insert (op =) x | _ => I); |
|
1755 |
val vids = [] |
|
1756 |
|> fold (add_var o fst) dpairs |
|
1757 |
|> fold (add_var o fst) tpairs |
|
1758 |
|> fold (add_var o snd) tpairs; |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1759 |
val vids' = fold (add_var o strip_lifted B) As []; |
250 | 1760 |
(*unknowns appearing elsewhere be preserved!*) |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1761 |
val al' = distinct ((op =) o apply2 fst) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1762 |
(filter_out (fn (x, y) => |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1763 |
not (member (op =) vids' x) orelse |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1764 |
member (op =) vids x orelse member (op =) vids y) al); |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1765 |
val unchanged = filter_out (AList.defined (op =) al') vids'; |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1766 |
fun del_clashing clash xs _ [] qs = |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1767 |
if clash then del_clashing false xs xs qs [] else qs |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1768 |
| del_clashing clash xs ys ((p as (x, y)) :: ps) qs = |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1769 |
if member (op =) ys y |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1770 |
then del_clashing true (x :: xs) (x :: ys) ps qs |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1771 |
else del_clashing clash xs (y :: ys) ps (p :: qs); |
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46475
diff
changeset
|
1772 |
val al'' = del_clashing false unchanged unchanged al' []; |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1773 |
fun rename (t as Var ((x, i), T)) = |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1774 |
(case AList.lookup (op =) al'' x of |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1775 |
SOME y => Var ((y, i), T) |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1776 |
| NONE => t) |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1777 |
| rename (Abs (x, T, t)) = |
18944 | 1778 |
Abs (the_default x (AList.lookup (op =) al x), T, rename t) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1779 |
| rename (f $ t) = rename f $ rename t |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1780 |
| rename t = t; |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1781 |
fun strip_ren f Ai = f rename B Ai |
20330 | 1782 |
in strip_ren end; |
0 | 1783 |
|
1784 |
(*Function to rename bounds/unknowns in the argument, lifted over B*) |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1785 |
fun rename_bvars dpairs = |
48263 | 1786 |
rename_bvs (fold_rev Term.match_bvars dpairs []) dpairs; |
0 | 1787 |
|
1788 |
||
1789 |
(*** RESOLUTION ***) |
|
1790 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1791 |
(** Lifting optimizations **) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1792 |
|
0 | 1793 |
(*strip off pairs of assumptions/parameters in parallel -- they are |
1794 |
identical because of lifting*) |
|
56245 | 1795 |
fun strip_assums2 (Const("Pure.imp", _) $ _ $ B1, |
1796 |
Const("Pure.imp", _) $ _ $ B2) = strip_assums2 (B1,B2) |
|
1797 |
| strip_assums2 (Const("Pure.all",_)$Abs(a,T,t1), |
|
1798 |
Const("Pure.all",_)$Abs(_,_,t2)) = |
|
0 | 1799 |
let val (B1,B2) = strip_assums2 (t1,t2) |
1800 |
in (Abs(a,T,B1), Abs(a,T,B2)) end |
|
1801 |
| strip_assums2 BB = BB; |
|
1802 |
||
1803 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1804 |
(*Faster normalization: skip assumptions that were lifted over*) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1805 |
fun norm_term_skip env 0 t = Envir.norm_term env t |
56245 | 1806 |
| norm_term_skip env n (Const ("Pure.all", _) $ Abs (a, T, t)) = |
32032 | 1807 |
let |
58946
3bf80312508e
proper Envir.norm_type for result of Unify.unifiers (amending 479832ff2d29 from 20 years ago);
wenzelm
parents:
58837
diff
changeset
|
1808 |
val T' = Envir.norm_type (Envir.type_env env) T |
32032 | 1809 |
(*Must instantiate types of parameters because they are flattened; |
1810 |
this could be a NEW parameter*) |
|
46217
7b19666f0e3d
renamed Term.all to Logic.all_const, in accordance to HOLogic.all_const;
wenzelm
parents:
45443
diff
changeset
|
1811 |
in Logic.all_const T' $ Abs (a, T', norm_term_skip env n t) end |
56245 | 1812 |
| norm_term_skip env n (Const ("Pure.imp", _) $ A $ B) = |
32032 | 1813 |
Logic.mk_implies (A, norm_term_skip env (n - 1) B) |
32784 | 1814 |
| norm_term_skip _ _ _ = error "norm_term_skip: too few assumptions??"; |
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1815 |
|
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1816 |
|
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1817 |
(*unify types of schematic variables (non-lifted case)*) |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1818 |
fun unify_var_types context (th1, th2) env = |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1819 |
let |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1820 |
fun unify_vars (T :: Us) = fold (fn U => Pattern.unify_types context (T, U)) Us |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1821 |
| unify_vars _ = I; |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1822 |
val add_vars = |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1823 |
full_prop_of #> |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1824 |
fold_aterms (fn Var v => Vartab.insert_list (op =) v | _ => I); |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1825 |
val vars = Vartab.empty |> add_vars th1 |> add_vars th2; |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1826 |
in SOME (Vartab.fold (unify_vars o #2) vars env) end |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1827 |
handle Pattern.Unif => NONE; |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1828 |
|
0 | 1829 |
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C) |
250 | 1830 |
Unifies B with Bi, replacing subgoal i (1 <= i <= n) |
0 | 1831 |
If match then forbid instantiations in proof state |
1832 |
If lifted then shorten the dpair using strip_assums2. |
|
1833 |
If eres_flg then simultaneously proves A1 by assumption. |
|
250 | 1834 |
nsubgoal is the number of new subgoals (written m above). |
0 | 1835 |
Curried so that resolution calls dest_state only once. |
1836 |
*) |
|
4270 | 1837 |
local exception COMPOSE |
0 | 1838 |
in |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1839 |
fun bicompose_aux opt_ctxt {flatten, match, incremented} (state, (stpairs, Bs, Bi, C), lifted) |
0 | 1840 |
(eres_flg, orule, nsubgoal) = |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1841 |
let val Thm (sder, {maxidx=smax, shyps=sshyps, hyps=shyps, ...}) = state |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1842 |
and Thm (rder, {maxidx=rmax, shyps=rshyps, hyps=rhyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1843 |
tpairs=rtpairs, prop=rprop,...}) = orule |
1529 | 1844 |
(*How many hyps to skip over during normalization*) |
21576 | 1845 |
and nlift = Logic.count_prems (strip_all_body Bi) + (if eres_flg then ~1 else 0) |
64981
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1846 |
val (context, cert) = |
ea6199b23dfa
proper background certificate from make_context, which can be a super-theory of the direct join (amending d07464875dd4);
wenzelm
parents:
64574
diff
changeset
|
1847 |
make_context_certificate [state, orule] opt_ctxt (join_certificate2 (state, orule)); |
67721 | 1848 |
(*Add new theorem with prop = "\<lbrakk>Bs; As\<rbrakk> \<Longrightarrow> C" to thq*) |
32032 | 1849 |
fun addth A (As, oldAs, rder', n) ((env, tpairs), thq) = |
250 | 1850 |
let val normt = Envir.norm_term env; |
1851 |
(*perform minimal copying here by examining env*) |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1852 |
val (ntpairs, normp) = |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1853 |
if Envir.is_empty env then (tpairs, (Bs @ As, C)) |
250 | 1854 |
else |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1855 |
let val ntps = map (apply2 normt) tpairs |
19861 | 1856 |
in if Envir.above env smax then |
1238 | 1857 |
(*no assignments in state; normalize the rule only*) |
1858 |
if lifted |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1859 |
then (ntps, (Bs @ map (norm_term_skip env nlift) As, C)) |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1860 |
else (ntps, (Bs @ map normt As, C)) |
1529 | 1861 |
else if match then raise COMPOSE |
250 | 1862 |
else (*normalize the new rule fully*) |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1863 |
(ntps, (map normt (Bs @ As), normt C)) |
250 | 1864 |
end |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1865 |
val th = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1866 |
Thm (deriv_rule2 |
11518 | 1867 |
((if Envir.is_empty env then I |
19861 | 1868 |
else if Envir.above env smax then |
37309 | 1869 |
(fn f => fn der => f (Proofterm.norm_proof' env der)) |
11518 | 1870 |
else |
37309 | 1871 |
curry op oo (Proofterm.norm_proof' env)) |
1872 |
(Proofterm.bicompose_proof flatten Bs oldAs As A n (nlift+1))) rder' sder, |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1873 |
{tags = [], |
32032 | 1874 |
maxidx = Envir.maxidx_of env, |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
1875 |
shyps = Envir.insert_sorts env (Sorts.union rshyps sshyps), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1876 |
hyps = union_hyps rhyps shyps, |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1877 |
tpairs = ntpairs, |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1878 |
prop = Logic.list_implies normp, |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1879 |
cert = cert}) |
19475 | 1880 |
in Seq.cons th thq end handle COMPOSE => thq; |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1881 |
val (rAs,B) = Logic.strip_prems(nsubgoal, [], rprop) |
0 | 1882 |
handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]); |
1883 |
(*Modify assumptions, deleting n-th if n>0 for e-resolution*) |
|
1884 |
fun newAs(As0, n, dpairs, tpairs) = |
|
11518 | 1885 |
let val (As1, rder') = |
25939 | 1886 |
if not lifted then (As0, rder) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1887 |
else |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1888 |
let val rename = rename_bvars dpairs tpairs B As0 |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1889 |
in (map (rename strip_apply) As0, |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1890 |
deriv_rule1 (Proofterm.map_proof_terms (rename K) I) rder) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1891 |
end; |
18486 | 1892 |
in (map (if flatten then (Logic.flatten_params n) else I) As1, As1, rder', n) |
250 | 1893 |
handle TERM _ => |
1894 |
raise THM("bicompose: 1st premise", 0, [orule]) |
|
0 | 1895 |
end; |
1896 |
val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi); |
|
1897 |
val dpairs = BBi :: (rtpairs@stpairs); |
|
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1898 |
|
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1899 |
(*elim-resolution: try each assumption in turn*) |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1900 |
fun eres _ [] = raise THM ("bicompose: no premises", 0, [orule, state]) |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1901 |
| eres env (A1 :: As) = |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1902 |
let |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1903 |
val A = SOME A1; |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1904 |
val (close, asms, concl) = Logic.assum_problems (nlift + 1, A1); |
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1905 |
val concl' = close concl; |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1906 |
fun tryasms [] _ = Seq.empty |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1907 |
| tryasms (asm :: rest) n = |
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1908 |
if Term.could_unify (asm, concl) then |
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1909 |
let val asm' = close asm in |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1910 |
(case Seq.pull (Unify.unifiers (context, env, (asm', concl') :: dpairs)) of |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1911 |
NONE => tryasms rest (n + 1) |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1912 |
| cell as SOME ((_, tpairs), _) => |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1913 |
Seq.it_right (addth A (newAs (As, n, [BBi, (concl', asm')], tpairs))) |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1914 |
(Seq.make (fn () => cell), |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1915 |
Seq.make (fn () => Seq.pull (tryasms rest (n + 1))))) |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1916 |
end |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1917 |
else tryasms rest (n + 1); |
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1918 |
in tryasms asms 1 end; |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1919 |
|
0 | 1920 |
(*ordinary resolution*) |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1921 |
fun res env = |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1922 |
(case Seq.pull (Unify.unifiers (context, env, dpairs)) of |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1923 |
NONE => Seq.empty |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1924 |
| cell as SOME ((_, tpairs), _) => |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1925 |
Seq.it_right (addth NONE (newAs (rev rAs, 0, [BBi], tpairs))) |
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1926 |
(Seq.make (fn () => cell), Seq.empty)); |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1927 |
|
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1928 |
val env0 = Envir.empty (Int.max (rmax, smax)); |
30554
73f8bd5f0af8
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm
parents:
30466
diff
changeset
|
1929 |
in |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1930 |
(case if incremented then SOME env0 else unify_var_types context (state, orule) env0 of |
52222
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1931 |
NONE => Seq.empty |
0fa3b456a267
unify types of schematic variables in non-lifted case (i.e. "compose variants") -- allow schematic polymorphism, without revisiting HO-unification;
wenzelm
parents:
52131
diff
changeset
|
1932 |
| SOME env => if eres_flg then eres env (rev rAs) else res env) |
0 | 1933 |
end; |
7528 | 1934 |
end; |
0 | 1935 |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1936 |
fun bicompose opt_ctxt flags arg i state = |
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1937 |
bicompose_aux opt_ctxt flags (state, dest_state (state,i), false) arg; |
0 | 1938 |
|
1939 |
(*Quick test whether rule is resolvable with the subgoal with hyps Hs |
|
1940 |
and conclusion B. If eres_flg then checks 1st premise of rule also*) |
|
1941 |
fun could_bires (Hs, B, eres_flg, rule) = |
|
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29003
diff
changeset
|
1942 |
let fun could_reshyp (A1::_) = exists (fn H => Term.could_unify (A1, H)) Hs |
250 | 1943 |
| could_reshyp [] = false; (*no premise -- illegal*) |
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
29003
diff
changeset
|
1944 |
in Term.could_unify(concl_of rule, B) andalso |
250 | 1945 |
(not eres_flg orelse could_reshyp (prems_of rule)) |
0 | 1946 |
end; |
1947 |
||
1948 |
(*Bi-resolution of a state with a list of (flag,rule) pairs. |
|
1949 |
Puts the rule above: rule/state. Renames vars in the rules. *) |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1950 |
fun biresolution opt_ctxt match brules i state = |
18035 | 1951 |
let val (stpairs, Bs, Bi, C) = dest_state(state,i); |
18145 | 1952 |
val lift = lift_rule (cprem_of state i); |
250 | 1953 |
val B = Logic.strip_assums_concl Bi; |
1954 |
val Hs = Logic.strip_assums_hyp Bi; |
|
52223
5bb6ae8acb87
tuned signature -- more explicit flags for low-level Thm.bicompose;
wenzelm
parents:
52222
diff
changeset
|
1955 |
val compose = |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1956 |
bicompose_aux opt_ctxt {flatten = true, match = match, incremented = true} |
52223
5bb6ae8acb87
tuned signature -- more explicit flags for low-level Thm.bicompose;
wenzelm
parents:
52222
diff
changeset
|
1957 |
(state, (stpairs, Bs, Bi, C), true); |
4270 | 1958 |
fun res [] = Seq.empty |
250 | 1959 |
| res ((eres_flg, rule)::brules) = |
61044
b7af255dd200
more abstract theory certificate, which is not necessarily the full theory;
wenzelm
parents:
61042
diff
changeset
|
1960 |
if Config.get_generic (make_context [state] opt_ctxt (cert_of state)) |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1961 |
Pattern.unify_trace_failure orelse could_bires (Hs, B, eres_flg, rule) |
4270 | 1962 |
then Seq.make (*delay processing remainder till needed*) |
22573 | 1963 |
(fn()=> SOME(compose (eres_flg, lift rule, nprems_of rule), |
250 | 1964 |
res brules)) |
1965 |
else res brules |
|
4270 | 1966 |
in Seq.flat (res brules) end; |
0 | 1967 |
|
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1968 |
(*Resolution: exactly one resolvent must be produced*) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1969 |
fun tha RSN (i, thb) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1970 |
(case Seq.chop 2 (biresolution NONE false [(false, tha)] i thb) of |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1971 |
([th], _) => th |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1972 |
| ([], _) => raise THM ("RSN: no unifiers", i, [tha, thb]) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1973 |
| _ => raise THM ("RSN: multiple unifiers", i, [tha, thb])); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1974 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1975 |
(*Resolution: P \<Longrightarrow> Q, Q \<Longrightarrow> R gives P \<Longrightarrow> R*) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1976 |
fun tha RS thb = tha RSN (1,thb); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1977 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1978 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1979 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1980 |
(*** sort algebra within the logic ***) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1981 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1982 |
fun standard_tvars thm = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1983 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1984 |
val thy = theory_of_thm thm; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1985 |
val tvars = rev (Term.add_tvars (prop_of thm) []); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1986 |
val names = Name.invent Name.context Name.aT (length tvars); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1987 |
val tinst = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1988 |
map2 (fn (ai, S) => fn b => ((ai, S), global_ctyp_of thy (TVar ((b, 0), S)))) tvars names; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1989 |
in instantiate (tinst, []) thm end |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1990 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1991 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1992 |
(* class relations *) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1993 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1994 |
fun the_classrel thy (c1, c2) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1995 |
(case Symreltab.lookup (get_classrels thy) (c1, c2) of |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1996 |
SOME thm => transfer thy thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1997 |
| NONE => error ("Unproven class relation " ^ |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1998 |
Syntax.string_of_classrel (Proof_Context.init_global thy) [c1, c2])); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
1999 |
|
70457 | 2000 |
val is_classrel = Symreltab.defined o get_classrels; |
2001 |
||
70456
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2002 |
fun complete_classrels thy = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2003 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2004 |
fun complete (c, (_, (all_preds, all_succs))) (finished1, thy1) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2005 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2006 |
fun compl c1 c2 (finished2, thy2) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2007 |
if is_classrel thy2 (c1, c2) then (finished2, thy2) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2008 |
else |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2009 |
(false, |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2010 |
thy2 |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2011 |
|> (map_classrels o Symreltab.update) ((c1, c2), |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2012 |
(the_classrel thy2 (c1, c) RS the_classrel thy2 (c, c2)) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2013 |
|> standard_tvars |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2014 |
|> close_derivation |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2015 |
|> trim_context)); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2016 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2017 |
val proven = is_classrel thy1; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2018 |
val preds = Graph.Keys.fold (fn c1 => proven (c1, c) ? cons c1) all_preds []; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2019 |
val succs = Graph.Keys.fold (fn c2 => proven (c, c2) ? cons c2) all_succs []; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2020 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2021 |
fold_product compl preds succs (finished1, thy1) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2022 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2023 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2024 |
(case Graph.fold complete (Sorts.classes_of (Sign.classes_of thy)) (true, thy) of |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2025 |
(true, _) => NONE |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2026 |
| (_, thy') => SOME thy') |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2027 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2028 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2029 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2030 |
(* type arities *) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2031 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2032 |
fun the_arity thy (a, Ss, c) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2033 |
(case AList.lookup (op =) (Symtab.lookup_list (get_arities thy) a) (c, Ss) of |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2034 |
SOME (thm, _) => transfer thy thm |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2035 |
| NONE => error ("Unproven type arity " ^ |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2036 |
Syntax.string_of_arity (Proof_Context.init_global thy) (a, Ss, [c]))); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2037 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2038 |
fun thynames_of_arity thy (a, c) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2039 |
Symtab.lookup_list (get_arities thy) a |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2040 |
|> map_filter (fn ((c', _), (_, name)) => if c = c' then SOME name else NONE) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2041 |
|> rev; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2042 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2043 |
fun insert_arity_completions thy t ((c, Ss), ((th, thy_name))) (finished, arities) = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2044 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2045 |
val algebra = Sign.classes_of thy; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2046 |
val ars = Symtab.lookup_list arities t; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2047 |
val super_class_completions = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2048 |
Sign.super_classes thy c |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2049 |
|> filter_out (fn c1 => exists (fn ((c2, Ss2), _) => |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2050 |
c1 = c2 andalso Sorts.sorts_le algebra (Ss2, Ss)) ars); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2051 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2052 |
val completions = super_class_completions |> map (fn c1 => |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2053 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2054 |
val th1 = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2055 |
(th RS the_classrel thy (c, c1)) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2056 |
|> standard_tvars |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2057 |
|> close_derivation |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2058 |
|> trim_context; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2059 |
in ((th1, thy_name), c1) end); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2060 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2061 |
val finished' = finished andalso null completions; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2062 |
val arities' = fold (fn (th, c1) => Symtab.cons_list (t, ((c1, Ss), th))) completions arities; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2063 |
in (finished', arities') end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2064 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2065 |
fun put_arity_completion ((t, Ss, c), th) thy = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2066 |
let val ar = ((c, Ss), (th, Context.theory_name thy)) in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2067 |
thy |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2068 |
|> map_arities |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2069 |
(Symtab.insert_list (eq_fst op =) (t, ar) #> |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2070 |
curry (insert_arity_completions thy t ar) true #> #2) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2071 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2072 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2073 |
fun complete_arities thy = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2074 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2075 |
val arities = get_arities thy; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2076 |
val (finished, arities') = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2077 |
Symtab.fold (fn (t, ars) => fold (insert_arity_completions thy t) ars) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2078 |
arities (true, arities); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2079 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2080 |
if finished then NONE |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2081 |
else SOME (map_arities (K arities') thy) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2082 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2083 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2084 |
val _ = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2085 |
Theory.setup |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2086 |
(Theory.at_begin complete_classrels #> |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2087 |
Theory.at_begin complete_arities #> |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2088 |
Proofterm.install_axclass_proofs |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2089 |
{classrel_proof = proof_of oo the_classrel, |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2090 |
arity_proof = proof_of oo the_arity}); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2091 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2092 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2093 |
(* primitive rules *) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2094 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2095 |
fun add_classrel raw_th thy = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2096 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2097 |
val th = strip_shyps (transfer thy raw_th); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2098 |
val prop = plain_prop_of th; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2099 |
val (c1, c2) = Logic.dest_classrel prop; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2100 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2101 |
thy |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2102 |
|> Sign.primitive_classrel (c1, c2) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2103 |
|> map_classrels (Symreltab.update ((c1, c2), th |> unconstrainT |> trim_context)) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2104 |
|> perhaps complete_classrels |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2105 |
|> perhaps complete_arities |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2106 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2107 |
|
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2108 |
fun add_arity raw_th thy = |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2109 |
let |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2110 |
val th = strip_shyps (transfer thy raw_th); |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2111 |
val prop = plain_prop_of th; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2112 |
val (t, Ss, c) = Logic.dest_arity prop; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2113 |
in |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2114 |
thy |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2115 |
|> Sign.primitive_arity (t, Ss, [c]) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2116 |
|> put_arity_completion ((t, Ss, c), th |> unconstrainT |> trim_context) |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2117 |
end; |
c742527a25fe
clarified modules: inference kernel maintains sort algebra within the logic;
wenzelm
parents:
70454
diff
changeset
|
2118 |
|
0 | 2119 |
end; |
1503 | 2120 |
|
32104 | 2121 |
structure Basic_Thm: BASIC_THM = Thm; |
2122 |
open Basic_Thm; |