author | wenzelm |
Fri, 28 Aug 2015 11:53:09 +0200 | |
changeset 61039 | 80f40d89dab6 |
parent 60952 | 762cb38a3147 |
child 61042 | c2155072c2f4 |
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 |
||
6089 | 10 |
signature BASIC_THM = |
59589 | 11 |
sig |
59582 | 12 |
type ctyp |
13 |
type cterm |
|
14 |
exception CTERM of string * cterm list |
|
15 |
type thm |
|
16 |
type conv = cterm -> thm |
|
17 |
exception THM of string * int * thm list |
|
18 |
end; |
|
19 |
||
20 |
signature THM = |
|
21 |
sig |
|
22 |
include BASIC_THM |
|
1160 | 23 |
(*certified types*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
24 |
val typ_of: ctyp -> typ |
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
25 |
val global_ctyp_of: theory -> typ -> ctyp |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
26 |
val ctyp_of: Proof.context -> typ -> ctyp |
59582 | 27 |
val dest_ctyp: ctyp -> ctyp list |
1160 | 28 |
(*certified terms*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
29 |
val term_of: cterm -> term |
59586 | 30 |
val typ_of_cterm: cterm -> typ |
31 |
val ctyp_of_cterm: cterm -> ctyp |
|
32 |
val maxidx_of_cterm: cterm -> int |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
33 |
val global_cterm_of: theory -> term -> cterm |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
34 |
val cterm_of: Proof.context -> term -> cterm |
60315 | 35 |
val transfer_cterm: theory -> cterm -> cterm |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
36 |
val renamed_term: term -> cterm -> cterm |
59582 | 37 |
val dest_comb: cterm -> cterm * cterm |
38 |
val dest_fun: cterm -> cterm |
|
39 |
val dest_arg: cterm -> cterm |
|
40 |
val dest_fun2: cterm -> cterm |
|
41 |
val dest_arg1: cterm -> cterm |
|
42 |
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
|
43 |
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
|
44 |
val var: indexname * ctyp -> cterm |
59582 | 45 |
val apply: cterm -> cterm -> cterm |
46 |
val lambda_name: string * cterm -> cterm -> cterm |
|
47 |
val lambda: cterm -> cterm -> cterm |
|
48 |
val adjust_maxidx_cterm: int -> cterm -> cterm |
|
49 |
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
|
50 |
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
|
51 |
((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
|
52 |
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
|
53 |
((indexname * sort) * ctyp) list * ((indexname * typ) * cterm) list |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
54 |
(*theorems*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
55 |
val rep_thm: thm -> |
52788 | 56 |
{thy: theory, |
28017 | 57 |
tags: Properties.T, |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
58 |
maxidx: int, |
39687 | 59 |
shyps: sort Ord_List.T, |
60 |
hyps: term Ord_List.T, |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
61 |
tpairs: (term * term) list, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
62 |
prop: term} |
59582 | 63 |
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
|
64 |
val fold_atomic_ctyps: (ctyp -> 'a -> 'a) -> thm -> 'a -> 'a |
60818 | 65 |
val fold_atomic_cterms: (cterm -> 'a -> 'a) -> thm -> 'a -> 'a |
59582 | 66 |
val terms_of_tpairs: (term * term) list -> term list |
67 |
val full_prop_of: thm -> term |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
68 |
val theory_of_thm: thm -> theory |
60948 | 69 |
val theory_id_of_thm: thm -> Context.theory_id |
60638 | 70 |
val theory_name_of_thm: thm -> string |
59582 | 71 |
val maxidx_of: thm -> int |
72 |
val maxidx_thm: thm -> int -> int |
|
61039 | 73 |
val shyps_of: thm -> sort Ord_List.T |
59582 | 74 |
val hyps_of: thm -> term list |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
75 |
val prop_of: thm -> term |
59582 | 76 |
val tpairs_of: thm -> (term * term) list |
16656 | 77 |
val concl_of: thm -> term |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
78 |
val prems_of: thm -> term list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
79 |
val nprems_of: thm -> int |
59582 | 80 |
val no_prems: thm -> bool |
81 |
val major_prem_of: thm -> term |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
82 |
val cprop_of: thm -> cterm |
18145 | 83 |
val cprem_of: thm -> int -> cterm |
60949 | 84 |
val chyps_of: thm -> cterm list |
38709 | 85 |
val transfer: theory -> thm -> thm |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
86 |
val renamed_prop: term -> thm -> thm |
38709 | 87 |
val weaken: cterm -> thm -> thm |
88 |
val weaken_sorts: sort list -> cterm -> cterm |
|
89 |
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
|
90 |
val proof_bodies_of: thm list -> proof_body list |
32725 | 91 |
val proof_body_of: thm -> proof_body |
92 |
val proof_of: thm -> proof |
|
44331 | 93 |
val join_proofs: thm list -> unit |
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
49008
diff
changeset
|
94 |
val peek_status: thm -> {oracle: bool, unfinished: bool, failed: bool} |
32725 | 95 |
val future: thm future -> cterm -> thm |
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
|
96 |
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
|
97 |
val name_derivation: string -> thm -> thm |
28675
fb68c0767004
renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents:
28648
diff
changeset
|
98 |
val axiom: theory -> string -> thm |
fb68c0767004
renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents:
28648
diff
changeset
|
99 |
val axioms_of: theory -> (string * thm) list |
28017 | 100 |
val get_tags: thm -> Properties.T |
101 |
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
|
102 |
val norm_proof: thm -> thm |
20261 | 103 |
val adjust_maxidx_thm: int -> thm -> thm |
59589 | 104 |
(*inference rules*) |
38709 | 105 |
val assume: cterm -> thm |
106 |
val implies_intr: cterm -> thm -> thm |
|
107 |
val implies_elim: thm -> thm -> thm |
|
108 |
val forall_intr: cterm -> thm -> thm |
|
109 |
val forall_elim: cterm -> thm -> thm |
|
110 |
val reflexive: cterm -> thm |
|
111 |
val symmetric: thm -> thm |
|
112 |
val transitive: thm -> thm -> thm |
|
113 |
val beta_conversion: bool -> conv |
|
114 |
val eta_conversion: conv |
|
115 |
val eta_long_conversion: conv |
|
116 |
val abstract_rule: string -> cterm -> thm -> thm |
|
117 |
val combination: thm -> thm -> thm |
|
118 |
val equal_intr: thm -> thm -> thm |
|
119 |
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
|
120 |
val flexflex_rule: Proof.context option -> thm -> thm Seq.seq |
38709 | 121 |
val generalize: string list * string list -> int -> thm -> thm |
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
|
122 |
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
|
123 |
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
|
124 |
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
|
125 |
cterm -> cterm |
38709 | 126 |
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
|
127 |
val of_class: ctyp * class -> thm |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
128 |
val strip_shyps: thm -> thm |
36768
46be86127972
just one version of Thm.unconstrainT, which affects all variables;
wenzelm
parents:
36744
diff
changeset
|
129 |
val unconstrainT: thm -> thm |
38709 | 130 |
val varifyT_global': (string * sort) list -> thm -> ((string * sort) * indexname) list * thm |
131 |
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
|
132 |
val legacy_freezeT: thm -> thm |
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
133 |
val dest_state: thm * int -> (term * term) list * term list * term * term |
38709 | 134 |
val lift_rule: cterm -> thm -> thm |
135 |
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
|
136 |
val assumption: Proof.context option -> int -> thm -> thm Seq.seq |
31945 | 137 |
val eq_assumption: int -> thm -> thm |
138 |
val rotate_rule: int -> int -> thm -> thm |
|
139 |
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
|
140 |
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
|
141 |
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
|
142 |
val biresolution: Proof.context option -> bool -> (bool * thm) list -> int -> thm -> thm Seq.seq |
59589 | 143 |
(*oracles*) |
59917
9830c944670f
more uniform "verbose" option to print name space;
wenzelm
parents:
59884
diff
changeset
|
144 |
val extern_oracles: bool -> Proof.context -> (Markup.T * xstring) list |
30288
a32700e45ab3
Thm.add_oracle interface: replaced old bstring by binding;
wenzelm
parents:
29636
diff
changeset
|
145 |
val add_oracle: binding * ('a -> cterm) -> theory -> (string * ('a -> thm)) * theory |
6089 | 146 |
end; |
147 |
||
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
|
148 |
structure Thm: THM = |
0 | 149 |
struct |
250 | 150 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
151 |
(*** Certified terms and types ***) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
152 |
|
250 | 153 |
(** certified types **) |
154 |
||
52788 | 155 |
abstype ctyp = Ctyp of {thy: theory, T: typ, maxidx: int, sorts: sort Ord_List.T} |
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
|
156 |
with |
250 | 157 |
|
158 |
fun typ_of (Ctyp {T, ...}) = T; |
|
159 |
||
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
160 |
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
|
161 |
let |
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
162 |
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
|
163 |
val maxidx = Term.maxidx_of_typ T; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
164 |
val sorts = Sorts.insert_typ T []; |
52788 | 165 |
in Ctyp {thy = thy, T = T, maxidx = maxidx, sorts = sorts} end; |
250 | 166 |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
167 |
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
|
168 |
|
52788 | 169 |
fun dest_ctyp (Ctyp {thy, T = Type (_, Ts), maxidx, sorts}) = |
170 |
map (fn T => Ctyp {thy = thy, T = T, maxidx = maxidx, sorts = sorts}) Ts |
|
16679 | 171 |
| dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []); |
15087 | 172 |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
173 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
174 |
|
250 | 175 |
(** certified terms **) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
176 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
177 |
(*certified terms with checked typ, maxidx, and sorts*) |
52788 | 178 |
abstype cterm = Cterm of {thy: theory, t: term, T: typ, maxidx: int, sorts: sort Ord_List.T} |
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
|
179 |
with |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
180 |
|
22584 | 181 |
exception CTERM of string * cterm list; |
16679 | 182 |
|
250 | 183 |
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
|
184 |
|
59586 | 185 |
fun typ_of_cterm (Cterm {T, ...}) = T; |
186 |
||
187 |
fun ctyp_of_cterm (Cterm {thy, T, maxidx, sorts, ...}) = |
|
52788 | 188 |
Ctyp {thy = thy, T = T, maxidx = maxidx, sorts = sorts}; |
2671 | 189 |
|
59586 | 190 |
fun maxidx_of_cterm (Cterm {maxidx, ...}) = maxidx; |
191 |
||
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
192 |
fun global_cterm_of thy tm = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
193 |
let |
18969 | 194 |
val (t, T, maxidx) = Sign.certify_term thy tm; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
195 |
val sorts = Sorts.insert_term t []; |
52788 | 196 |
in Cterm {thy = 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
|
197 |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59591
diff
changeset
|
198 |
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
|
199 |
|
60315 | 200 |
fun merge_thys0 (Cterm {thy = thy1, ...}) (Cterm {thy = thy2, ...}) = |
201 |
Theory.merge (thy1, thy2); |
|
202 |
||
203 |
fun transfer_cterm thy' ct = |
|
204 |
let |
|
205 |
val Cterm {thy, t, T, maxidx, sorts} = ct; |
|
206 |
val _ = |
|
60948 | 207 |
Context.subthy (thy, thy') orelse |
60315 | 208 |
raise CTERM ("transfer_cterm: not a super theory", [ct]); |
209 |
in |
|
60948 | 210 |
if Context.eq_thy (thy, thy') then ct |
60315 | 211 |
else Cterm {thy = thy', t = t, T = T, maxidx = maxidx, sorts = sorts} |
212 |
end; |
|
213 |
||
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
214 |
fun renamed_term t' (Cterm {thy, t, T, maxidx, sorts}) = |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
215 |
if t aconv t' then Cterm {thy = thy, t = t', T = T, maxidx = maxidx, sorts = sorts} |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
216 |
else raise TERM ("renamed_term: terms disagree", [t, t']); |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
217 |
|
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
218 |
|
22909 | 219 |
(* destructors *) |
220 |
||
52788 | 221 |
fun dest_comb (Cterm {t = c $ a, T, thy, maxidx, sorts}) = |
22909 | 222 |
let val A = Term.argument_type_of c 0 in |
52788 | 223 |
(Cterm {t = c, T = A --> T, thy = thy, maxidx = maxidx, sorts = sorts}, |
224 |
Cterm {t = a, T = A, thy = thy, maxidx = maxidx, sorts = sorts}) |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
225 |
end |
22584 | 226 |
| 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
|
227 |
|
52788 | 228 |
fun dest_fun (Cterm {t = c $ _, T, thy, maxidx, sorts}) = |
22909 | 229 |
let val A = Term.argument_type_of c 0 |
52788 | 230 |
in Cterm {t = c, T = A --> T, thy = thy, maxidx = maxidx, sorts = sorts} end |
22909 | 231 |
| dest_fun ct = raise CTERM ("dest_fun", [ct]); |
232 |
||
52788 | 233 |
fun dest_arg (Cterm {t = c $ a, T = _, thy, maxidx, sorts}) = |
22909 | 234 |
let val A = Term.argument_type_of c 0 |
52788 | 235 |
in Cterm {t = a, T = A, thy = thy, maxidx = maxidx, sorts = sorts} end |
22584 | 236 |
| 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
|
237 |
|
22909 | 238 |
|
52788 | 239 |
fun dest_fun2 (Cterm {t = c $ _ $ _, T, thy, maxidx, sorts}) = |
22909 | 240 |
let |
241 |
val A = Term.argument_type_of c 0; |
|
242 |
val B = Term.argument_type_of c 1; |
|
52788 | 243 |
in Cterm {t = c, T = A --> B --> T, thy = thy, maxidx = maxidx, sorts = sorts} end |
22909 | 244 |
| dest_fun2 ct = raise CTERM ("dest_fun2", [ct]); |
245 |
||
52788 | 246 |
fun dest_arg1 (Cterm {t = c $ a $ _, T = _, thy, maxidx, sorts}) = |
22909 | 247 |
let val A = Term.argument_type_of c 0 |
52788 | 248 |
in Cterm {t = a, T = A, thy = thy, maxidx = maxidx, sorts = sorts} end |
22909 | 249 |
| dest_arg1 ct = raise CTERM ("dest_arg1", [ct]); |
20673 | 250 |
|
52788 | 251 |
fun dest_abs a (Cterm {t = Abs (x, T, t), T = Type ("fun", [_, U]), thy, maxidx, sorts}) = |
18944 | 252 |
let val (y', t') = Term.dest_abs (the_default x a, T, t) in |
52788 | 253 |
(Cterm {t = Free (y', T), T = T, thy = thy, maxidx = maxidx, sorts = sorts}, |
254 |
Cterm {t = t', T = U, thy = thy, maxidx = maxidx, sorts = sorts}) |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
255 |
end |
22584 | 256 |
| 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
|
257 |
|
22909 | 258 |
|
259 |
(* constructors *) |
|
260 |
||
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
261 |
fun rename_tvar (a, i) (Ctyp {thy, T, maxidx, sorts}) = |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
262 |
let |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
263 |
val S = |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
264 |
(case T of |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
265 |
TFree (_, S) => S |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
266 |
| TVar (_, S) => S |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
267 |
| _ => 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
|
268 |
val _ = if i < 0 then raise TYPE ("rename_tvar: bad index", [TVar ((a, i), S)], []) else (); |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
269 |
in Ctyp {thy = thy, T = TVar ((a, i), S), maxidx = Int.max (i, maxidx), sorts = sorts} end; |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
270 |
|
60951
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
271 |
fun var ((x, i), Ctyp {thy, T, maxidx, sorts}) = |
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
272 |
if i < 0 then raise TERM ("var: bad index", [Var ((x, i), T)]) |
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
273 |
else Cterm {thy = thy, t = Var ((x, i), T), T = T, maxidx = Int.max (i, maxidx), sorts = sorts}; |
b70c4db3874f
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60949
diff
changeset
|
274 |
|
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
|
275 |
fun apply |
16656 | 276 |
(cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...}) |
277 |
(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
|
278 |
if T = dty then |
52788 | 279 |
Cterm {thy = merge_thys0 cf cx, |
16656 | 280 |
t = f $ x, |
281 |
T = rty, |
|
282 |
maxidx = Int.max (maxidx1, maxidx2), |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
283 |
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
|
284 |
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
|
285 |
| apply cf cx = raise CTERM ("apply: first arg is not a function", [cf, cx]); |
250 | 286 |
|
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
|
287 |
fun lambda_name |
32198 | 288 |
(x, ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...}) |
16656 | 289 |
(ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) = |
32198 | 290 |
let val t = Term.lambda_name (x, t1) t2 in |
52788 | 291 |
Cterm {thy = merge_thys0 ct1 ct2, |
16656 | 292 |
t = t, T = T1 --> T2, |
293 |
maxidx = Int.max (maxidx1, maxidx2), |
|
294 |
sorts = Sorts.union sorts1 sorts2} |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
295 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
296 |
|
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
|
297 |
fun lambda t u = lambda_name ("", t) u; |
32198 | 298 |
|
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
299 |
|
22909 | 300 |
(* indexes *) |
301 |
||
52788 | 302 |
fun adjust_maxidx_cterm i (ct as Cterm {thy, t, T, maxidx, sorts}) = |
20580
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
303 |
if maxidx = i then ct |
6fb75df09253
added dest_arg, i.e. a tuned version of #2 o dest_comb;
wenzelm
parents:
20548
diff
changeset
|
304 |
else if maxidx < i then |
52788 | 305 |
Cterm {maxidx = i, thy = thy, 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
|
306 |
else |
52788 | 307 |
Cterm {maxidx = Int.max (maxidx_of_term t, i), thy = thy, 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
|
308 |
|
52788 | 309 |
fun incr_indexes_cterm i (ct as Cterm {thy, t, T, maxidx, sorts}) = |
22909 | 310 |
if i < 0 then raise CTERM ("negative increment", [ct]) |
311 |
else if i = 0 then ct |
|
59787 | 312 |
else Cterm {thy = thy, t = Logic.incr_indexes ([], [], i) t, |
22909 | 313 |
T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts}; |
314 |
||
315 |
||
316 |
(* matching *) |
|
317 |
||
318 |
local |
|
319 |
||
320 |
fun gen_match match |
|
20512 | 321 |
(ct1 as Cterm {t = t1, sorts = sorts1, ...}, |
20815 | 322 |
ct2 as Cterm {t = t2, sorts = sorts2, maxidx = maxidx2, ...}) = |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
323 |
let |
52788 | 324 |
val thy = merge_thys0 ct1 ct2; |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
325 |
val (Tinsts, tinsts) = match thy (t1, t2) (Vartab.empty, Vartab.empty); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
326 |
val sorts = Sorts.union sorts1 sorts2; |
20512 | 327 |
fun mk_cTinst ((a, i), (S, T)) = |
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
|
328 |
(((a, i), S), Ctyp {T = T, thy = thy, maxidx = maxidx2, sorts = sorts}); |
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
|
329 |
fun mk_ctinst ((x, i), (U, t)) = |
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
|
330 |
let val T = Envir.subst_type Tinsts U in |
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
|
331 |
(((x, i), T), Cterm {t = t, T = T, thy = thy, maxidx = maxidx2, sorts = sorts}) |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
332 |
end; |
16656 | 333 |
in (Vartab.fold (cons o mk_cTinst) Tinsts [], Vartab.fold (cons o mk_ctinst) tinsts []) end; |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
334 |
|
22909 | 335 |
in |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
336 |
|
22909 | 337 |
val match = gen_match Pattern.match; |
338 |
val first_order_match = gen_match Pattern.first_order_match; |
|
339 |
||
340 |
end; |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
341 |
|
2509 | 342 |
|
343 |
||
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
344 |
(*** Derivations and Theorems ***) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
345 |
|
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
|
346 |
abstype thm = Thm of |
40124 | 347 |
deriv * (*derivation*) |
52788 | 348 |
{thy: theory, (*background theory*) |
40124 | 349 |
tags: Properties.T, (*additional annotations/comments*) |
350 |
maxidx: int, (*maximum index of any Var or TVar*) |
|
351 |
shyps: sort Ord_List.T, (*sort hypotheses*) |
|
352 |
hyps: term Ord_List.T, (*hypotheses*) |
|
353 |
tpairs: (term * term) list, (*flex-flex pairs*) |
|
354 |
prop: term} (*conclusion*) |
|
28624 | 355 |
and deriv = Deriv of |
39687 | 356 |
{promises: (serial * thm future) Ord_List.T, |
37309 | 357 |
body: Proofterm.proof_body} |
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
|
358 |
with |
0 | 359 |
|
23601 | 360 |
type conv = cterm -> thm; |
361 |
||
16725 | 362 |
(*errors involving theorems*) |
363 |
exception THM of string * int * thm list; |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
364 |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
365 |
fun rep_thm (Thm (_, args)) = args; |
0 | 366 |
|
31947
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
367 |
fun fold_terms f (Thm (_, {tpairs, prop, hyps, ...})) = |
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
368 |
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
|
369 |
|
60952
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
370 |
fun fold_atomic_ctyps f (th as Thm (_, {thy, maxidx, shyps, ...})) = |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
371 |
let fun ctyp T = Ctyp {thy = thy, T = T, maxidx = maxidx, sorts = shyps} |
762cb38a3147
produce certified vars without access to theory_of_thm, and without context;
wenzelm
parents:
60951
diff
changeset
|
372 |
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
|
373 |
|
60818 | 374 |
fun fold_atomic_cterms f (th as Thm (_, {thy, maxidx, shyps, ...})) = |
375 |
let fun cterm t T = Cterm {thy = thy, t = t, T = T, maxidx = maxidx, sorts = shyps} in |
|
376 |
(fold_terms o fold_aterms) |
|
377 |
(fn t as Const (_, T) => f (cterm t T) |
|
378 |
| t as Free (_, T) => f (cterm t T) |
|
379 |
| t as Var (_, T) => f (cterm t T) |
|
380 |
| _ => I) th |
|
381 |
end; |
|
382 |
||
16725 | 383 |
fun terms_of_tpairs tpairs = fold_rev (fn (t, u) => cons t o cons u) tpairs []; |
384 |
||
385 |
fun eq_tpairs ((t, u), (t', u')) = t aconv t' andalso u aconv u'; |
|
18944 | 386 |
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
|
387 |
val maxidx_tpairs = fold (fn (t, u) => Term.maxidx_term t #> Term.maxidx_term u); |
16725 | 388 |
|
389 |
fun attach_tpairs tpairs prop = |
|
390 |
Logic.list_implies (map Logic.mk_equals tpairs, prop); |
|
391 |
||
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
392 |
fun full_prop_of (Thm (_, {tpairs, prop, ...})) = attach_tpairs tpairs prop; |
16945 | 393 |
|
39687 | 394 |
val union_hyps = Ord_List.union Term_Ord.fast_term_ord; |
395 |
val insert_hyps = Ord_List.insert Term_Ord.fast_term_ord; |
|
396 |
val remove_hyps = Ord_List.remove Term_Ord.fast_term_ord; |
|
22365 | 397 |
|
16945 | 398 |
|
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
399 |
(* merge theories of cterms/thms -- trivial absorption only *) |
16945 | 400 |
|
52788 | 401 |
fun merge_thys1 (Cterm {thy = thy1, ...}) (Thm (_, {thy = thy2, ...})) = |
402 |
Theory.merge (thy1, thy2); |
|
16945 | 403 |
|
52788 | 404 |
fun merge_thys2 (Thm (_, {thy = thy1, ...})) (Thm (_, {thy = thy2, ...})) = |
405 |
Theory.merge (thy1, thy2); |
|
16945 | 406 |
|
0 | 407 |
|
22365 | 408 |
(* basic components *) |
16135 | 409 |
|
52788 | 410 |
val theory_of_thm = #thy o rep_thm; |
60948 | 411 |
val theory_id_of_thm = Context.theory_id o #thy o rep_thm; |
412 |
val theory_name_of_thm = Context.theory_id_name o theory_id_of_thm; |
|
413 |
||
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
414 |
val maxidx_of = #maxidx o rep_thm; |
19910 | 415 |
fun maxidx_thm th i = Int.max (maxidx_of th, i); |
61039 | 416 |
val shyps_of = #shyps o rep_thm; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
417 |
val hyps_of = #hyps o rep_thm; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
418 |
val prop_of = #prop o rep_thm; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
419 |
val tpairs_of = #tpairs o rep_thm; |
0 | 420 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
421 |
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
|
422 |
val prems_of = Logic.strip_imp_prems o prop_of; |
21576 | 423 |
val nprems_of = Logic.count_prems o prop_of; |
19305 | 424 |
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
|
425 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
426 |
fun major_prem_of th = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
427 |
(case prems_of th of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
428 |
prem :: _ => Logic.strip_assums_concl prem |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
429 |
| [] => 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
|
430 |
|
52788 | 431 |
fun cprop_of (Thm (_, {thy, maxidx, shyps, prop, ...})) = |
432 |
Cterm {thy = thy, 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
|
433 |
|
52788 | 434 |
fun cprem_of (th as Thm (_, {thy, maxidx, shyps, prop, ...})) i = |
435 |
Cterm {thy = thy, maxidx = maxidx, T = propT, sorts = shyps, |
|
18145 | 436 |
t = Logic.nth_prem (i, prop) handle TERM _ => raise THM ("cprem_of", i, [th])}; |
18035 | 437 |
|
60949 | 438 |
fun chyps_of (Thm (_, {thy, shyps, hyps, ...})) = |
439 |
map (fn t => Cterm {thy = thy, maxidx = ~1, T = propT, sorts = shyps, t = t}) hyps; |
|
440 |
||
16656 | 441 |
(*explicit transfer to a super theory*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
442 |
fun transfer thy' thm = |
3895 | 443 |
let |
52788 | 444 |
val Thm (der, {thy, tags, maxidx, shyps, hyps, tpairs, prop}) = thm; |
60948 | 445 |
val _ = Context.subthy (thy, thy') orelse raise THM ("transfer: not a super theory", 0, [thm]); |
3895 | 446 |
in |
60948 | 447 |
if Context.eq_thy (thy, thy') then thm |
16945 | 448 |
else |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
449 |
Thm (der, |
52788 | 450 |
{thy = thy', |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
451 |
tags = tags, |
16945 | 452 |
maxidx = maxidx, |
453 |
shyps = shyps, |
|
454 |
hyps = hyps, |
|
455 |
tpairs = tpairs, |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
456 |
prop = prop}) |
3895 | 457 |
end; |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
458 |
|
59969
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
459 |
(*implicit alpha-conversion*) |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
460 |
fun renamed_prop prop' (Thm (der, {thy, tags, maxidx, shyps, hyps, tpairs, prop})) = |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
461 |
if prop aconv prop' then |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
462 |
Thm (der, {thy = thy, tags = tags, maxidx = maxidx, shyps = shyps, |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
463 |
hyps = hyps, tpairs = tpairs, prop = prop'}) |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
464 |
else raise TERM ("renamed_prop: props disagree", [prop, prop']); |
bcccad156236
explicitly checked alpha conversion -- actual renaming happens outside kernel;
wenzelm
parents:
59917
diff
changeset
|
465 |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
466 |
fun make_context NONE thy = Context.Theory thy |
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
467 |
| make_context (SOME ctxt) thy = |
60948 | 468 |
if Context.subthy (thy, Proof_Context.theory_of ctxt) then Context.Proof ctxt |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
469 |
else raise THEORY ("Bad context", [thy, Proof_Context.theory_of ctxt]); |
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
470 |
|
16945 | 471 |
(*explicit weakening: maps |- B to A |- B*) |
472 |
fun weaken raw_ct th = |
|
473 |
let |
|
20261 | 474 |
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
|
475 |
val Thm (der, {tags, maxidx, shyps, hyps, tpairs, prop, ...}) = th; |
16945 | 476 |
in |
477 |
if T <> propT then |
|
478 |
raise THM ("weaken: assumptions must have type prop", 0, []) |
|
479 |
else if maxidxA <> ~1 then |
|
480 |
raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, []) |
|
481 |
else |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
482 |
Thm (der, |
52788 | 483 |
{thy = merge_thys1 ct th, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
484 |
tags = tags, |
16945 | 485 |
maxidx = maxidx, |
486 |
shyps = Sorts.union sorts shyps, |
|
28354 | 487 |
hyps = insert_hyps A hyps, |
16945 | 488 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
489 |
prop = prop}) |
16945 | 490 |
end; |
16656 | 491 |
|
28624 | 492 |
fun weaken_sorts raw_sorts ct = |
493 |
let |
|
52788 | 494 |
val Cterm {thy, t, T, maxidx, sorts} = ct; |
28624 | 495 |
val more_sorts = Sorts.make (map (Sign.certify_sort thy) raw_sorts); |
496 |
val sorts' = Sorts.union sorts more_sorts; |
|
52788 | 497 |
in Cterm {thy = thy, t = t, T = T, maxidx = maxidx, sorts = sorts'} end; |
28624 | 498 |
|
16656 | 499 |
(*dangling sort constraints of a thm*) |
31947
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
500 |
fun extra_shyps (th as Thm (_, {shyps, ...})) = |
7daee3bed3af
clarified strip_shyps: proper type witnesses for present sorts;
wenzelm
parents:
31945
diff
changeset
|
501 |
Sorts.subtract (fold_terms Sorts.insert_term th []) shyps; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
502 |
|
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
503 |
|
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
504 |
|
32725 | 505 |
(** derivations and promised proofs **) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
506 |
|
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
|
507 |
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
|
508 |
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
|
509 |
|
37309 | 510 |
val empty_deriv = make_deriv [] [] [] Proofterm.MinProof; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
511 |
|
28330 | 512 |
|
28354 | 513 |
(* inference rules *) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
514 |
|
28378
60cc0359363d
promise: include check into future body, i.e. joined results are always valid;
wenzelm
parents:
28364
diff
changeset
|
515 |
fun promise_ord ((i, _), (j, _)) = int_ord (j, i); |
28330 | 516 |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
517 |
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
|
518 |
(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
|
519 |
(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
|
520 |
let |
39687 | 521 |
val ps = Ord_List.union promise_ord ps1 ps2; |
44334 | 522 |
val oras = Proofterm.unions_oracles [oras1, oras2]; |
523 |
val thms = Proofterm.unions_thms [thms1, thms2]; |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
524 |
val prf = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
525 |
(case ! Proofterm.proofs of |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
526 |
2 => f prf1 prf2 |
28804
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
527 |
| 1 => MinProof |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
528 |
| 0 => MinProof |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
529 |
| 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
|
530 |
in make_deriv ps oras thms prf end; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
531 |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
532 |
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
|
533 |
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
|
534 |
|
36621
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
535 |
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
|
536 |
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
|
537 |
|
1238 | 538 |
|
32725 | 539 |
(* fulfilled proofs *) |
540 |
||
44331 | 541 |
fun raw_body_of (Thm (Deriv {body, ...}, _)) = body; |
542 |
fun raw_promises_of (Thm (Deriv {promises, ...}, _)) = promises; |
|
543 |
||
544 |
fun join_promises [] = () |
|
545 |
| 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
|
546 |
and join_promises_of thms = join_promises (Ord_List.make promise_ord (maps raw_promises_of thms)); |
32725 | 547 |
|
52788 | 548 |
fun fulfill_body (Thm (Deriv {promises, body}, {thy, ...})) = |
549 |
Proofterm.fulfill_norm_proof thy (fulfill_promises promises) body |
|
44331 | 550 |
and fulfill_promises promises = |
551 |
map fst promises ~~ map fulfill_body (Future.joins (map snd promises)); |
|
32725 | 552 |
|
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
|
553 |
fun proof_bodies_of thms = |
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
|
554 |
let |
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
|
555 |
val _ = join_promises_of thms; |
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
|
556 |
val bodies = map fulfill_body thms; |
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
|
557 |
val _ = Proofterm.join_bodies bodies; |
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
|
558 |
in bodies end; |
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
|
559 |
|
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
|
560 |
val proof_body_of = singleton proof_bodies_of; |
44331 | 561 |
val proof_of = Proofterm.proof_of o proof_body_of; |
32725 | 562 |
|
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
|
563 |
val join_proofs = ignore o proof_bodies_of; |
32725 | 564 |
|
565 |
||
566 |
(* derivation status *) |
|
567 |
||
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
49008
diff
changeset
|
568 |
fun peek_status (Thm (Deriv {promises, body}, _)) = |
32725 | 569 |
let |
570 |
val ps = map (Future.peek o snd) promises; |
|
571 |
val bodies = body :: |
|
44331 | 572 |
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
|
573 |
val {oracle, unfinished, failed} = Proofterm.peek_status bodies; |
32725 | 574 |
in |
575 |
{oracle = oracle, |
|
576 |
unfinished = unfinished orelse exists is_none ps, |
|
577 |
failed = failed orelse exists (fn SOME (Exn.Exn _) => true | _ => false) ps} |
|
578 |
end; |
|
579 |
||
580 |
||
581 |
(* future rule *) |
|
582 |
||
36613
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36330
diff
changeset
|
583 |
fun future_result i orig_thy orig_shyps orig_prop thm = |
32725 | 584 |
let |
36613
f3157c288aca
simplified primitive Thm.future: more direct theory check, do not hardwire strip_shyps here;
wenzelm
parents:
36330
diff
changeset
|
585 |
fun err msg = raise THM ("future_result: " ^ msg, 0, [thm]); |
52788 | 586 |
val Thm (Deriv {promises, ...}, {thy, 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
|
587 |
|
60948 | 588 |
val _ = Context.eq_thy (thy, orig_thy) orelse err "bad theory"; |
32725 | 589 |
val _ = prop aconv orig_prop orelse err "bad prop"; |
590 |
val _ = null tpairs orelse err "bad tpairs"; |
|
591 |
val _ = null hyps orelse err "bad hyps"; |
|
592 |
val _ = Sorts.subset (shyps, orig_shyps) orelse err "bad shyps"; |
|
593 |
val _ = forall (fn (j, _) => i <> j) promises orelse err "bad dependencies"; |
|
44331 | 594 |
val _ = join_promises promises; |
32725 | 595 |
in thm end; |
596 |
||
597 |
fun future future_thm ct = |
|
598 |
let |
|
52788 | 599 |
val Cterm {thy = thy, t = prop, T, maxidx, sorts} = ct; |
32725 | 600 |
val _ = T <> propT andalso raise CTERM ("future: prop expected", [ct]); |
601 |
||
602 |
val i = serial (); |
|
603 |
val future = future_thm |> Future.map (future_result i thy sorts prop); |
|
604 |
in |
|
37309 | 605 |
Thm (make_deriv [(i, future)] [] [] (Proofterm.promise_proof thy i prop), |
52788 | 606 |
{thy = thy, |
32725 | 607 |
tags = [], |
608 |
maxidx = maxidx, |
|
609 |
shyps = sorts, |
|
610 |
hyps = [], |
|
611 |
tpairs = [], |
|
612 |
prop = prop}) |
|
613 |
end; |
|
614 |
||
615 |
||
616 |
(* closed derivations with official name *) |
|
617 |
||
41699 | 618 |
(*non-deterministic, depends on unknown promises*) |
37297 | 619 |
fun derivation_name (Thm (Deriv {body, ...}, {shyps, hyps, prop, ...})) = |
37309 | 620 |
Proofterm.get_name shyps hyps prop (Proofterm.proof_of body); |
32725 | 621 |
|
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
|
622 |
fun name_derivation name (thm as Thm (der, args)) = |
32725 | 623 |
let |
624 |
val Deriv {promises, body} = der; |
|
52788 | 625 |
val {thy, shyps, hyps, prop, tpairs, ...} = args; |
32725 | 626 |
val _ = null tpairs orelse raise THM ("put_name: unsolved flex-flex constraints", 0, [thm]); |
627 |
||
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
|
628 |
val ps = map (apsnd (Future.map fulfill_body)) promises; |
37309 | 629 |
val (pthm, proof) = Proofterm.thm_proof thy name shyps hyps prop ps body; |
32725 | 630 |
val der' = make_deriv [] [] [pthm] proof; |
631 |
in Thm (der', args) end; |
|
632 |
||
633 |
||
1238 | 634 |
|
1529 | 635 |
(** Axioms **) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
636 |
|
28675
fb68c0767004
renamed get_axiom_i to axiom, removed obsolete get_axiom;
wenzelm
parents:
28648
diff
changeset
|
637 |
fun axiom theory name = |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
638 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
639 |
fun get_ax thy = |
59884 | 640 |
Name_Space.lookup (Theory.axiom_table thy) name |
641 |
|> 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
|
642 |
let |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
643 |
val der = deriv_rule0 (Proofterm.axm_proof name prop); |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
644 |
val maxidx = maxidx_of_term prop; |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
645 |
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
|
646 |
in |
52788 | 647 |
Thm (der, {thy = thy, tags = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
648 |
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
|
649 |
end); |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
650 |
in |
42425 | 651 |
(case get_first get_ax (Theory.nodes_of theory) of |
15531 | 652 |
SOME thm => thm |
653 |
| NONE => raise THEORY ("No axiom " ^ quote name, [theory])) |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
654 |
end; |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
655 |
|
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
656 |
(*return additional axioms of this theory node*) |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
657 |
fun axioms_of thy = |
56025 | 658 |
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
|
659 |
|
6089 | 660 |
|
28804
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
661 |
(* tags *) |
6089 | 662 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
663 |
val get_tags = #tags o rep_thm; |
6089 | 664 |
|
52788 | 665 |
fun map_tags f (Thm (der, {thy, tags, maxidx, shyps, hyps, tpairs, prop})) = |
666 |
Thm (der, {thy = thy, tags = f tags, maxidx = maxidx, |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
667 |
shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}); |
0 | 668 |
|
669 |
||
43795
ca5896a836ba
recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents:
43761
diff
changeset
|
670 |
(* technical adjustments *) |
ca5896a836ba
recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;
wenzelm
parents:
43761
diff
changeset
|
671 |
|
52788 | 672 |
fun norm_proof (Thm (der, args as {thy, ...})) = |
673 |
Thm (deriv_rule1 (Proofterm.rew_proof thy) der, args); |
|
23781
ab793a6ddf9f
Added function norm_proof for normalizing the proof term
berghofe
parents:
23657
diff
changeset
|
674 |
|
52788 | 675 |
fun adjust_maxidx_thm i (th as Thm (der, {thy, tags, maxidx, shyps, hyps, tpairs, prop})) = |
20261 | 676 |
if maxidx = i then th |
677 |
else if maxidx < i then |
|
52788 | 678 |
Thm (der, {maxidx = i, thy = thy, tags = tags, shyps = shyps, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
679 |
hyps = hyps, tpairs = tpairs, prop = prop}) |
20261 | 680 |
else |
52788 | 681 |
Thm (der, {maxidx = Int.max (maxidx_tpairs tpairs (maxidx_of_term prop), i), thy = thy, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
682 |
tags = tags, shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop}); |
564 | 683 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
684 |
|
2509 | 685 |
|
1529 | 686 |
(*** Meta rules ***) |
0 | 687 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
688 |
(** primitive rules **) |
0 | 689 |
|
16656 | 690 |
(*The assumption rule A |- A*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
691 |
fun assume raw_ct = |
52788 | 692 |
let val Cterm {thy, 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
|
693 |
if T <> propT then |
19230 | 694 |
raise THM ("assume: prop", 0, []) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
695 |
else if maxidx <> ~1 then |
19230 | 696 |
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
|
697 |
else Thm (deriv_rule0 (Proofterm.Hyp prop), |
52788 | 698 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
699 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
700 |
maxidx = ~1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
701 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
702 |
hyps = [prop], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
703 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
704 |
prop = prop}) |
0 | 705 |
end; |
706 |
||
1220 | 707 |
(*Implication introduction |
3529 | 708 |
[A] |
709 |
: |
|
710 |
B |
|
1220 | 711 |
------- |
712 |
A ==> B |
|
713 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
714 |
fun implies_intr |
16679 | 715 |
(ct as Cterm {t = A, T, maxidx = maxidxA, sorts, ...}) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
716 |
(th as Thm (der, {maxidx, hyps, shyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
717 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
718 |
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
|
719 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
720 |
Thm (deriv_rule1 (Proofterm.implies_intr_proof A) der, |
52788 | 721 |
{thy = merge_thys1 ct th, |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
722 |
tags = [], |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
723 |
maxidx = Int.max (maxidxA, maxidx), |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
724 |
shyps = Sorts.union sorts shyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
725 |
hyps = remove_hyps A hyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
726 |
tpairs = tpairs, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
727 |
prop = Logic.mk_implies (A, prop)}); |
0 | 728 |
|
1529 | 729 |
|
1220 | 730 |
(*Implication elimination |
731 |
A ==> B A |
|
732 |
------------ |
|
733 |
B |
|
734 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
735 |
fun implies_elim thAB thA = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
736 |
let |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
737 |
val Thm (derA, {maxidx = maxA, hyps = hypsA, shyps = shypsA, tpairs = tpairsA, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
738 |
prop = propA, ...}) = thA |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
739 |
and Thm (der, {maxidx, hyps, shyps, tpairs, prop, ...}) = thAB; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
740 |
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
|
741 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
742 |
case prop of |
56245 | 743 |
Const ("Pure.imp", _) $ A $ B => |
20512 | 744 |
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
|
745 |
Thm (deriv_rule2 (curry Proofterm.%%) der derA, |
52788 | 746 |
{thy = merge_thys2 thAB thA, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
747 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
748 |
maxidx = Int.max (maxA, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
749 |
shyps = Sorts.union shypsA shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
750 |
hyps = union_hyps hypsA hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
751 |
tpairs = union_tpairs tpairsA tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
752 |
prop = B}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
753 |
else err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
754 |
| _ => err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
755 |
end; |
250 | 756 |
|
1220 | 757 |
(*Forall introduction. The Free or Var x must not be free in the hypotheses. |
16656 | 758 |
[x] |
759 |
: |
|
760 |
A |
|
761 |
------ |
|
762 |
!!x. A |
|
1220 | 763 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
764 |
fun forall_intr |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
765 |
(ct as Cterm {t = x, T, sorts, ...}) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
766 |
(th as Thm (der, {maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
767 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
768 |
fun result a = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
769 |
Thm (deriv_rule1 (Proofterm.forall_intr_proof x a) der, |
52788 | 770 |
{thy = merge_thys1 ct th, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
771 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
772 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
773 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
774 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
775 |
tpairs = tpairs, |
46217
7b19666f0e3d
renamed Term.all to Logic.all_const, in accordance to HOLogic.all_const;
wenzelm
parents:
45443
diff
changeset
|
776 |
prop = Logic.all_const T $ Abs (a, T, abstract_over (x, prop))}); |
21798 | 777 |
fun check_occs a x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
778 |
if exists (fn t => Logic.occs (x, t)) ts then |
21798 | 779 |
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
|
780 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
781 |
in |
52788 | 782 |
(case x of |
21798 | 783 |
Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result a) |
784 |
| Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result a) |
|
52788 | 785 |
| _ => raise THM ("forall_intr: not a variable", 0, [th])) |
0 | 786 |
end; |
787 |
||
1220 | 788 |
(*Forall elimination |
16656 | 789 |
!!x. A |
1220 | 790 |
------ |
791 |
A[t/x] |
|
792 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
793 |
fun forall_elim |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
794 |
(ct as Cterm {t, T, maxidx = maxt, sorts, ...}) |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
795 |
(th as Thm (der, {maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
796 |
(case prop of |
56245 | 797 |
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
|
798 |
if T <> qary then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
799 |
raise THM ("forall_elim: type mismatch", 0, [th]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
800 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
801 |
Thm (deriv_rule1 (Proofterm.% o rpair (SOME t)) der, |
52788 | 802 |
{thy = merge_thys1 ct th, |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
803 |
tags = [], |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
804 |
maxidx = Int.max (maxidx, maxt), |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
805 |
shyps = Sorts.union sorts shyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
806 |
hyps = hyps, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
807 |
tpairs = tpairs, |
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
808 |
prop = Term.betapply (A, t)}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
809 |
| _ => raise THM ("forall_elim: not quantified", 0, [th])); |
0 | 810 |
|
811 |
||
1220 | 812 |
(* Equality *) |
0 | 813 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
814 |
(*Reflexivity |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
815 |
t == t |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
816 |
*) |
52788 | 817 |
fun reflexive (Cterm {thy, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
818 |
Thm (deriv_rule0 Proofterm.reflexive, |
52788 | 819 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
820 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
821 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
822 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
823 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
824 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
825 |
prop = Logic.mk_equals (t, t)}); |
0 | 826 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
827 |
(*Symmetry |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
828 |
t == u |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
829 |
------ |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
830 |
u == t |
1220 | 831 |
*) |
52788 | 832 |
fun symmetric (th as Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
833 |
(case prop of |
56245 | 834 |
(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
|
835 |
Thm (deriv_rule1 Proofterm.symmetric der, |
52788 | 836 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
837 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
838 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
839 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
840 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
841 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
842 |
prop = eq $ u $ t}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
843 |
| _ => raise THM ("symmetric", 0, [th])); |
0 | 844 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
845 |
(*Transitivity |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
846 |
t1 == u u == t2 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
847 |
------------------ |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
848 |
t1 == t2 |
1220 | 849 |
*) |
0 | 850 |
fun transitive th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
851 |
let |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
852 |
val Thm (der1, {maxidx = max1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
853 |
prop = prop1, ...}) = th1 |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
854 |
and Thm (der2, {maxidx = max2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
855 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
856 |
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
|
857 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
858 |
case (prop1, prop2) of |
56245 | 859 |
((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
|
860 |
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
|
861 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
862 |
Thm (deriv_rule2 (Proofterm.transitive u T) der1 der2, |
52788 | 863 |
{thy = merge_thys2 th1 th2, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
864 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
865 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
866 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
867 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
868 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
869 |
prop = eq $ t1 $ t2}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
870 |
| _ => err "premises" |
0 | 871 |
end; |
872 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
873 |
(*Beta-conversion |
16656 | 874 |
(%x. t)(u) == t[u/x] |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
875 |
fully beta-reduces the term if full = true |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
876 |
*) |
52788 | 877 |
fun beta_conversion full (Cterm {thy, t, T = _, maxidx, sorts}) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
878 |
let val t' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
879 |
if full then Envir.beta_norm t |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
880 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
881 |
(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
|
882 |
| _ => raise THM ("beta_conversion: not a redex", 0, [])); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
883 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
884 |
Thm (deriv_rule0 Proofterm.reflexive, |
52788 | 885 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
886 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
887 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
888 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
889 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
890 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
891 |
prop = Logic.mk_equals (t, t')}) |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
892 |
end; |
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
893 |
|
52788 | 894 |
fun eta_conversion (Cterm {thy, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
895 |
Thm (deriv_rule0 Proofterm.reflexive, |
52788 | 896 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
897 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
898 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
899 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
900 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
901 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
902 |
prop = Logic.mk_equals (t, Envir.eta_contract t)}); |
0 | 903 |
|
52788 | 904 |
fun eta_long_conversion (Cterm {thy, t, T = _, maxidx, sorts}) = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
905 |
Thm (deriv_rule0 Proofterm.reflexive, |
52788 | 906 |
{thy = thy, |
23493 | 907 |
tags = [], |
908 |
maxidx = maxidx, |
|
909 |
shyps = sorts, |
|
910 |
hyps = [], |
|
911 |
tpairs = [], |
|
52131 | 912 |
prop = Logic.mk_equals (t, Envir.eta_long [] t)}); |
23493 | 913 |
|
0 | 914 |
(*The abstraction rule. The Free or Var x must not be free in the hypotheses. |
915 |
The bound variable will be named "a" (since x will be something like x320) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
916 |
t == u |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
917 |
-------------- |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
918 |
%x. t == %x. u |
1220 | 919 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
920 |
fun abstract_rule a |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
921 |
(Cterm {t = x, T, sorts, ...}) |
52788 | 922 |
(th as Thm (der, {thy, maxidx, hyps, shyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
923 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
924 |
val (t, u) = Logic.dest_equals prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
925 |
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
|
926 |
val result = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
927 |
Thm (deriv_rule1 (Proofterm.abstract_rule x a) der, |
52788 | 928 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
929 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
930 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
931 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
932 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
933 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
934 |
prop = Logic.mk_equals |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
935 |
(Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))}); |
21798 | 936 |
fun check_occs a x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
937 |
if exists (fn t => Logic.occs (x, t)) ts then |
21798 | 938 |
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
|
939 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
940 |
in |
52788 | 941 |
(case x of |
21798 | 942 |
Free (a, _) => (check_occs a x hyps; check_occs a x (terms_of_tpairs tpairs); result) |
943 |
| Var ((a, _), _) => (check_occs a x (terms_of_tpairs tpairs); result) |
|
52788 | 944 |
| _ => raise THM ("abstract_rule: not a variable", 0, [th])) |
0 | 945 |
end; |
946 |
||
947 |
(*The combination rule |
|
3529 | 948 |
f == g t == u |
949 |
-------------- |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
950 |
f t == g u |
1220 | 951 |
*) |
0 | 952 |
fun combination th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
953 |
let |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
954 |
val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
955 |
prop = prop1, ...}) = th1 |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
956 |
and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
957 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
958 |
fun chktypes fT tT = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
959 |
(case fT of |
32784 | 960 |
Type ("fun", [T1, _]) => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
961 |
if T1 <> tT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
962 |
raise THM ("combination: types", 0, [th1, th2]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
963 |
else () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
964 |
| _ => 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
|
965 |
in |
52788 | 966 |
(case (prop1, prop2) of |
56245 | 967 |
(Const ("Pure.eq", Type ("fun", [fT, _])) $ f $ g, |
968 |
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
|
969 |
(chktypes fT tT; |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
970 |
Thm (deriv_rule2 (Proofterm.combination f g t u fT) der1 der2, |
52788 | 971 |
{thy = merge_thys2 th1 th2, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
972 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
973 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
974 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
975 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
976 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
977 |
prop = Logic.mk_equals (f $ t, g $ u)})) |
52788 | 978 |
| _ => raise THM ("combination: premises", 0, [th1, th2])) |
0 | 979 |
end; |
980 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
981 |
(*Equality introduction |
3529 | 982 |
A ==> B B ==> A |
983 |
---------------- |
|
984 |
A == B |
|
1220 | 985 |
*) |
0 | 986 |
fun equal_intr th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
987 |
let |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
988 |
val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
989 |
prop = prop1, ...}) = th1 |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
990 |
and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
991 |
prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
992 |
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
|
993 |
in |
52788 | 994 |
(case (prop1, prop2) of |
56245 | 995 |
(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
|
996 |
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
|
997 |
Thm (deriv_rule2 (Proofterm.equal_intr A B) der1 der2, |
52788 | 998 |
{thy = merge_thys2 th1 th2, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
999 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1000 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1001 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1002 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1003 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1004 |
prop = Logic.mk_equals (A, B)}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1005 |
else err "not equal" |
52788 | 1006 |
| _ => err "premises") |
1529 | 1007 |
end; |
1008 |
||
1009 |
(*The equal propositions rule |
|
3529 | 1010 |
A == B A |
1529 | 1011 |
--------- |
1012 |
B |
|
1013 |
*) |
|
1014 |
fun equal_elim th1 th2 = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1015 |
let |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1016 |
val Thm (der1, {maxidx = max1, shyps = shyps1, hyps = hyps1, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1017 |
tpairs = tpairs1, prop = prop1, ...}) = th1 |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1018 |
and Thm (der2, {maxidx = max2, shyps = shyps2, hyps = hyps2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1019 |
tpairs = tpairs2, prop = prop2, ...}) = th2; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1020 |
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
|
1021 |
in |
52788 | 1022 |
(case prop1 of |
56245 | 1023 |
Const ("Pure.eq", _) $ A $ B => |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1024 |
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
|
1025 |
Thm (deriv_rule2 (Proofterm.equal_elim A B) der1 der2, |
52788 | 1026 |
{thy = merge_thys2 th1 th2, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1027 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1028 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1029 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1030 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1031 |
tpairs = union_tpairs tpairs1 tpairs2, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1032 |
prop = B}) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1033 |
else err "not equal" |
52789 | 1034 |
| _ => err "major premise") |
1529 | 1035 |
end; |
0 | 1036 |
|
1220 | 1037 |
|
1038 |
||
0 | 1039 |
(**** Derived rules ****) |
1040 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1041 |
(*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
|
1042 |
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
|
1043 |
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
|
1044 |
flex-flex.*) |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1045 |
fun flexflex_rule opt_ctxt (th as Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...})) = |
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1046 |
Unify.smash_unifiers (make_context opt_ctxt thy) tpairs (Envir.empty maxidx) |
52788 | 1047 |
|> Seq.map (fn env => |
1048 |
if Envir.is_empty env then th |
|
1049 |
else |
|
1050 |
let |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1051 |
val tpairs' = tpairs |> map (apply2 (Envir.norm_term env)) |
52788 | 1052 |
(*remove trivial tpairs, of the form t==t*) |
1053 |
|> filter_out (op aconv); |
|
1054 |
val der' = deriv_rule1 (Proofterm.norm_proof' env) der; |
|
1055 |
val prop' = Envir.norm_term env prop; |
|
1056 |
val maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'); |
|
1057 |
val shyps = Envir.insert_sorts env shyps; |
|
1058 |
in |
|
1059 |
Thm (der', {thy = thy, tags = [], maxidx = maxidx, |
|
1060 |
shyps = shyps, hyps = hyps, tpairs = tpairs', prop = prop'}) |
|
1061 |
end); |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1062 |
|
0 | 1063 |
|
19910 | 1064 |
(*Generalization of fixed variables |
1065 |
A |
|
1066 |
-------------------- |
|
1067 |
A[?'a/'a, ?x/x, ...] |
|
1068 |
*) |
|
1069 |
||
1070 |
fun generalize ([], []) _ th = th |
|
1071 |
| generalize (tfrees, frees) idx th = |
|
1072 |
let |
|
52788 | 1073 |
val Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...}) = th; |
19910 | 1074 |
val _ = idx <= maxidx andalso raise THM ("generalize: bad index", idx, [th]); |
1075 |
||
33697 | 1076 |
val bad_type = |
1077 |
if null tfrees then K false |
|
1078 |
else Term.exists_subtype (fn TFree (a, _) => member (op =) tfrees a | _ => false); |
|
19910 | 1079 |
fun bad_term (Free (x, T)) = bad_type T orelse member (op =) frees x |
1080 |
| bad_term (Var (_, T)) = bad_type T |
|
1081 |
| bad_term (Const (_, T)) = bad_type T |
|
1082 |
| bad_term (Abs (_, T, t)) = bad_type T orelse bad_term t |
|
1083 |
| bad_term (t $ u) = bad_term t orelse bad_term u |
|
1084 |
| bad_term (Bound _) = false; |
|
1085 |
val _ = exists bad_term hyps andalso |
|
1086 |
raise THM ("generalize: variable free in assumptions", 0, [th]); |
|
1087 |
||
31977 | 1088 |
val gen = Term_Subst.generalize (tfrees, frees) idx; |
19910 | 1089 |
val prop' = gen prop; |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1090 |
val tpairs' = map (apply2 gen) tpairs; |
19910 | 1091 |
val maxidx' = maxidx_tpairs tpairs' (maxidx_of_term prop'); |
1092 |
in |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1093 |
Thm (deriv_rule1 (Proofterm.generalize (tfrees, frees) idx) der, |
52788 | 1094 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1095 |
tags = [], |
19910 | 1096 |
maxidx = maxidx', |
1097 |
shyps = shyps, |
|
1098 |
hyps = hyps, |
|
1099 |
tpairs = tpairs', |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1100 |
prop = prop'}) |
19910 | 1101 |
end; |
1102 |
||
1103 |
||
22584 | 1104 |
(*Instantiation of schematic variables |
16656 | 1105 |
A |
1106 |
-------------------- |
|
1107 |
A[t1/v1, ..., tn/vn] |
|
1220 | 1108 |
*) |
0 | 1109 |
|
6928 | 1110 |
local |
1111 |
||
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26832
diff
changeset
|
1112 |
fun pretty_typing thy t T = Pretty.block |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26832
diff
changeset
|
1113 |
[Syntax.pretty_term_global thy t, Pretty.str " ::", Pretty.brk 1, Syntax.pretty_typ_global thy T]; |
15797 | 1114 |
|
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
|
1115 |
fun add_inst (v as (_, T), cu) (thy, sorts) = |
6928 | 1116 |
let |
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
|
1117 |
val Cterm {t = u, T = U, thy = thy2, sorts = sorts_u, maxidx = maxidx_u, ...} = cu; |
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
|
1118 |
val thy' = Theory.merge (thy, thy2); |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1119 |
val sorts' = Sorts.union sorts_u sorts; |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
1120 |
in |
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
|
1121 |
if T = U then ((v, (u, maxidx_u)), (thy', sorts')) |
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
|
1122 |
else |
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
|
1123 |
raise TYPE (Pretty.string_of (Pretty.block |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1124 |
[Pretty.str "instantiate: type conflict", |
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
|
1125 |
Pretty.fbrk, pretty_typing thy' (Var v) T, |
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
|
1126 |
Pretty.fbrk, pretty_typing thy' u U]), [T, U], [Var v, u]) |
0 | 1127 |
end; |
1128 |
||
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
|
1129 |
fun add_instT (v as (_, S), cU) (thy, sorts) = |
16656 | 1130 |
let |
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
|
1131 |
val Ctyp {T = U, thy = thy2, sorts = sorts_U, maxidx = maxidx_U, ...} = cU; |
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
|
1132 |
val thy' = Theory.merge (thy, thy2); |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1133 |
val sorts' = Sorts.union sorts_U sorts; |
16656 | 1134 |
in |
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
|
1135 |
if Sign.of_sort thy' (U, S) then ((v, (U, maxidx_U)), (thy', sorts')) |
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
|
1136 |
else raise TYPE ("Type not of sort " ^ Syntax.string_of_sort_global thy' S, [U], []) |
16656 | 1137 |
end; |
0 | 1138 |
|
6928 | 1139 |
in |
1140 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1141 |
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...]. |
0 | 1142 |
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
|
1143 |
Does NOT normalize the resulting theorem!*) |
1529 | 1144 |
fun instantiate ([], []) th = th |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1145 |
| instantiate (instT, inst) th = |
16656 | 1146 |
let |
52788 | 1147 |
val Thm (der, {thy, hyps, shyps, tpairs, prop, ...}) = th; |
1148 |
val (inst', (instT', (thy', shyps'))) = |
|
1149 |
(thy, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT; |
|
31977 | 1150 |
val subst = Term_Subst.instantiate_maxidx (instT', inst'); |
20512 | 1151 |
val (prop', maxidx1) = subst prop ~1; |
1152 |
val (tpairs', maxidx') = |
|
1153 |
fold_map (fn (t, u) => fn i => subst t i ||>> subst u) tpairs maxidx1; |
|
16656 | 1154 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1155 |
Thm (deriv_rule1 |
37309 | 1156 |
(fn d => Proofterm.instantiate (map (apsnd #1) instT', map (apsnd #1) inst') d) der, |
52788 | 1157 |
{thy = thy', |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1158 |
tags = [], |
20545
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1159 |
maxidx = maxidx', |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1160 |
shyps = shyps', |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1161 |
hyps = hyps, |
4c1068697159
instantiate: omit has_duplicates check, which is irrelevant for soundness;
wenzelm
parents:
20512
diff
changeset
|
1162 |
tpairs = tpairs', |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1163 |
prop = prop'}) |
16656 | 1164 |
end |
1165 |
handle TYPE (msg, _, _) => raise THM (msg, 0, [th]); |
|
6928 | 1166 |
|
22584 | 1167 |
fun instantiate_cterm ([], []) ct = ct |
1168 |
| instantiate_cterm (instT, inst) ct = |
|
1169 |
let |
|
52788 | 1170 |
val Cterm {thy, t, T, sorts, ...} = ct; |
1171 |
val (inst', (instT', (thy', sorts'))) = |
|
1172 |
(thy, sorts) |> fold_map add_inst inst ||> fold_map add_instT instT; |
|
31977 | 1173 |
val subst = Term_Subst.instantiate_maxidx (instT', inst'); |
1174 |
val substT = Term_Subst.instantiateT_maxidx instT'; |
|
22584 | 1175 |
val (t', maxidx1) = subst t ~1; |
1176 |
val (T', maxidx') = substT T maxidx1; |
|
52788 | 1177 |
in Cterm {thy = thy', t = t', T = T', sorts = sorts', maxidx = maxidx'} end |
22584 | 1178 |
handle TYPE (msg, _, _) => raise CTERM (msg, [ct]); |
1179 |
||
6928 | 1180 |
end; |
1181 |
||
0 | 1182 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1183 |
(*The trivial implication A ==> A, justified by assume and forall rules. |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1184 |
A can contain Vars, not so for assume!*) |
52788 | 1185 |
fun trivial (Cterm {thy, t = A, T, maxidx, sorts}) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1186 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1187 |
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
|
1188 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1189 |
Thm (deriv_rule0 (Proofterm.AbsP ("H", NONE, Proofterm.PBound 0)), |
52788 | 1190 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1191 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1192 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1193 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1194 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1195 |
tpairs = [], |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1196 |
prop = Logic.mk_implies (A, A)}); |
0 | 1197 |
|
31944 | 1198 |
(*Axiom-scheme reflecting signature contents |
1199 |
T :: c |
|
1200 |
------------------- |
|
1201 |
OFCLASS(T, c_class) |
|
1202 |
*) |
|
1203 |
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
|
1204 |
let |
52788 | 1205 |
val Ctyp {thy, T, ...} = cT; |
31903 | 1206 |
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
|
1207 |
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
|
1208 |
in |
31944 | 1209 |
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
|
1210 |
Thm (deriv_rule0 (Proofterm.OfClass (T, c)), |
52788 | 1211 |
{thy = thy, |
31944 | 1212 |
tags = [], |
1213 |
maxidx = maxidx, |
|
1214 |
shyps = sorts, |
|
1215 |
hyps = [], |
|
1216 |
tpairs = [], |
|
1217 |
prop = prop}) |
|
1218 |
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
|
1219 |
end; |
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1220 |
|
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1221 |
(*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
|
1222 |
fun strip_shyps (thm as Thm (_, {shyps = [], ...})) = thm |
52788 | 1223 |
| strip_shyps (thm as Thm (der, {thy, tags, maxidx, shyps, hyps, tpairs, prop})) = |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1224 |
let |
36621
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1225 |
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
|
1226 |
|
2fd4e2c76636
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm
parents:
36619
diff
changeset
|
1227 |
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
|
1228 |
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
|
1229 |
val witnessed = Sign.witness_sorts thy present extra; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1230 |
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
|
1231 |
|> Sorts.minimal_sorts algebra; |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1232 |
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
|
1233 |
in |
37309 | 1234 |
Thm (deriv_rule_unconditional |
1235 |
(Proofterm.strip_shyps_proof algebra present witnessed extra') der, |
|
52788 | 1236 |
{thy = thy, tags = tags, maxidx = maxidx, |
36614
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1237 |
shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop}) |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1238 |
end; |
b6c031ad3690
minor tuning of Thm.strip_shyps -- no longer pervasive;
wenzelm
parents:
36613
diff
changeset
|
1239 |
|
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1240 |
(*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
|
1241 |
fun unconstrainT (thm as Thm (der, args)) = |
19505 | 1242 |
let |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1243 |
val Deriv {promises, body} = der; |
52788 | 1244 |
val {thy, shyps, hyps, tpairs, prop, ...} = args; |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1245 |
|
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1246 |
fun err msg = raise THM ("unconstrainT: " ^ msg, 0, [thm]); |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1247 |
val _ = null hyps orelse err "illegal hyps"; |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1248 |
val _ = null tpairs orelse err "unsolved flex-flex constraints"; |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1249 |
val tfrees = rev (Term.add_tfree_names prop []); |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1250 |
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
|
1251 |
|
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
|
1252 |
val ps = map (apsnd (Future.map fulfill_body)) promises; |
37309 | 1253 |
val (pthm as (_, (_, prop', _)), proof) = |
1254 |
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
|
1255 |
val der' = make_deriv [] [] [pthm] proof; |
19505 | 1256 |
in |
36883
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1257 |
Thm (der', |
52788 | 1258 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1259 |
tags = [], |
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1260 |
maxidx = maxidx_of_term prop', |
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1261 |
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
|
1262 |
hyps = [], |
4ed0d72def50
added Proofterm.unconstrain_thm_proof for Thm.unconstrainT -- loosely based on the version by krauss/schropp;
wenzelm
parents:
36882
diff
changeset
|
1263 |
tpairs = [], |
36769
b6b88bf695b3
Thm.unconstrainT based on Logic.unconstrainT -- no proofterm yet;
wenzelm
parents:
36768
diff
changeset
|
1264 |
prop = prop'}) |
19505 | 1265 |
end; |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1266 |
|
6786 | 1267 |
(* Replace all TFrees not fixed or in the hyps by new TVars *) |
52788 | 1268 |
fun varifyT_global' fixed (Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...})) = |
12500 | 1269 |
let |
29272 | 1270 |
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
|
1271 |
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
|
1272 |
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
|
1273 |
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
|
1274 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1275 |
(al, Thm (deriv_rule1 (Proofterm.varify_proof prop tfrees) der, |
52788 | 1276 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1277 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1278 |
maxidx = Int.max (0, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1279 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1280 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1281 |
tpairs = rev (map Logic.dest_equals ts), |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1282 |
prop = prop3})) |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1283 |
end; |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1284 |
|
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
|
1285 |
val varifyT_global = #2 o varifyT_global' []; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1286 |
|
36615
88756a5a92fc
renamed Thm.freezeT to Thm.legacy_freezeT -- it is based on Type.legacy_freeze;
wenzelm
parents:
36614
diff
changeset
|
1287 |
(* Replace all TVars by TFrees that are often new *) |
52788 | 1288 |
fun legacy_freezeT (Thm (der, {thy, shyps, hyps, tpairs, prop, ...})) = |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1289 |
let |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1290 |
val prop1 = attach_tpairs tpairs prop; |
33832 | 1291 |
val prop2 = Type.legacy_freeze prop1; |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1292 |
val (ts, prop3) = Logic.strip_prems (length tpairs, [], prop2); |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1293 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1294 |
Thm (deriv_rule1 (Proofterm.legacy_freezeT prop1) der, |
52788 | 1295 |
{thy = thy, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1296 |
tags = [], |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1297 |
maxidx = maxidx_of_term prop2, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1298 |
shyps = shyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1299 |
hyps = hyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1300 |
tpairs = rev (map Logic.dest_equals ts), |
18127 | 1301 |
prop = prop3}) |
0 | 1302 |
end; |
1303 |
||
1304 |
||
1305 |
(*** Inference rules for tactics ***) |
|
1306 |
||
1307 |
(*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
|
1308 |
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
|
1309 |
(case Logic.strip_prems(i, [], prop) of |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1310 |
(B::rBs, C) => (tpairs, rev rBs, B, C) |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1311 |
| _ => raise THM("dest_state", i, [state])) |
0 | 1312 |
handle TERM _ => raise THM("dest_state", i, [state]); |
1313 |
||
46255 | 1314 |
(*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
|
1315 |
assumptions of goal.*) |
18035 | 1316 |
fun lift_rule goal orule = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1317 |
let |
18035 | 1318 |
val Cterm {t = gprop, T, maxidx = gmax, sorts, ...} = goal; |
1319 |
val inc = gmax + 1; |
|
1320 |
val lift_abs = Logic.lift_abs inc gprop; |
|
1321 |
val lift_all = Logic.lift_all inc gprop; |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1322 |
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
|
1323 |
val (As, B) = Logic.strip_horn prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1324 |
in |
18035 | 1325 |
if T <> propT then raise THM ("lift_rule: the term must have type prop", 0, []) |
1326 |
else |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1327 |
Thm (deriv_rule1 (Proofterm.lift_proof gprop inc prop) der, |
52788 | 1328 |
{thy = merge_thys1 goal orule, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1329 |
tags = [], |
18035 | 1330 |
maxidx = maxidx + inc, |
1331 |
shyps = Sorts.union shyps sorts, (*sic!*) |
|
1332 |
hyps = hyps, |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1333 |
tpairs = map (apply2 lift_abs) tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1334 |
prop = Logic.list_implies (map lift_all As, lift_all B)}) |
0 | 1335 |
end; |
1336 |
||
52788 | 1337 |
fun incr_indexes i (thm as Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...})) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1338 |
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
|
1339 |
else if i = 0 then thm |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1340 |
else |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1341 |
Thm (deriv_rule1 (Proofterm.incr_indexes i) der, |
52788 | 1342 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1343 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1344 |
maxidx = maxidx + i, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1345 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1346 |
hyps = hyps, |
59787 | 1347 |
tpairs = map (apply2 (Logic.incr_indexes ([], [], i))) tpairs, |
1348 |
prop = Logic.incr_indexes ([], [], i) prop}); |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1349 |
|
0 | 1350 |
(*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
|
1351 |
fun assumption opt_ctxt i state = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1352 |
let |
52788 | 1353 |
val Thm (der, {thy, maxidx, shyps, hyps, ...}) = state; |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1354 |
val context = make_context opt_ctxt thy; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1355 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
32032 | 1356 |
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
|
1357 |
Thm (deriv_rule1 |
37309 | 1358 |
((if Envir.is_empty env then I else (Proofterm.norm_proof' env)) o |
1359 |
Proofterm.assumption_proof Bs Bi n) der, |
|
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1360 |
{tags = [], |
32032 | 1361 |
maxidx = Envir.maxidx_of env, |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
1362 |
shyps = Envir.insert_sorts env shyps, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1363 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1364 |
tpairs = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1365 |
if Envir.is_empty env then tpairs |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1366 |
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
|
1367 |
prop = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1368 |
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
|
1369 |
Logic.list_implies (Bs, C) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1370 |
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
|
1371 |
Envir.norm_term env (Logic.list_implies (Bs, C)), |
52788 | 1372 |
thy = thy}); |
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
|
1373 |
|
30556
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1374 |
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
|
1375 |
val concl' = close concl; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1376 |
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
|
1377 |
| 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
|
1378 |
(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
|
1379 |
(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
|
1380 |
(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
|
1381 |
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
|
1382 |
(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
|
1383 |
in addprfs asms 1 end; |
0 | 1384 |
|
250 | 1385 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. |
51604 | 1386 |
Checks if Bi's conclusion is alpha/eta-convertible to one of its assumptions*) |
0 | 1387 |
fun eq_assumption i state = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1388 |
let |
52788 | 1389 |
val Thm (der, {thy, maxidx, shyps, hyps, ...}) = state; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1390 |
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
|
1391 |
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
|
1392 |
in |
52131 | 1393 |
(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
|
1394 |
~1 => raise THM ("eq_assumption", 0, [state]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1395 |
| n => |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1396 |
Thm (deriv_rule1 (Proofterm.assumption_proof Bs Bi (n + 1)) der, |
52788 | 1397 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1398 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1399 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1400 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1401 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1402 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1403 |
prop = Logic.list_implies (Bs, C)})) |
0 | 1404 |
end; |
1405 |
||
1406 |
||
2671 | 1407 |
(*For rotate_tac: fast rotation of assumptions of subgoal i*) |
1408 |
fun rotate_rule k i state = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1409 |
let |
52788 | 1410 |
val Thm (der, {thy, maxidx, shyps, hyps, ...}) = state; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1411 |
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
|
1412 |
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
|
1413 |
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
|
1414 |
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
|
1415 |
val concl = Logic.strip_imp_concl rest; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1416 |
val n = length asms; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1417 |
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
|
1418 |
val Bi' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1419 |
if 0 = m orelse m = n then Bi |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1420 |
else if 0 < m andalso m < n then |
19012 | 1421 |
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
|
1422 |
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
|
1423 |
else raise THM ("rotate_rule", k, [state]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1424 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1425 |
Thm (deriv_rule1 (Proofterm.rotate_proof Bs Bi m) der, |
52788 | 1426 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1427 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1428 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1429 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1430 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1431 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1432 |
prop = Logic.list_implies (Bs @ [Bi'], C)}) |
2671 | 1433 |
end; |
1434 |
||
1435 |
||
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1436 |
(*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
|
1437 |
unchanged. Does nothing if k=0 or if k equals n-j, where n is the |
58837 | 1438 |
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
|
1439 |
fun permute_prems j k rl = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1440 |
let |
52788 | 1441 |
val Thm (der, {thy, maxidx, shyps, hyps, tpairs, prop, ...}) = rl; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1442 |
val prems = Logic.strip_imp_prems prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1443 |
and concl = Logic.strip_imp_concl prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1444 |
val moved_prems = List.drop (prems, j) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1445 |
and fixed_prems = List.take (prems, j) |
43278 | 1446 |
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
|
1447 |
val n_j = length moved_prems; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1448 |
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
|
1449 |
val prop' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1450 |
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
|
1451 |
else if 0 < m andalso m < n_j then |
19012 | 1452 |
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
|
1453 |
in Logic.list_implies (fixed_prems @ qs @ ps, concl) end |
16725 | 1454 |
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
|
1455 |
in |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1456 |
Thm (deriv_rule1 (Proofterm.permute_prems_proof prems j m) der, |
52788 | 1457 |
{thy = thy, |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21576
diff
changeset
|
1458 |
tags = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1459 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1460 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1461 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1462 |
tpairs = tpairs, |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1463 |
prop = prop'}) |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1464 |
end; |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1465 |
|
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1466 |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1467 |
(* strip_apply f B A strips off all assumptions/parameters from A |
0 | 1468 |
introduced by lifting over B, and applies f to remaining part of A*) |
1469 |
fun strip_apply f = |
|
56245 | 1470 |
let fun strip (Const ("Pure.imp", _) $ _ $ B1) |
1471 |
(Const ("Pure.imp", _) $ A2 $ B2) = Logic.mk_implies (A2, strip B1 B2) |
|
1472 |
| strip ((c as Const ("Pure.all", _)) $ Abs (_, _, t1)) |
|
1473 |
( 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
|
1474 |
| strip _ A = f A |
0 | 1475 |
in strip end; |
1476 |
||
56245 | 1477 |
fun strip_lifted (Const ("Pure.imp", _) $ _ $ B1) |
1478 |
(Const ("Pure.imp", _) $ _ $ B2) = strip_lifted B1 B2 |
|
1479 |
| strip_lifted (Const ("Pure.all", _) $ Abs (_, _, t1)) |
|
1480 |
(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
|
1481 |
| strip_lifted _ A = A; |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1482 |
|
0 | 1483 |
(*Use the alist to rename all bound variables and some unknowns in a term |
1484 |
dpairs = current disagreement pairs; tpairs = permanent ones (flexflex); |
|
1485 |
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
|
1486 |
fun rename_bvs [] _ _ _ _ = K I |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1487 |
| rename_bvs al dpairs tpairs B As = |
20330 | 1488 |
let |
1489 |
val add_var = fold_aterms (fn Var ((x, _), _) => insert (op =) x | _ => I); |
|
1490 |
val vids = [] |
|
1491 |
|> fold (add_var o fst) dpairs |
|
1492 |
|> fold (add_var o fst) tpairs |
|
1493 |
|> fold (add_var o snd) tpairs; |
|
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1494 |
val vids' = fold (add_var o strip_lifted B) As []; |
250 | 1495 |
(*unknowns appearing elsewhere be preserved!*) |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1496 |
val al' = distinct ((op =) o apply2 fst) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1497 |
(filter_out (fn (x, y) => |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1498 |
not (member (op =) vids' x) orelse |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1499 |
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
|
1500 |
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
|
1501 |
fun del_clashing clash xs _ [] qs = |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1502 |
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
|
1503 |
| 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
|
1504 |
if member (op =) ys y |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1505 |
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
|
1506 |
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
|
1507 |
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
|
1508 |
fun rename (t as Var ((x, i), T)) = |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1509 |
(case AList.lookup (op =) al'' x of |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1510 |
SOME y => Var ((y, i), T) |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1511 |
| NONE => t) |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1512 |
| rename (Abs (x, T, t)) = |
18944 | 1513 |
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
|
1514 |
| rename (f $ t) = rename f $ rename t |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1515 |
| rename t = t; |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1516 |
fun strip_ren f Ai = f rename B Ai |
20330 | 1517 |
in strip_ren end; |
0 | 1518 |
|
1519 |
(*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
|
1520 |
fun rename_bvars dpairs = |
48263 | 1521 |
rename_bvs (fold_rev Term.match_bvars dpairs []) dpairs; |
0 | 1522 |
|
1523 |
||
1524 |
(*** RESOLUTION ***) |
|
1525 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1526 |
(** Lifting optimizations **) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1527 |
|
0 | 1528 |
(*strip off pairs of assumptions/parameters in parallel -- they are |
1529 |
identical because of lifting*) |
|
56245 | 1530 |
fun strip_assums2 (Const("Pure.imp", _) $ _ $ B1, |
1531 |
Const("Pure.imp", _) $ _ $ B2) = strip_assums2 (B1,B2) |
|
1532 |
| strip_assums2 (Const("Pure.all",_)$Abs(a,T,t1), |
|
1533 |
Const("Pure.all",_)$Abs(_,_,t2)) = |
|
0 | 1534 |
let val (B1,B2) = strip_assums2 (t1,t2) |
1535 |
in (Abs(a,T,B1), Abs(a,T,B2)) end |
|
1536 |
| strip_assums2 BB = BB; |
|
1537 |
||
1538 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1539 |
(*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
|
1540 |
fun norm_term_skip env 0 t = Envir.norm_term env t |
56245 | 1541 |
| norm_term_skip env n (Const ("Pure.all", _) $ Abs (a, T, t)) = |
32032 | 1542 |
let |
58946
3bf80312508e
proper Envir.norm_type for result of Unify.unifiers (amending 479832ff2d29 from 20 years ago);
wenzelm
parents:
58837
diff
changeset
|
1543 |
val T' = Envir.norm_type (Envir.type_env env) T |
32032 | 1544 |
(*Must instantiate types of parameters because they are flattened; |
1545 |
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
|
1546 |
in Logic.all_const T' $ Abs (a, T', norm_term_skip env n t) end |
56245 | 1547 |
| norm_term_skip env n (Const ("Pure.imp", _) $ A $ B) = |
32032 | 1548 |
Logic.mk_implies (A, norm_term_skip env (n - 1) B) |
32784 | 1549 |
| 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
|
1550 |
|
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1551 |
|
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
|
1552 |
(*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
|
1553 |
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
|
1554 |
let |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1555 |
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
|
1556 |
| 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
|
1557 |
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
|
1558 |
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
|
1559 |
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
|
1560 |
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
|
1561 |
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
|
1562 |
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
|
1563 |
|
0 | 1564 |
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C) |
250 | 1565 |
Unifies B with Bi, replacing subgoal i (1 <= i <= n) |
0 | 1566 |
If match then forbid instantiations in proof state |
1567 |
If lifted then shorten the dpair using strip_assums2. |
|
1568 |
If eres_flg then simultaneously proves A1 by assumption. |
|
250 | 1569 |
nsubgoal is the number of new subgoals (written m above). |
0 | 1570 |
Curried so that resolution calls dest_state only once. |
1571 |
*) |
|
4270 | 1572 |
local exception COMPOSE |
0 | 1573 |
in |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1574 |
fun bicompose_aux opt_ctxt {flatten, match, incremented} (state, (stpairs, Bs, Bi, C), lifted) |
0 | 1575 |
(eres_flg, orule, nsubgoal) = |
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1576 |
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
|
1577 |
and Thm (rder, {maxidx=rmax, shyps=rshyps, hyps=rhyps, |
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1578 |
tpairs=rtpairs, prop=rprop,...}) = orule |
1529 | 1579 |
(*How many hyps to skip over during normalization*) |
21576 | 1580 |
and nlift = Logic.count_prems (strip_all_body Bi) + (if eres_flg then ~1 else 0) |
52788 | 1581 |
val thy = merge_thys2 state orule; |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1582 |
val context = make_context opt_ctxt thy; |
0 | 1583 |
(** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **) |
32032 | 1584 |
fun addth A (As, oldAs, rder', n) ((env, tpairs), thq) = |
250 | 1585 |
let val normt = Envir.norm_term env; |
1586 |
(*perform minimal copying here by examining env*) |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1587 |
val (ntpairs, normp) = |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1588 |
if Envir.is_empty env then (tpairs, (Bs @ As, C)) |
250 | 1589 |
else |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58950
diff
changeset
|
1590 |
let val ntps = map (apply2 normt) tpairs |
19861 | 1591 |
in if Envir.above env smax then |
1238 | 1592 |
(*no assignments in state; normalize the rule only*) |
1593 |
if lifted |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1594 |
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
|
1595 |
else (ntps, (Bs @ map normt As, C)) |
1529 | 1596 |
else if match then raise COMPOSE |
250 | 1597 |
else (*normalize the new rule fully*) |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1598 |
(ntps, (map normt (Bs @ As), normt C)) |
250 | 1599 |
end |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1600 |
val th = |
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1601 |
Thm (deriv_rule2 |
11518 | 1602 |
((if Envir.is_empty env then I |
19861 | 1603 |
else if Envir.above env smax then |
37309 | 1604 |
(fn f => fn der => f (Proofterm.norm_proof' env der)) |
11518 | 1605 |
else |
37309 | 1606 |
curry op oo (Proofterm.norm_proof' env)) |
1607 |
(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
|
1608 |
{tags = [], |
32032 | 1609 |
maxidx = Envir.maxidx_of env, |
26640
92e6d3ec91bd
simplified handling of sorts, removed unnecessary universal witness;
wenzelm
parents:
26631
diff
changeset
|
1610 |
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
|
1611 |
hyps = union_hyps rhyps shyps, |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1612 |
tpairs = ntpairs, |
24143
90a9a6fe0d01
replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents:
23781
diff
changeset
|
1613 |
prop = Logic.list_implies normp, |
52788 | 1614 |
thy = thy}) |
19475 | 1615 |
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
|
1616 |
val (rAs,B) = Logic.strip_prems(nsubgoal, [], rprop) |
0 | 1617 |
handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]); |
1618 |
(*Modify assumptions, deleting n-th if n>0 for e-resolution*) |
|
1619 |
fun newAs(As0, n, dpairs, tpairs) = |
|
11518 | 1620 |
let val (As1, rder') = |
25939 | 1621 |
if not lifted then (As0, rder) |
44108
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1622 |
else |
476a239d3e0e
rename_bvs now avoids introducing name clashes between schematic variables
berghofe
parents:
43795
diff
changeset
|
1623 |
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
|
1624 |
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
|
1625 |
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
|
1626 |
end; |
18486 | 1627 |
in (map (if flatten then (Logic.flatten_params n) else I) As1, As1, rder', n) |
250 | 1628 |
handle TERM _ => |
1629 |
raise THM("bicompose: 1st premise", 0, [orule]) |
|
0 | 1630 |
end; |
1631 |
val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi); |
|
1632 |
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
|
1633 |
|
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
|
1634 |
(*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
|
1635 |
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
|
1636 |
| 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
|
1637 |
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
|
1638 |
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
|
1639 |
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
|
1640 |
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
|
1641 |
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
|
1642 |
| tryasms (asm :: rest) n = |
7be15917f3fa
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm
parents:
30554
diff
changeset
|
1643 |
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
|
1644 |
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
|
1645 |
(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
|
1646 |
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
|
1647 |
| 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
|
1648 |
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
|
1649 |
(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
|
1650 |
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
|
1651 |
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
|
1652 |
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
|
1653 |
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
|
1654 |
|
0 | 1655 |
(*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
|
1656 |
fun res env = |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1657 |
(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
|
1658 |
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
|
1659 |
| 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
|
1660 |
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
|
1661 |
(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
|
1662 |
|
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
|
1663 |
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
|
1664 |
in |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1665 |
(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
|
1666 |
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
|
1667 |
| SOME env => if eres_flg then eres env (rev rAs) else res env) |
0 | 1668 |
end; |
7528 | 1669 |
end; |
0 | 1670 |
|
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1671 |
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
|
1672 |
bicompose_aux opt_ctxt flags (state, dest_state (state,i), false) arg; |
0 | 1673 |
|
1674 |
(*Quick test whether rule is resolvable with the subgoal with hyps Hs |
|
1675 |
and conclusion B. If eres_flg then checks 1st premise of rule also*) |
|
1676 |
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
|
1677 |
let fun could_reshyp (A1::_) = exists (fn H => Term.could_unify (A1, H)) Hs |
250 | 1678 |
| 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
|
1679 |
in Term.could_unify(concl_of rule, B) andalso |
250 | 1680 |
(not eres_flg orelse could_reshyp (prems_of rule)) |
0 | 1681 |
end; |
1682 |
||
1683 |
(*Bi-resolution of a state with a list of (flag,rule) pairs. |
|
1684 |
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
|
1685 |
fun biresolution opt_ctxt match brules i state = |
18035 | 1686 |
let val (stpairs, Bs, Bi, C) = dest_state(state,i); |
18145 | 1687 |
val lift = lift_rule (cprem_of state i); |
250 | 1688 |
val B = Logic.strip_assums_concl Bi; |
1689 |
val Hs = Logic.strip_assums_hyp Bi; |
|
52223
5bb6ae8acb87
tuned signature -- more explicit flags for low-level Thm.bicompose;
wenzelm
parents:
52222
diff
changeset
|
1690 |
val compose = |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1691 |
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
|
1692 |
(state, (stpairs, Bs, Bi, C), true); |
4270 | 1693 |
fun res [] = Seq.empty |
250 | 1694 |
| res ((eres_flg, rule)::brules) = |
58950
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1695 |
if Config.get_generic (make_context opt_ctxt (theory_of_thm state)) |
d07464875dd4
optional proof context for unify operations, for the sake of proper local options;
wenzelm
parents:
58946
diff
changeset
|
1696 |
Pattern.unify_trace_failure orelse could_bires (Hs, B, eres_flg, rule) |
4270 | 1697 |
then Seq.make (*delay processing remainder till needed*) |
22573 | 1698 |
(fn()=> SOME(compose (eres_flg, lift rule, nprems_of rule), |
250 | 1699 |
res brules)) |
1700 |
else res brules |
|
4270 | 1701 |
in Seq.flat (res brules) end; |
0 | 1702 |
|
1703 |
||
28321
9f4499bf9384
type thm: fully internal derivation, no longer exported;
wenzelm
parents:
28290
diff
changeset
|
1704 |
|
2509 | 1705 |
(*** Oracles ***) |
1706 |
||
28290 | 1707 |
(* oracle rule *) |
1708 |
||
52788 | 1709 |
fun invoke_oracle thy1 name oracle arg = |
1710 |
let val Cterm {thy = thy2, t = prop, T, maxidx, sorts} = oracle arg in |
|
28290 | 1711 |
if T <> propT then |
1712 |
raise THM ("Oracle's result must have type prop: " ^ name, 0, []) |
|
1713 |
else |
|
52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset
|
1714 |
let val (ora, prf) = Proofterm.oracle_proof name prop in |
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
|
1715 |
Thm (make_deriv [] [ora] [] prf, |
52788 | 1716 |
{thy = Theory.merge (thy1, thy2), |
28804
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1717 |
tags = [], |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1718 |
maxidx = maxidx, |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1719 |
shyps = sorts, |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1720 |
hyps = [], |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1721 |
tpairs = [], |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1722 |
prop = prop}) |
5d3b1df16353
refined notion of derivation, consiting of promises and proof_body;
wenzelm
parents:
28675
diff
changeset
|
1723 |
end |
3812 | 1724 |
end; |
1725 |
||
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
|
1726 |
end; |
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
|
1727 |
end; |
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
|
1728 |
end; |
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
|
1729 |
|
28290 | 1730 |
|
1731 |
(* authentic derivation names *) |
|
1732 |
||
33522 | 1733 |
structure Oracles = Theory_Data |
28290 | 1734 |
( |
33095
bbd52d2f8696
renamed NameSpace to Name_Space -- also to emphasize its subtle change in semantics;
wenzelm
parents:
33092
diff
changeset
|
1735 |
type T = unit Name_Space.table; |
33159 | 1736 |
val empty : T = Name_Space.empty_table "oracle"; |
28290 | 1737 |
val extend = I; |
33522 | 1738 |
fun merge data : T = Name_Space.merge_tables data; |
28290 | 1739 |
); |
1740 |
||
59917
9830c944670f
more uniform "verbose" option to print name space;
wenzelm
parents:
59884
diff
changeset
|
1741 |
fun extern_oracles verbose ctxt = |
9830c944670f
more uniform "verbose" option to print name space;
wenzelm
parents:
59884
diff
changeset
|
1742 |
map #1 (Name_Space.markup_table verbose ctxt (Oracles.get (Proof_Context.theory_of ctxt))); |
28290 | 1743 |
|
30288
a32700e45ab3
Thm.add_oracle interface: replaced old bstring by binding;
wenzelm
parents:
29636
diff
changeset
|
1744 |
fun add_oracle (b, oracle) thy = |
28290 | 1745 |
let |
47005
421760a1efe7
maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
wenzelm
parents:
46497
diff
changeset
|
1746 |
val (name, tab') = Name_Space.define (Context.Theory thy) true (b, ()) (Oracles.get thy); |
30288
a32700e45ab3
Thm.add_oracle interface: replaced old bstring by binding;
wenzelm
parents:
29636
diff
changeset
|
1747 |
val thy' = Oracles.put tab' thy; |
52788 | 1748 |
in ((name, invoke_oracle thy' name oracle), thy') end; |
28290 | 1749 |
|
0 | 1750 |
end; |
1503 | 1751 |
|
32104 | 1752 |
structure Basic_Thm: BASIC_THM = Thm; |
1753 |
open Basic_Thm; |