author | wenzelm |
Tue, 04 Jul 2006 19:49:53 +0200 | |
changeset 20002 | 09ac655904a9 |
parent 19910 | 2b4a222fef3c |
child 20057 | 058e913bac71 |
permissions | -rw-r--r-- |
250 | 1 |
(* Title: Pure/thm.ML |
0 | 2 |
ID: $Id$ |
250 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
4 |
Copyright 1994 University of Cambridge |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
5 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
6 |
The very core of Isabelle's Meta Logic: certified types and terms, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
7 |
meta theorems, meta rules (including lifting and resolution). |
0 | 8 |
*) |
9 |
||
6089 | 10 |
signature BASIC_THM = |
1503 | 11 |
sig |
1160 | 12 |
(*certified types*) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
13 |
type ctyp |
16656 | 14 |
val rep_ctyp: ctyp -> |
15 |
{thy: theory, |
|
16 |
sign: theory, (*obsolete*) |
|
17 |
T: typ, |
|
18 |
sorts: sort list} |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
19 |
val theory_of_ctyp: ctyp -> theory |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
20 |
val typ_of: ctyp -> typ |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
21 |
val ctyp_of: theory -> typ -> ctyp |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
22 |
val read_ctyp: theory -> string -> ctyp |
1160 | 23 |
|
24 |
(*certified terms*) |
|
25 |
type cterm |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
26 |
exception CTERM of string |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
27 |
val rep_cterm: cterm -> |
16656 | 28 |
{thy: theory, |
29 |
sign: theory, (*obsolete*) |
|
30 |
t: term, |
|
31 |
T: typ, |
|
32 |
maxidx: int, |
|
33 |
sorts: sort list} |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
34 |
val crep_cterm: cterm -> |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
35 |
{thy: theory, sign: theory, t: term, T: ctyp, maxidx: int, sorts: sort list} |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
36 |
val theory_of_cterm: cterm -> theory |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
37 |
val term_of: cterm -> term |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
38 |
val cterm_of: theory -> term -> cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
39 |
val ctyp_of_term: cterm -> ctyp |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
40 |
val read_cterm: theory -> string * typ -> cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
41 |
val adjust_maxidx: cterm -> cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
42 |
val read_def_cterm: |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
43 |
theory * (indexname -> typ option) * (indexname -> sort option) -> |
1160 | 44 |
string list -> bool -> string * typ -> cterm * (indexname * typ) list |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
45 |
val read_def_cterms: |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
46 |
theory * (indexname -> typ option) * (indexname -> sort option) -> |
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
47 |
string list -> bool -> (string * typ)list |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
48 |
-> cterm list * (indexname * typ)list |
1160 | 49 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
50 |
type tag (* = string * string list *) |
1529 | 51 |
|
1160 | 52 |
(*meta theorems*) |
53 |
type thm |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
54 |
val rep_thm: thm -> |
16656 | 55 |
{thy: theory, |
56 |
sign: theory, (*obsolete*) |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
57 |
der: bool * Proofterm.proof, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
58 |
maxidx: int, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
59 |
shyps: sort list, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
60 |
hyps: term list, |
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} |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
63 |
val crep_thm: thm -> |
16656 | 64 |
{thy: theory, |
65 |
sign: theory, (*obsolete*) |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
66 |
der: bool * Proofterm.proof, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
67 |
maxidx: int, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
68 |
shyps: sort list, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
69 |
hyps: cterm list, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
70 |
tpairs: (cterm * cterm) list, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
71 |
prop: cterm} |
6089 | 72 |
exception THM of string * int * thm list |
18733 | 73 |
type attribute (* = Context.generic * thm -> Context.generic * thm *) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
74 |
val eq_thm: thm * thm -> bool |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
75 |
val eq_thms: thm list * thm list -> bool |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
76 |
val theory_of_thm: thm -> theory |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
77 |
val sign_of_thm: thm -> theory (*obsolete*) |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
78 |
val prop_of: thm -> term |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
79 |
val proof_of: thm -> Proofterm.proof |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
80 |
val tpairs_of: thm -> (term * term) list |
16656 | 81 |
val concl_of: thm -> term |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
82 |
val prems_of: thm -> term list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
83 |
val nprems_of: thm -> int |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
84 |
val cprop_of: thm -> cterm |
18145 | 85 |
val cprem_of: thm -> int -> cterm |
16656 | 86 |
val transfer: theory -> thm -> thm |
16945 | 87 |
val weaken: cterm -> thm -> thm |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
88 |
val extra_shyps: thm -> sort list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
89 |
val strip_shyps: thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
90 |
val get_axiom_i: theory -> string -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
91 |
val get_axiom: theory -> xstring -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
92 |
val def_name: string -> string |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
93 |
val get_def: theory -> xstring -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
94 |
val axioms_of: theory -> (string * thm) list |
1160 | 95 |
|
96 |
(*meta rules*) |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
97 |
val assume: cterm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
98 |
val implies_intr: cterm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
99 |
val implies_elim: thm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
100 |
val forall_intr: cterm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
101 |
val forall_elim: cterm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
102 |
val reflexive: cterm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
103 |
val symmetric: thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
104 |
val transitive: thm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
105 |
val beta_conversion: bool -> cterm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
106 |
val eta_conversion: cterm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
107 |
val abstract_rule: string -> cterm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
108 |
val combination: thm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
109 |
val equal_intr: thm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
110 |
val equal_elim: thm -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
111 |
val flexflex_rule: thm -> thm Seq.seq |
19910 | 112 |
val generalize: string list * string list -> int -> thm -> thm |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
113 |
val instantiate: (ctyp * ctyp) list * (cterm * cterm) list -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
114 |
val trivial: cterm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
115 |
val class_triv: theory -> class -> thm |
19505 | 116 |
val unconstrainT: ctyp -> thm -> thm |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
117 |
val dest_state: thm * int -> (term * term) list * term list * term * term |
18035 | 118 |
val lift_rule: cterm -> thm -> thm |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
119 |
val incr_indexes: int -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
120 |
val assumption: int -> thm -> thm Seq.seq |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
121 |
val eq_assumption: int -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
122 |
val rotate_rule: int -> int -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
123 |
val permute_prems: int -> int -> thm -> thm |
1160 | 124 |
val rename_params_rule: string list * int -> thm -> thm |
18501
915105af2e80
turned bicompose_no_flatten into compose_no_flatten, without elimination;
wenzelm
parents:
18486
diff
changeset
|
125 |
val compose_no_flatten: bool -> thm * int -> int -> thm -> thm Seq.seq |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
126 |
val bicompose: bool -> bool * thm * int -> int -> thm -> thm Seq.seq |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
127 |
val biresolution: bool -> (bool * thm) list -> int -> thm -> thm Seq.seq |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
128 |
val invoke_oracle: theory -> xstring -> theory * Object.T -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
129 |
val invoke_oracle_i: theory -> string -> theory * Object.T -> thm |
250 | 130 |
end; |
0 | 131 |
|
6089 | 132 |
signature THM = |
133 |
sig |
|
134 |
include BASIC_THM |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
135 |
val dest_ctyp: ctyp -> ctyp list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
136 |
val dest_comb: cterm -> cterm * cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
137 |
val dest_abs: string option -> cterm -> cterm * cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
138 |
val capply: cterm -> cterm -> cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
139 |
val cabs: cterm -> cterm -> cterm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
140 |
val major_prem_of: thm -> term |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
141 |
val no_prems: thm -> bool |
18733 | 142 |
val rule_attribute: (Context.generic -> thm -> thm) -> attribute |
143 |
val declaration_attribute: (thm -> Context.generic -> Context.generic) -> attribute |
|
144 |
val theory_attributes: attribute list -> theory * thm -> theory * thm |
|
145 |
val proof_attributes: attribute list -> Context.proof * thm -> Context.proof * thm |
|
17345 | 146 |
val no_attributes: 'a -> 'a * 'b list |
147 |
val simple_fact: 'a -> ('a * 'b list) list |
|
16945 | 148 |
val terms_of_tpairs: (term * term) list -> term list |
19881 | 149 |
val maxidx_of: thm -> int |
19910 | 150 |
val maxidx_thm: thm -> int -> int |
19881 | 151 |
val hyps_of: thm -> term list |
16945 | 152 |
val full_prop_of: thm -> term |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
153 |
val get_name_tags: thm -> string * tag list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
154 |
val put_name_tags: string * tag list -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
155 |
val name_of_thm: thm -> string |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
156 |
val tags_of_thm: thm -> tag list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
157 |
val name_thm: string * thm -> thm |
16945 | 158 |
val compress: thm -> thm |
159 |
val adjust_maxidx_thm: thm -> thm |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
160 |
val rename_boundvars: term -> term -> thm -> thm |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
161 |
val cterm_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
162 |
val cterm_first_order_match: cterm * cterm -> (ctyp * ctyp) list * (cterm * cterm) list |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
163 |
val cterm_incr_indexes: int -> cterm -> cterm |
20002 | 164 |
val varifyT: thm -> thm |
165 |
val varifyT': (string * sort) list -> thm -> ((string * sort) * indexname) list * thm |
|
19881 | 166 |
val freezeT: thm -> thm |
6089 | 167 |
end; |
168 |
||
3550 | 169 |
structure Thm: THM = |
0 | 170 |
struct |
250 | 171 |
|
16656 | 172 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
173 |
(*** Certified terms and types ***) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
174 |
|
16656 | 175 |
(** collect occurrences of sorts -- unless all sorts non-empty **) |
176 |
||
16679 | 177 |
fun may_insert_typ_sorts thy T = if Sign.all_sorts_nonempty thy then I else Sorts.insert_typ T; |
178 |
fun may_insert_term_sorts thy t = if Sign.all_sorts_nonempty thy then I else Sorts.insert_term t; |
|
16656 | 179 |
|
180 |
(*NB: type unification may invent new sorts*) |
|
181 |
fun may_insert_env_sorts thy (env as Envir.Envir {iTs, ...}) = |
|
182 |
if Sign.all_sorts_nonempty thy then I |
|
183 |
else Vartab.fold (fn (_, (_, T)) => Sorts.insert_typ T) iTs; |
|
184 |
||
185 |
||
186 |
||
250 | 187 |
(** certified types **) |
188 |
||
16656 | 189 |
datatype ctyp = Ctyp of {thy_ref: theory_ref, T: typ, sorts: sort list}; |
250 | 190 |
|
16656 | 191 |
fun rep_ctyp (Ctyp {thy_ref, T, sorts}) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
192 |
let val thy = Theory.deref thy_ref |
16656 | 193 |
in {thy = thy, sign = thy, T = T, sorts = sorts} end; |
250 | 194 |
|
16656 | 195 |
fun theory_of_ctyp (Ctyp {thy_ref, ...}) = Theory.deref thy_ref; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
196 |
|
250 | 197 |
fun typ_of (Ctyp {T, ...}) = T; |
198 |
||
16656 | 199 |
fun ctyp_of thy raw_T = |
200 |
let val T = Sign.certify_typ thy raw_T |
|
201 |
in Ctyp {thy_ref = Theory.self_ref thy, T = T, sorts = may_insert_typ_sorts thy T []} end; |
|
250 | 202 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
203 |
fun read_ctyp thy s = |
16656 | 204 |
let val T = Sign.read_typ (thy, K NONE) s |
205 |
in Ctyp {thy_ref = Theory.self_ref thy, T = T, sorts = may_insert_typ_sorts thy T []} end; |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
206 |
|
16656 | 207 |
fun dest_ctyp (Ctyp {thy_ref, T = Type (s, Ts), sorts}) = |
208 |
map (fn T => Ctyp {thy_ref = thy_ref, T = T, sorts = sorts}) Ts |
|
16679 | 209 |
| dest_ctyp cT = raise TYPE ("dest_ctyp", [typ_of cT], []); |
15087 | 210 |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
211 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
212 |
|
250 | 213 |
(** certified terms **) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
214 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
215 |
(*certified terms with checked typ, maxidx, and sorts*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
216 |
datatype cterm = Cterm of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
217 |
{thy_ref: theory_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
218 |
t: term, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
219 |
T: typ, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
220 |
maxidx: int, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
221 |
sorts: sort list}; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
222 |
|
16679 | 223 |
exception CTERM of string; |
224 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
225 |
fun rep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
226 |
let val thy = Theory.deref thy_ref |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
227 |
in {thy = thy, sign = 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
|
228 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
229 |
fun crep_cterm (Cterm {thy_ref, t, T, maxidx, sorts}) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
230 |
let val thy = Theory.deref thy_ref in |
16656 | 231 |
{thy = thy, sign = thy, t = t, T = Ctyp {thy_ref = thy_ref, T = T, sorts = sorts}, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
232 |
maxidx = maxidx, sorts = sorts} |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
233 |
end; |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
234 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
235 |
fun theory_of_cterm (Cterm {thy_ref, ...}) = Theory.deref thy_ref; |
250 | 236 |
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
|
237 |
|
16656 | 238 |
fun ctyp_of_term (Cterm {thy_ref, T, sorts, ...}) = |
239 |
Ctyp {thy_ref = thy_ref, T = T, sorts = sorts}; |
|
2671 | 240 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
241 |
fun cterm_of thy tm = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
242 |
let |
18969 | 243 |
val (t, T, maxidx) = Sign.certify_term thy tm; |
16656 | 244 |
val sorts = may_insert_term_sorts thy t []; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
245 |
in Cterm {thy_ref = Theory.self_ref 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
|
246 |
|
16656 | 247 |
fun merge_thys0 (Cterm {thy_ref = r1, ...}) (Cterm {thy_ref = r2, ...}) = |
248 |
Theory.merge_refs (r1, r2); |
|
249 |
||
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
250 |
(*Destruct application in cterms*) |
16679 | 251 |
fun dest_comb (Cterm {t = t $ u, T, thy_ref, maxidx, sorts}) = |
252 |
let val A = Term.argument_type_of t in |
|
253 |
(Cterm {t = t, T = A --> T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}, |
|
254 |
Cterm {t = u, T = A, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}) |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
255 |
end |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
256 |
| dest_comb _ = raise CTERM "dest_comb"; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
257 |
|
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
258 |
(*Destruct abstraction in cterms*) |
16679 | 259 |
fun dest_abs a (Cterm {t = Abs (x, T, t), T = Type ("fun", [_, U]), thy_ref, maxidx, sorts}) = |
18944 | 260 |
let val (y', t') = Term.dest_abs (the_default x a, T, t) in |
16679 | 261 |
(Cterm {t = Free (y', T), T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}, |
262 |
Cterm {t = t', T = U, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}) |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
263 |
end |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
264 |
| dest_abs _ _ = raise CTERM "dest_abs"; |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
265 |
|
2147 | 266 |
(*Makes maxidx precise: it is often too big*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
267 |
fun adjust_maxidx (ct as Cterm {thy_ref, t, T, maxidx, sorts}) = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
268 |
if maxidx = ~1 then ct |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
269 |
else Cterm {thy_ref = thy_ref, t = t, T = T, maxidx = maxidx_of_term t, sorts = sorts}; |
1703
e22ad43bab5f
moved dest_cimplies to drule.ML; added adjust_maxidx
clasohm
parents:
1659
diff
changeset
|
270 |
|
1516
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
271 |
(*Form cterm out of a function and an argument*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
272 |
fun capply |
16656 | 273 |
(cf as Cterm {t = f, T = Type ("fun", [dty, rty]), maxidx = maxidx1, sorts = sorts1, ...}) |
274 |
(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
|
275 |
if T = dty then |
16656 | 276 |
Cterm {thy_ref = merge_thys0 cf cx, |
277 |
t = f $ x, |
|
278 |
T = rty, |
|
279 |
maxidx = Int.max (maxidx1, maxidx2), |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
280 |
sorts = Sorts.union sorts1 sorts2} |
1516
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
281 |
else raise CTERM "capply: types don't agree" |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
282 |
| capply _ _ = raise CTERM "capply: first arg is not a function" |
250 | 283 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
284 |
fun cabs |
16656 | 285 |
(ct1 as Cterm {t = t1, T = T1, maxidx = maxidx1, sorts = sorts1, ...}) |
286 |
(ct2 as Cterm {t = t2, T = T2, maxidx = maxidx2, sorts = sorts2, ...}) = |
|
18944 | 287 |
let val t = lambda t1 t2 handle TERM _ => raise CTERM "cabs: malformed first argument" in |
16656 | 288 |
Cterm {thy_ref = merge_thys0 ct1 ct2, |
289 |
t = t, T = T1 --> T2, |
|
290 |
maxidx = Int.max (maxidx1, maxidx2), |
|
291 |
sorts = Sorts.union sorts1 sorts2} |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
292 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
293 |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
294 |
(*Matching of cterms*) |
16656 | 295 |
fun gen_cterm_match match |
296 |
(ct1 as Cterm {t = t1, maxidx = maxidx1, sorts = sorts1, ...}, |
|
297 |
ct2 as Cterm {t = t2, maxidx = maxidx2, sorts = sorts2, ...}) = |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
298 |
let |
16656 | 299 |
val thy_ref = merge_thys0 ct1 ct2; |
18184 | 300 |
val (Tinsts, tinsts) = match (Theory.deref thy_ref) (t1, t2) (Vartab.empty, Vartab.empty); |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
301 |
val maxidx = Int.max (maxidx1, maxidx2); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
302 |
val sorts = Sorts.union sorts1 sorts2; |
16656 | 303 |
fun mk_cTinst (ixn, (S, T)) = |
304 |
(Ctyp {T = TVar (ixn, S), thy_ref = thy_ref, sorts = sorts}, |
|
305 |
Ctyp {T = T, thy_ref = thy_ref, sorts = sorts}); |
|
306 |
fun mk_ctinst (ixn, (T, t)) = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
307 |
let val T = Envir.typ_subst_TVars Tinsts T in |
16656 | 308 |
(Cterm {t = Var (ixn, T), T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}, |
309 |
Cterm {t = t, T = T, thy_ref = thy_ref, maxidx = maxidx, sorts = sorts}) |
|
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
310 |
end; |
16656 | 311 |
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
|
312 |
|
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
313 |
val cterm_match = gen_cterm_match Pattern.match; |
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
314 |
val cterm_first_order_match = gen_cterm_match Pattern.first_order_match; |
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
315 |
|
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
316 |
(*Incrementing indexes*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
317 |
fun cterm_incr_indexes i (ct as Cterm {thy_ref, t, T, maxidx, sorts}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
318 |
if i < 0 then raise CTERM "negative increment" |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
319 |
else if i = 0 then ct |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
320 |
else Cterm {thy_ref = thy_ref, t = Logic.incr_indexes ([], i) t, |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
321 |
T = Logic.incr_tvar i T, maxidx = maxidx + i, sorts = sorts}; |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
322 |
|
2509 | 323 |
|
324 |
||
574 | 325 |
(** read cterms **) (*exception ERROR*) |
250 | 326 |
|
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
327 |
(*read terms, infer types, certify terms*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
328 |
fun read_def_cterms (thy, types, sorts) used freeze sTs = |
250 | 329 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
330 |
val (ts', tye) = Sign.read_def_terms (thy, types, sorts) used freeze sTs; |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
331 |
val cts = map (cterm_of thy) ts' |
2979 | 332 |
handle TYPE (msg, _, _) => error msg |
2386 | 333 |
| TERM (msg, _) => error msg; |
4281
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
334 |
in (cts, tye) end; |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
335 |
|
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
336 |
(*read term, infer types, certify term*) |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
337 |
fun read_def_cterm args used freeze aT = |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
338 |
let val ([ct],tye) = read_def_cterms args used freeze [aT] |
6c6073b13600
Added read_def_cterms for simultaneous reading/typing of terms under
nipkow
parents:
4270
diff
changeset
|
339 |
in (ct,tye) end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
340 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
341 |
fun read_cterm thy = #1 o read_def_cterm (thy, K NONE, K NONE) [] true; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
342 |
|
250 | 343 |
|
6089 | 344 |
(*tags provide additional comment, apart from the axiom/theorem name*) |
345 |
type tag = string * string list; |
|
346 |
||
2509 | 347 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
348 |
(*** Meta theorems ***) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
349 |
|
11518 | 350 |
structure Pt = Proofterm; |
351 |
||
0 | 352 |
datatype thm = Thm of |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
353 |
{thy_ref: theory_ref, (*dynamic reference to theory*) |
11518 | 354 |
der: bool * Pt.proof, (*derivation*) |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
355 |
maxidx: int, (*maximum index of any Var or TVar*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
356 |
shyps: sort list, (*sort hypotheses as ordered list*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
357 |
hyps: term list, (*hypotheses as ordered list*) |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
358 |
tpairs: (term * term) list, (*flex-flex pairs*) |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
359 |
prop: term}; (*conclusion*) |
0 | 360 |
|
16725 | 361 |
(*errors involving theorems*) |
362 |
exception THM of string * int * thm list; |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
363 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
364 |
fun rep_thm (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
365 |
let val thy = Theory.deref thy_ref in |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
366 |
{thy = thy, sign = thy, der = der, maxidx = maxidx, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
367 |
shyps = shyps, hyps = hyps, tpairs = tpairs, prop = prop} |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
368 |
end; |
0 | 369 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
370 |
(*version of rep_thm returning cterms instead of terms*) |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
371 |
fun crep_thm (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
372 |
let |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
373 |
val thy = Theory.deref thy_ref; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
374 |
fun cterm max t = Cterm {thy_ref = thy_ref, t = t, T = propT, maxidx = max, sorts = shyps}; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
375 |
in |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
376 |
{thy = thy, sign = thy, der = der, maxidx = maxidx, shyps = shyps, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
377 |
hyps = map (cterm ~1) hyps, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
378 |
tpairs = map (pairself (cterm maxidx)) tpairs, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
379 |
prop = cterm maxidx prop} |
1517 | 380 |
end; |
381 |
||
16725 | 382 |
fun terms_of_tpairs tpairs = fold_rev (fn (t, u) => cons t o cons u) tpairs []; |
383 |
||
384 |
fun eq_tpairs ((t, u), (t', u')) = t aconv t' andalso u aconv u'; |
|
18944 | 385 |
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
|
386 |
val maxidx_tpairs = fold (fn (t, u) => Term.maxidx_term t #> Term.maxidx_term u); |
16725 | 387 |
|
388 |
fun attach_tpairs tpairs prop = |
|
389 |
Logic.list_implies (map Logic.mk_equals tpairs, prop); |
|
390 |
||
391 |
fun full_prop_of (Thm {tpairs, prop, ...}) = attach_tpairs tpairs prop; |
|
16945 | 392 |
|
393 |
||
394 |
(* merge theories of cterms/thms; raise exception if incompatible *) |
|
395 |
||
396 |
fun merge_thys1 (Cterm {thy_ref = r1, ...}) (th as Thm {thy_ref = r2, ...}) = |
|
397 |
Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th]); |
|
398 |
||
399 |
fun merge_thys2 (th1 as Thm {thy_ref = r1, ...}) (th2 as Thm {thy_ref = r2, ...}) = |
|
400 |
Theory.merge_refs (r1, r2) handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]); |
|
401 |
||
0 | 402 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
403 |
(*attributes subsume any kind of rules or context modifiers*) |
18733 | 404 |
type attribute = Context.generic * thm -> Context.generic * thm; |
405 |
||
406 |
fun rule_attribute f (x, th) = (x, f x th); |
|
407 |
fun declaration_attribute f (x, th) = (f th x, th); |
|
408 |
||
409 |
fun apply_attributes mk dest = |
|
410 |
let |
|
411 |
fun app [] = I |
|
412 |
| app ((f: attribute) :: fs) = fn (x, th) => f (mk x, th) |>> dest |> app fs; |
|
413 |
in app end; |
|
414 |
||
415 |
val theory_attributes = apply_attributes Context.Theory Context.the_theory; |
|
416 |
val proof_attributes = apply_attributes Context.Proof Context.the_proof; |
|
17708 | 417 |
|
6089 | 418 |
fun no_attributes x = (x, []); |
17345 | 419 |
fun simple_fact x = [(x, [])]; |
6089 | 420 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
421 |
|
16656 | 422 |
(* hyps *) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
423 |
|
16945 | 424 |
val insert_hyps = OrdList.insert Term.fast_term_ord; |
16679 | 425 |
val remove_hyps = OrdList.remove Term.fast_term_ord; |
426 |
val union_hyps = OrdList.union Term.fast_term_ord; |
|
427 |
val eq_set_hyps = OrdList.eq_set Term.fast_term_ord; |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
428 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
429 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
430 |
(* eq_thm(s) *) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
431 |
|
3994 | 432 |
fun eq_thm (th1, th2) = |
433 |
let |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
434 |
val {thy = thy1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, prop = prop1, ...} = |
9031 | 435 |
rep_thm th1; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
436 |
val {thy = thy2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, prop = prop2, ...} = |
9031 | 437 |
rep_thm th2; |
3994 | 438 |
in |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
439 |
Context.joinable (thy1, thy2) andalso |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
440 |
Sorts.eq_set (shyps1, shyps2) andalso |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
441 |
eq_set_hyps (hyps1, hyps2) andalso |
16656 | 442 |
equal_lists eq_tpairs (tpairs1, tpairs2) andalso |
3994 | 443 |
prop1 aconv prop2 |
444 |
end; |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
445 |
|
16135 | 446 |
val eq_thms = Library.equal_lists eq_thm; |
447 |
||
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
448 |
fun theory_of_thm (Thm {thy_ref, ...}) = Theory.deref thy_ref; |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
449 |
val sign_of_thm = theory_of_thm; |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
450 |
|
19429 | 451 |
fun maxidx_of (Thm {maxidx, ...}) = maxidx; |
19910 | 452 |
fun maxidx_thm th i = Int.max (maxidx_of th, i); |
19881 | 453 |
fun hyps_of (Thm {hyps, ...}) = hyps; |
12803 | 454 |
fun prop_of (Thm {prop, ...}) = prop; |
13528 | 455 |
fun proof_of (Thm {der = (_, proof), ...}) = proof; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
456 |
fun tpairs_of (Thm {tpairs, ...}) = tpairs; |
0 | 457 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
458 |
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
|
459 |
val prems_of = Logic.strip_imp_prems o prop_of; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
460 |
fun nprems_of th = Logic.count_prems (prop_of th, 0); |
19305 | 461 |
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
|
462 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
463 |
fun major_prem_of th = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
464 |
(case prems_of th of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
465 |
prem :: _ => Logic.strip_assums_concl prem |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
466 |
| [] => 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
|
467 |
|
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
468 |
(*the statement of any thm is a cterm*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
469 |
fun cprop_of (Thm {thy_ref, maxidx, shyps, prop, ...}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
470 |
Cterm {thy_ref = thy_ref, maxidx = maxidx, T = propT, t = prop, sorts = shyps}; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
471 |
|
18145 | 472 |
fun cprem_of (th as Thm {thy_ref, maxidx, shyps, prop, ...}) i = |
18035 | 473 |
Cterm {thy_ref = thy_ref, maxidx = maxidx, T = propT, sorts = shyps, |
18145 | 474 |
t = Logic.nth_prem (i, prop) handle TERM _ => raise THM ("cprem_of", i, [th])}; |
18035 | 475 |
|
16656 | 476 |
(*explicit transfer to a super theory*) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
477 |
fun transfer thy' thm = |
3895 | 478 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
479 |
val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop} = thm; |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
480 |
val thy = Theory.deref thy_ref; |
3895 | 481 |
in |
16945 | 482 |
if not (subthy (thy, thy')) then |
483 |
raise THM ("transfer: not a super theory", 0, [thm]) |
|
484 |
else if eq_thy (thy, thy') then thm |
|
485 |
else |
|
486 |
Thm {thy_ref = Theory.self_ref thy', |
|
487 |
der = der, |
|
488 |
maxidx = maxidx, |
|
489 |
shyps = shyps, |
|
490 |
hyps = hyps, |
|
491 |
tpairs = tpairs, |
|
492 |
prop = prop} |
|
3895 | 493 |
end; |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
494 |
|
16945 | 495 |
(*explicit weakening: maps |- B to A |- B*) |
496 |
fun weaken raw_ct th = |
|
497 |
let |
|
498 |
val ct as Cterm {t = A, T, sorts, maxidx = maxidxA, ...} = adjust_maxidx raw_ct; |
|
499 |
val Thm {der, maxidx, shyps, hyps, tpairs, prop, ...} = th; |
|
500 |
in |
|
501 |
if T <> propT then |
|
502 |
raise THM ("weaken: assumptions must have type prop", 0, []) |
|
503 |
else if maxidxA <> ~1 then |
|
504 |
raise THM ("weaken: assumptions may not contain schematic variables", maxidxA, []) |
|
505 |
else |
|
506 |
Thm {thy_ref = merge_thys1 ct th, |
|
507 |
der = der, |
|
508 |
maxidx = maxidx, |
|
509 |
shyps = Sorts.union sorts shyps, |
|
510 |
hyps = insert_hyps A hyps, |
|
511 |
tpairs = tpairs, |
|
512 |
prop = prop} |
|
513 |
end; |
|
16656 | 514 |
|
515 |
||
0 | 516 |
|
1238 | 517 |
(** sort contexts of theorems **) |
518 |
||
16656 | 519 |
fun present_sorts (Thm {hyps, tpairs, prop, ...}) = |
520 |
fold (fn (t, u) => Sorts.insert_term t o Sorts.insert_term u) tpairs |
|
521 |
(Sorts.insert_terms hyps (Sorts.insert_term prop [])); |
|
1238 | 522 |
|
7642 | 523 |
(*remove extra sorts that are non-empty by virtue of type signature information*) |
524 |
fun strip_shyps (thm as Thm {shyps = [], ...}) = thm |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
525 |
| strip_shyps (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
7642 | 526 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
527 |
val thy = Theory.deref thy_ref; |
16656 | 528 |
val shyps' = |
529 |
if Sign.all_sorts_nonempty thy then [] |
|
530 |
else |
|
531 |
let |
|
532 |
val present = present_sorts thm; |
|
533 |
val extra = Sorts.subtract present shyps; |
|
534 |
val witnessed = map #2 (Sign.witness_sorts thy present extra); |
|
535 |
in Sorts.subtract witnessed shyps end; |
|
7642 | 536 |
in |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
537 |
Thm {thy_ref = thy_ref, der = der, maxidx = maxidx, |
16656 | 538 |
shyps = shyps', hyps = hyps, tpairs = tpairs, prop = prop} |
7642 | 539 |
end; |
1238 | 540 |
|
16656 | 541 |
(*dangling sort constraints of a thm*) |
542 |
fun extra_shyps (th as Thm {shyps, ...}) = Sorts.subtract (present_sorts th) shyps; |
|
543 |
||
1238 | 544 |
|
545 |
||
1529 | 546 |
(** Axioms **) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
547 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
548 |
(*look up the named axiom in the theory or its ancestors*) |
15672 | 549 |
fun get_axiom_i theory name = |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
550 |
let |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
551 |
fun get_ax thy = |
17412 | 552 |
Symtab.lookup (#2 (#axioms (Theory.rep_theory thy))) name |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
553 |
|> Option.map (fn prop => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
554 |
Thm {thy_ref = Theory.self_ref thy, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
555 |
der = Pt.infer_derivs' I (false, Pt.axm_proof name prop), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
556 |
maxidx = maxidx_of_term prop, |
16656 | 557 |
shyps = may_insert_term_sorts thy prop [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
558 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
559 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
560 |
prop = prop}); |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
561 |
in |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
562 |
(case get_first get_ax (theory :: Theory.ancestors_of theory) of |
15531 | 563 |
SOME thm => thm |
564 |
| NONE => raise THEORY ("No axiom " ^ quote name, [theory])) |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
565 |
end; |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
566 |
|
16352 | 567 |
fun get_axiom thy = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
568 |
get_axiom_i thy o NameSpace.intern (Theory.axiom_space thy); |
15672 | 569 |
|
6368 | 570 |
fun def_name name = name ^ "_def"; |
571 |
fun get_def thy = get_axiom thy o def_name; |
|
4847 | 572 |
|
1529 | 573 |
|
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
574 |
(*return additional axioms of this theory node*) |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
575 |
fun axioms_of thy = |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
576 |
map (fn (s, _) => (s, get_axiom thy s)) |
16352 | 577 |
(Symtab.dest (#2 (#axioms (Theory.rep_theory thy)))); |
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
578 |
|
6089 | 579 |
|
580 |
(* name and tags -- make proof objects more readable *) |
|
581 |
||
12923 | 582 |
fun get_name_tags (Thm {hyps, prop, der = (_, prf), ...}) = |
583 |
Pt.get_name_tags hyps prop prf; |
|
4018 | 584 |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
585 |
fun put_name_tags x (Thm {thy_ref, der = (ora, prf), maxidx, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
586 |
shyps, hyps, tpairs = [], prop}) = Thm {thy_ref = thy_ref, |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
587 |
der = (ora, Pt.thm_proof (Theory.deref thy_ref) x hyps prop prf), |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
588 |
maxidx = maxidx, shyps = shyps, hyps = hyps, tpairs = [], prop = prop} |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
589 |
| put_name_tags _ thm = |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
590 |
raise THM ("put_name_tags: unsolved flex-flex constraints", 0, [thm]); |
6089 | 591 |
|
592 |
val name_of_thm = #1 o get_name_tags; |
|
593 |
val tags_of_thm = #2 o get_name_tags; |
|
594 |
||
595 |
fun name_thm (name, thm) = put_name_tags (name, tags_of_thm thm) thm; |
|
0 | 596 |
|
597 |
||
1529 | 598 |
(*Compression of theorems -- a separate rule, not integrated with the others, |
599 |
as it could be slow.*) |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
600 |
fun compress (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
16991 | 601 |
let val thy = Theory.deref thy_ref in |
602 |
Thm {thy_ref = thy_ref, |
|
603 |
der = der, |
|
604 |
maxidx = maxidx, |
|
605 |
shyps = shyps, |
|
606 |
hyps = map (Compress.term thy) hyps, |
|
607 |
tpairs = map (pairself (Compress.term thy)) tpairs, |
|
608 |
prop = Compress.term thy prop} |
|
609 |
end; |
|
16945 | 610 |
|
611 |
fun adjust_maxidx_thm (Thm {thy_ref, der, shyps, hyps, tpairs, prop, ...}) = |
|
612 |
Thm {thy_ref = thy_ref, |
|
613 |
der = der, |
|
614 |
maxidx = maxidx_tpairs tpairs (maxidx_of_term prop), |
|
615 |
shyps = shyps, |
|
616 |
hyps = hyps, |
|
617 |
tpairs = tpairs, |
|
618 |
prop = prop}; |
|
564 | 619 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
620 |
|
2509 | 621 |
|
1529 | 622 |
(*** Meta rules ***) |
0 | 623 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
624 |
(** primitive rules **) |
0 | 625 |
|
16656 | 626 |
(*The assumption rule A |- A*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
627 |
fun assume raw_ct = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
628 |
let val Cterm {thy_ref, t = prop, T, maxidx, sorts} = adjust_maxidx raw_ct in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
629 |
if T <> propT then |
19230 | 630 |
raise THM ("assume: prop", 0, []) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
631 |
else if maxidx <> ~1 then |
19230 | 632 |
raise THM ("assume: variables", maxidx, []) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
633 |
else Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
634 |
der = Pt.infer_derivs' I (false, Pt.Hyp prop), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
635 |
maxidx = ~1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
636 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
637 |
hyps = [prop], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
638 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
639 |
prop = prop} |
0 | 640 |
end; |
641 |
||
1220 | 642 |
(*Implication introduction |
3529 | 643 |
[A] |
644 |
: |
|
645 |
B |
|
1220 | 646 |
------- |
647 |
A ==> B |
|
648 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
649 |
fun implies_intr |
16679 | 650 |
(ct as Cterm {t = A, T, maxidx = maxidxA, sorts, ...}) |
651 |
(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
|
652 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
653 |
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
|
654 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
655 |
Thm {thy_ref = merge_thys1 ct th, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
656 |
der = Pt.infer_derivs' (Pt.implies_intr_proof A) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
657 |
maxidx = Int.max (maxidxA, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
658 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
659 |
hyps = remove_hyps A hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
660 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
661 |
prop = implies $ A $ prop}; |
0 | 662 |
|
1529 | 663 |
|
1220 | 664 |
(*Implication elimination |
665 |
A ==> B A |
|
666 |
------------ |
|
667 |
B |
|
668 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
669 |
fun implies_elim thAB thA = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
670 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
671 |
val Thm {maxidx = maxA, der = derA, hyps = hypsA, shyps = shypsA, tpairs = tpairsA, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
672 |
prop = propA, ...} = thA |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
673 |
and Thm {der, maxidx, hyps, shyps, tpairs, prop, ...} = thAB; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
674 |
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
|
675 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
676 |
case prop of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
677 |
imp $ A $ B => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
678 |
if imp = Term.implies andalso A aconv propA then |
16656 | 679 |
Thm {thy_ref = merge_thys2 thAB thA, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
680 |
der = Pt.infer_derivs (curry Pt.%%) der derA, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
681 |
maxidx = Int.max (maxA, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
682 |
shyps = Sorts.union shypsA shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
683 |
hyps = union_hyps hypsA hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
684 |
tpairs = union_tpairs tpairsA tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
685 |
prop = B} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
686 |
else err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
687 |
| _ => err () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
688 |
end; |
250 | 689 |
|
1220 | 690 |
(*Forall introduction. The Free or Var x must not be free in the hypotheses. |
16656 | 691 |
[x] |
692 |
: |
|
693 |
A |
|
694 |
------ |
|
695 |
!!x. A |
|
1220 | 696 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
697 |
fun forall_intr |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
698 |
(ct as Cterm {t = x, T, sorts, ...}) |
16679 | 699 |
(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
|
700 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
701 |
fun result a = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
702 |
Thm {thy_ref = merge_thys1 ct th, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
703 |
der = Pt.infer_derivs' (Pt.forall_intr_proof x a) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
704 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
705 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
706 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
707 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
708 |
prop = all T $ Abs (a, T, abstract_over (x, prop))}; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
709 |
fun check_occs x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
710 |
if exists (fn t => Logic.occs (x, t)) ts then |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
711 |
raise THM("forall_intr: variable free in assumptions", 0, [th]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
712 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
713 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
714 |
case x of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
715 |
Free (a, _) => (check_occs x hyps; check_occs x (terms_of_tpairs tpairs); result a) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
716 |
| Var ((a, _), _) => (check_occs x (terms_of_tpairs tpairs); result a) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
717 |
| _ => raise THM ("forall_intr: not a variable", 0, [th]) |
0 | 718 |
end; |
719 |
||
1220 | 720 |
(*Forall elimination |
16656 | 721 |
!!x. A |
1220 | 722 |
------ |
723 |
A[t/x] |
|
724 |
*) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
725 |
fun forall_elim |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
726 |
(ct as Cterm {t, T, maxidx = maxt, sorts, ...}) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
727 |
(th as Thm {der, maxidx, shyps, hyps, tpairs, prop, ...}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
728 |
(case prop of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
729 |
Const ("all", Type ("fun", [Type ("fun", [qary, _]), _])) $ A => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
730 |
if T <> qary then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
731 |
raise THM ("forall_elim: type mismatch", 0, [th]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
732 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
733 |
Thm {thy_ref = merge_thys1 ct th, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
734 |
der = Pt.infer_derivs' (Pt.% o rpair (SOME t)) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
735 |
maxidx = Int.max (maxidx, maxt), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
736 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
737 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
738 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
739 |
prop = Term.betapply (A, t)} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
740 |
| _ => raise THM ("forall_elim: not quantified", 0, [th])); |
0 | 741 |
|
742 |
||
1220 | 743 |
(* Equality *) |
0 | 744 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
745 |
(*Reflexivity |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
746 |
t == t |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
747 |
*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
748 |
fun reflexive (ct as Cterm {thy_ref, t, T, maxidx, sorts}) = |
16656 | 749 |
Thm {thy_ref = thy_ref, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
750 |
der = Pt.infer_derivs' I (false, Pt.reflexive), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
751 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
752 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
753 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
754 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
755 |
prop = Logic.mk_equals (t, t)}; |
0 | 756 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
757 |
(*Symmetry |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
758 |
t == u |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
759 |
------ |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
760 |
u == t |
1220 | 761 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
762 |
fun symmetric (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
763 |
(case prop of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
764 |
(eq as Const ("==", Type (_, [T, _]))) $ t $ u => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
765 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
766 |
der = Pt.infer_derivs' Pt.symmetric der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
767 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
768 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
769 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
770 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
771 |
prop = eq $ u $ t} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
772 |
| _ => raise THM ("symmetric", 0, [th])); |
0 | 773 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
774 |
(*Transitivity |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
775 |
t1 == u u == t2 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
776 |
------------------ |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
777 |
t1 == t2 |
1220 | 778 |
*) |
0 | 779 |
fun transitive th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
780 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
781 |
val Thm {der = der1, maxidx = max1, hyps = hyps1, shyps = shyps1, tpairs = tpairs1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
782 |
prop = prop1, ...} = th1 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
783 |
and Thm {der = der2, maxidx = max2, hyps = hyps2, shyps = shyps2, tpairs = tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
784 |
prop = prop2, ...} = th2; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
785 |
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
|
786 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
787 |
case (prop1, prop2) of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
788 |
((eq as Const ("==", Type (_, [T, _]))) $ t1 $ u, Const ("==", _) $ u' $ t2) => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
789 |
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
|
790 |
else |
16656 | 791 |
Thm {thy_ref = merge_thys2 th1 th2, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
792 |
der = Pt.infer_derivs (Pt.transitive u T) der1 der2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
793 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
794 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
795 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
796 |
tpairs = union_tpairs tpairs1 tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
797 |
prop = eq $ t1 $ t2} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
798 |
| _ => err "premises" |
0 | 799 |
end; |
800 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
801 |
(*Beta-conversion |
16656 | 802 |
(%x. t)(u) == t[u/x] |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
803 |
fully beta-reduces the term if full = true |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
804 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
805 |
fun beta_conversion full (Cterm {thy_ref, t, T, maxidx, sorts}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
806 |
let val t' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
807 |
if full then Envir.beta_norm t |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
808 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
809 |
(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
|
810 |
| _ => raise THM ("beta_conversion: not a redex", 0, [])); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
811 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
812 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
813 |
der = Pt.infer_derivs' I (false, Pt.reflexive), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
814 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
815 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
816 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
817 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
818 |
prop = Logic.mk_equals (t, t')} |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
819 |
end; |
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
820 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
821 |
fun eta_conversion (Cterm {thy_ref, t, T, maxidx, sorts}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
822 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
823 |
der = Pt.infer_derivs' I (false, Pt.reflexive), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
824 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
825 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
826 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
827 |
tpairs = [], |
18944 | 828 |
prop = Logic.mk_equals (t, Envir.eta_contract t)}; |
0 | 829 |
|
830 |
(*The abstraction rule. The Free or Var x must not be free in the hypotheses. |
|
831 |
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
|
832 |
t == u |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
833 |
-------------- |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
834 |
%x. t == %x. u |
1220 | 835 |
*) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
836 |
fun abstract_rule a |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
837 |
(Cterm {t = x, T, sorts, ...}) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
838 |
(th as Thm {thy_ref, der, maxidx, hyps, shyps, tpairs, prop}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
839 |
let |
17708 | 840 |
val string_of = Sign.string_of_term (Theory.deref thy_ref); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
841 |
val (t, u) = Logic.dest_equals prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
842 |
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
|
843 |
val result = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
844 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
845 |
der = Pt.infer_derivs' (Pt.abstract_rule x a) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
846 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
847 |
shyps = Sorts.union sorts shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
848 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
849 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
850 |
prop = Logic.mk_equals |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
851 |
(Abs (a, T, abstract_over (x, t)), Abs (a, T, abstract_over (x, u)))}; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
852 |
fun check_occs x ts = |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
853 |
if exists (fn t => Logic.occs (x, t)) ts then |
17708 | 854 |
raise THM ("abstract_rule: variable free in assumptions " ^ string_of x, 0, [th]) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
855 |
else (); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
856 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
857 |
case x of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
858 |
Free _ => (check_occs x hyps; check_occs x (terms_of_tpairs tpairs); result) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
859 |
| Var _ => (check_occs x (terms_of_tpairs tpairs); result) |
17708 | 860 |
| _ => raise THM ("abstract_rule: not a variable " ^ string_of x, 0, [th]) |
0 | 861 |
end; |
862 |
||
863 |
(*The combination rule |
|
3529 | 864 |
f == g t == u |
865 |
-------------- |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
866 |
f t == g u |
1220 | 867 |
*) |
0 | 868 |
fun combination th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
869 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
870 |
val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
871 |
prop = prop1, ...} = th1 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
872 |
and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
873 |
prop = prop2, ...} = th2; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
874 |
fun chktypes fT tT = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
875 |
(case fT of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
876 |
Type ("fun", [T1, T2]) => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
877 |
if T1 <> tT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
878 |
raise THM ("combination: types", 0, [th1, th2]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
879 |
else () |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
880 |
| _ => 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
|
881 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
882 |
case (prop1, prop2) of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
883 |
(Const ("==", Type ("fun", [fT, _])) $ f $ g, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
884 |
Const ("==", Type ("fun", [tT, _])) $ t $ u) => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
885 |
(chktypes fT tT; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
886 |
Thm {thy_ref = merge_thys2 th1 th2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
887 |
der = Pt.infer_derivs (Pt.combination f g t u fT) der1 der2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
888 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
889 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
890 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
891 |
tpairs = union_tpairs tpairs1 tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
892 |
prop = Logic.mk_equals (f $ t, g $ u)}) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
893 |
| _ => raise THM ("combination: premises", 0, [th1, th2]) |
0 | 894 |
end; |
895 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
896 |
(*Equality introduction |
3529 | 897 |
A ==> B B ==> A |
898 |
---------------- |
|
899 |
A == B |
|
1220 | 900 |
*) |
0 | 901 |
fun equal_intr th1 th2 = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
902 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
903 |
val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, tpairs = tpairs1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
904 |
prop = prop1, ...} = th1 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
905 |
and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, tpairs = tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
906 |
prop = prop2, ...} = th2; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
907 |
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
|
908 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
909 |
case (prop1, prop2) of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
910 |
(Const("==>", _) $ A $ B, Const("==>", _) $ B' $ A') => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
911 |
if A aconv A' andalso B aconv B' then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
912 |
Thm {thy_ref = merge_thys2 th1 th2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
913 |
der = Pt.infer_derivs (Pt.equal_intr A B) der1 der2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
914 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
915 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
916 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
917 |
tpairs = union_tpairs tpairs1 tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
918 |
prop = Logic.mk_equals (A, B)} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
919 |
else err "not equal" |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
920 |
| _ => err "premises" |
1529 | 921 |
end; |
922 |
||
923 |
(*The equal propositions rule |
|
3529 | 924 |
A == B A |
1529 | 925 |
--------- |
926 |
B |
|
927 |
*) |
|
928 |
fun equal_elim th1 th2 = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
929 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
930 |
val Thm {der = der1, maxidx = max1, shyps = shyps1, hyps = hyps1, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
931 |
tpairs = tpairs1, prop = prop1, ...} = th1 |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
932 |
and Thm {der = der2, maxidx = max2, shyps = shyps2, hyps = hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
933 |
tpairs = tpairs2, prop = prop2, ...} = th2; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
934 |
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
|
935 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
936 |
case prop1 of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
937 |
Const ("==", _) $ A $ B => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
938 |
if prop2 aconv A then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
939 |
Thm {thy_ref = merge_thys2 th1 th2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
940 |
der = Pt.infer_derivs (Pt.equal_elim A B) der1 der2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
941 |
maxidx = Int.max (max1, max2), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
942 |
shyps = Sorts.union shyps1 shyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
943 |
hyps = union_hyps hyps1 hyps2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
944 |
tpairs = union_tpairs tpairs1 tpairs2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
945 |
prop = B} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
946 |
else err "not equal" |
1529 | 947 |
| _ => err"major premise" |
948 |
end; |
|
0 | 949 |
|
1220 | 950 |
|
951 |
||
0 | 952 |
(**** Derived rules ****) |
953 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
954 |
(*Smash unifies the list of term pairs leaving no flex-flex pairs. |
250 | 955 |
Instantiates the theorem and deletes trivial tpairs. |
0 | 956 |
Resulting sequence may contain multiple elements if the tpairs are |
957 |
not all flex-flex. *) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
958 |
fun flexflex_rule (th as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
19861 | 959 |
Unify.smash_unifiers (Theory.deref thy_ref) tpairs (Envir.empty maxidx) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
960 |
|> Seq.map (fn env => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
961 |
if Envir.is_empty env then th |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
962 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
963 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
964 |
val tpairs' = tpairs |> map (pairself (Envir.norm_term env)) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
965 |
(*remove trivial tpairs, of the form t==t*) |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
966 |
|> filter_out (op aconv); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
967 |
val prop' = Envir.norm_term env prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
968 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
969 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
970 |
der = Pt.infer_derivs' (Pt.norm_proof' env) der, |
16711 | 971 |
maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'), |
16656 | 972 |
shyps = may_insert_env_sorts (Theory.deref thy_ref) env shyps, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
973 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
974 |
tpairs = tpairs', |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
975 |
prop = prop'} |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
976 |
end); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
977 |
|
0 | 978 |
|
19910 | 979 |
(*Generalization of fixed variables |
980 |
A |
|
981 |
-------------------- |
|
982 |
A[?'a/'a, ?x/x, ...] |
|
983 |
*) |
|
984 |
||
985 |
fun generalize ([], []) _ th = th |
|
986 |
| generalize (tfrees, frees) idx th = |
|
987 |
let |
|
988 |
val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop} = th; |
|
989 |
val _ = idx <= maxidx andalso raise THM ("generalize: bad index", idx, [th]); |
|
990 |
||
991 |
val bad_type = if null tfrees then K false else |
|
992 |
Term.exists_subtype (fn TFree (a, _) => member (op =) tfrees a | _ => false); |
|
993 |
fun bad_term (Free (x, T)) = bad_type T orelse member (op =) frees x |
|
994 |
| bad_term (Var (_, T)) = bad_type T |
|
995 |
| bad_term (Const (_, T)) = bad_type T |
|
996 |
| bad_term (Abs (_, T, t)) = bad_type T orelse bad_term t |
|
997 |
| bad_term (t $ u) = bad_term t orelse bad_term u |
|
998 |
| bad_term (Bound _) = false; |
|
999 |
val _ = exists bad_term hyps andalso |
|
1000 |
raise THM ("generalize: variable free in assumptions", 0, [th]); |
|
1001 |
||
1002 |
val gen = Term.generalize (tfrees, frees) idx; |
|
1003 |
val prop' = gen prop; |
|
1004 |
val tpairs' = map (pairself gen) tpairs; |
|
1005 |
val maxidx' = maxidx_tpairs tpairs' (maxidx_of_term prop'); |
|
1006 |
in |
|
1007 |
Thm { |
|
1008 |
thy_ref = thy_ref, |
|
1009 |
der = Pt.infer_derivs' (Pt.generalize (tfrees, frees) idx) der, |
|
1010 |
maxidx = maxidx', |
|
1011 |
shyps = shyps, |
|
1012 |
hyps = hyps, |
|
1013 |
tpairs = tpairs', |
|
1014 |
prop = prop'} |
|
1015 |
end; |
|
1016 |
||
1017 |
||
0 | 1018 |
(*Instantiation of Vars |
16656 | 1019 |
A |
1020 |
-------------------- |
|
1021 |
A[t1/v1, ..., tn/vn] |
|
1220 | 1022 |
*) |
0 | 1023 |
|
6928 | 1024 |
local |
1025 |
||
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1026 |
fun pretty_typing thy t T = |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1027 |
Pretty.block [Sign.pretty_term thy t, Pretty.str " ::", Pretty.brk 1, Sign.pretty_typ thy T]; |
15797 | 1028 |
|
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1029 |
fun add_inst (ct, cu) (thy_ref, sorts) = |
6928 | 1030 |
let |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1031 |
val Cterm {t = t, T = T, ...} = ct |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1032 |
and Cterm {t = u, T = U, sorts = sorts_u, ...} = cu; |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1033 |
val thy_ref' = Theory.merge_refs (thy_ref, merge_thys0 ct cu); |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1034 |
val sorts' = Sorts.union sorts_u sorts; |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3895
diff
changeset
|
1035 |
in |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1036 |
(case t of Var v => |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1037 |
if T = U then ((v, u), (thy_ref', sorts')) |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1038 |
else raise TYPE (Pretty.string_of (Pretty.block |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1039 |
[Pretty.str "instantiate: type conflict", |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1040 |
Pretty.fbrk, pretty_typing (Theory.deref thy_ref') t T, |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1041 |
Pretty.fbrk, pretty_typing (Theory.deref thy_ref') u U]), [T, U], [t, u]) |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1042 |
| _ => raise TYPE (Pretty.string_of (Pretty.block |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1043 |
[Pretty.str "instantiate: not a variable", |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1044 |
Pretty.fbrk, Sign.pretty_term (Theory.deref thy_ref') t]), [], [t])) |
0 | 1045 |
end; |
1046 |
||
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1047 |
fun add_instT (cT, cU) (thy_ref, sorts) = |
16656 | 1048 |
let |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1049 |
val Ctyp {T, thy_ref = thy_ref1, ...} = cT |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1050 |
and Ctyp {T = U, thy_ref = thy_ref2, sorts = sorts_U, ...} = cU; |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1051 |
val thy_ref' = Theory.merge_refs (thy_ref, Theory.merge_refs (thy_ref1, thy_ref2)); |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1052 |
val thy' = Theory.deref thy_ref'; |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1053 |
val sorts' = Sorts.union sorts_U sorts; |
16656 | 1054 |
in |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1055 |
(case T of TVar (v as (_, S)) => |
17203 | 1056 |
if Sign.of_sort thy' (U, S) then ((v, U), (thy_ref', sorts')) |
16656 | 1057 |
else raise TYPE ("Type not of sort " ^ Sign.string_of_sort thy' S, [U], []) |
1058 |
| _ => raise TYPE (Pretty.string_of (Pretty.block |
|
15797 | 1059 |
[Pretty.str "instantiate: not a type variable", |
16656 | 1060 |
Pretty.fbrk, Sign.pretty_typ thy' T]), [T], [])) |
1061 |
end; |
|
0 | 1062 |
|
6928 | 1063 |
in |
1064 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1065 |
(*Left-to-right replacements: ctpairs = [..., (vi, ti), ...]. |
0 | 1066 |
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
|
1067 |
Does NOT normalize the resulting theorem!*) |
1529 | 1068 |
fun instantiate ([], []) th = th |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1069 |
| instantiate (instT, inst) th = |
16656 | 1070 |
let |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1071 |
val Thm {thy_ref, der, hyps, shyps, tpairs, prop, ...} = th; |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1072 |
val (inst', (instT', (thy_ref', shyps'))) = |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1073 |
(thy_ref, shyps) |> fold_map add_inst inst ||> fold_map add_instT instT; |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1074 |
val subst = Term.instantiate (instT', inst'); |
16656 | 1075 |
val prop' = subst prop; |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1076 |
val tpairs' = map (pairself subst) tpairs; |
16656 | 1077 |
in |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1078 |
if has_duplicates (fn ((v, _), (v', _)) => Term.eq_var (v, v')) inst' then |
16656 | 1079 |
raise THM ("instantiate: variables not distinct", 0, [th]) |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1080 |
else if has_duplicates (fn ((v, _), (v', _)) => Term.eq_tvar (v, v')) instT' then |
16656 | 1081 |
raise THM ("instantiate: type variables not distinct", 0, [th]) |
1082 |
else |
|
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1083 |
Thm {thy_ref = thy_ref', |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1084 |
der = Pt.infer_derivs' (Pt.instantiate (instT', inst')) der, |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1085 |
maxidx = maxidx_tpairs tpairs' (maxidx_of_term prop'), |
16656 | 1086 |
shyps = shyps', |
1087 |
hyps = hyps, |
|
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1088 |
tpairs = tpairs', |
16656 | 1089 |
prop = prop'} |
1090 |
end |
|
1091 |
handle TYPE (msg, _, _) => raise THM (msg, 0, [th]); |
|
6928 | 1092 |
|
1093 |
end; |
|
1094 |
||
0 | 1095 |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1096 |
(*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
|
1097 |
A can contain Vars, not so for assume!*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1098 |
fun trivial (Cterm {thy_ref, t =A, T, maxidx, sorts}) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1099 |
if T <> propT then |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1100 |
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
|
1101 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1102 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1103 |
der = Pt.infer_derivs' I (false, Pt.AbsP ("H", NONE, Pt.PBound 0)), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1104 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1105 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1106 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1107 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1108 |
prop = implies $ A $ A}; |
0 | 1109 |
|
1503 | 1110 |
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1111 |
fun class_triv thy c = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1112 |
let val Cterm {thy_ref, t, maxidx, sorts, ...} = |
19525 | 1113 |
cterm_of thy (Logic.mk_inclass (TVar (("'a", 0), [c]), Sign.certify_class thy c)) |
6368 | 1114 |
handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []); |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1115 |
in |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1116 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1117 |
der = Pt.infer_derivs' I (false, Pt.PAxm ("ProtoPure.class_triv:" ^ c, t, SOME [])), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1118 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1119 |
shyps = sorts, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1120 |
hyps = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1121 |
tpairs = [], |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1122 |
prop = t} |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1123 |
end; |
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1124 |
|
19505 | 1125 |
(*Internalize sort constraints of type variable*) |
1126 |
fun unconstrainT |
|
1127 |
(Ctyp {thy_ref = thy_ref1, T, ...}) |
|
1128 |
(th as Thm {thy_ref = thy_ref2, der, maxidx, shyps, hyps, tpairs, prop}) = |
|
1129 |
let |
|
1130 |
val ((x, i), S) = Term.dest_TVar T handle TYPE _ => |
|
1131 |
raise THM ("unconstrainT: not a type variable", 0, [th]); |
|
1132 |
val T' = TVar ((x, i), []); |
|
1133 |
val unconstrain = Term.map_term_types (Term.map_atyps (fn U => if U = T then T' else U)); |
|
1134 |
val constraints = map (curry Logic.mk_inclass T') S; |
|
1135 |
in |
|
1136 |
Thm {thy_ref = Theory.merge_refs (thy_ref1, thy_ref2), |
|
1137 |
der = Pt.infer_derivs' I (false, Pt.PAxm ("ProtoPure.unconstrainT", prop, SOME [])), |
|
1138 |
maxidx = Int.max (maxidx, i), |
|
1139 |
shyps = Sorts.remove_sort S shyps, |
|
1140 |
hyps = hyps, |
|
1141 |
tpairs = map (pairself unconstrain) tpairs, |
|
1142 |
prop = Logic.list_implies (constraints, unconstrain prop)} |
|
1143 |
end; |
|
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1144 |
|
6786 | 1145 |
(* Replace all TFrees not fixed or in the hyps by new TVars *) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1146 |
fun varifyT' fixed (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
12500 | 1147 |
let |
15797 | 1148 |
val tfrees = foldr add_term_tfrees fixed hyps; |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1149 |
val prop1 = attach_tpairs tpairs prop; |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1150 |
val (prop2, al) = Type.varify (prop1, tfrees); |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1151 |
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
|
1152 |
in |
18127 | 1153 |
(al, Thm {thy_ref = thy_ref, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1154 |
der = Pt.infer_derivs' (Pt.varify_proof prop tfrees) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1155 |
maxidx = Int.max (0, maxidx), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1156 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1157 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1158 |
tpairs = rev (map Logic.dest_equals ts), |
18127 | 1159 |
prop = prop3}) |
0 | 1160 |
end; |
1161 |
||
18127 | 1162 |
val varifyT = #2 o varifyT' []; |
6786 | 1163 |
|
0 | 1164 |
(* Replace all TVars by new TFrees *) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1165 |
fun freezeT (Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1166 |
let |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1167 |
val prop1 = attach_tpairs tpairs prop; |
16287 | 1168 |
val prop2 = Type.freeze prop1; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1169 |
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
|
1170 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1171 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1172 |
der = Pt.infer_derivs' (Pt.freezeT prop1) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1173 |
maxidx = maxidx_of_term prop2, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1174 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1175 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1176 |
tpairs = rev (map Logic.dest_equals ts), |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1177 |
prop = prop3} |
1220 | 1178 |
end; |
0 | 1179 |
|
1180 |
||
1181 |
(*** Inference rules for tactics ***) |
|
1182 |
||
1183 |
(*Destruct proof state into constraints, other goals, goal(i), rest *) |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1184 |
fun dest_state (state as Thm{prop,tpairs,...}, i) = |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1185 |
(case Logic.strip_prems(i, [], prop) of |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1186 |
(B::rBs, C) => (tpairs, rev rBs, B, C) |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1187 |
| _ => raise THM("dest_state", i, [state])) |
0 | 1188 |
handle TERM _ => raise THM("dest_state", i, [state]); |
1189 |
||
309 | 1190 |
(*Increment variables and parameters of orule as required for |
18035 | 1191 |
resolution with a goal.*) |
1192 |
fun lift_rule goal orule = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1193 |
let |
18035 | 1194 |
val Cterm {t = gprop, T, maxidx = gmax, sorts, ...} = goal; |
1195 |
val inc = gmax + 1; |
|
1196 |
val lift_abs = Logic.lift_abs inc gprop; |
|
1197 |
val lift_all = Logic.lift_all inc gprop; |
|
1198 |
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
|
1199 |
val (As, B) = Logic.strip_horn prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1200 |
in |
18035 | 1201 |
if T <> propT then raise THM ("lift_rule: the term must have type prop", 0, []) |
1202 |
else |
|
1203 |
Thm {thy_ref = merge_thys1 goal orule, |
|
1204 |
der = Pt.infer_derivs' (Pt.lift_proof gprop inc prop) der, |
|
1205 |
maxidx = maxidx + inc, |
|
1206 |
shyps = Sorts.union shyps sorts, (*sic!*) |
|
1207 |
hyps = hyps, |
|
1208 |
tpairs = map (pairself lift_abs) tpairs, |
|
1209 |
prop = Logic.list_implies (map lift_all As, lift_all B)} |
|
0 | 1210 |
end; |
1211 |
||
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1212 |
fun incr_indexes i (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1213 |
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
|
1214 |
else if i = 0 then thm |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1215 |
else |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1216 |
Thm {thy_ref = thy_ref, |
16884
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1217 |
der = Pt.infer_derivs' |
1678a796b6b2
tuned instantiate (avoid subst_atomic, subst_atomic_types);
wenzelm
parents:
16847
diff
changeset
|
1218 |
(Pt.map_proof_terms (Logic.incr_indexes ([], i)) (Logic.incr_tvar i)) der, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1219 |
maxidx = maxidx + i, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1220 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1221 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1222 |
tpairs = map (pairself (Logic.incr_indexes ([], i))) tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1223 |
prop = Logic.incr_indexes ([], i) prop}; |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1224 |
|
0 | 1225 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *) |
1226 |
fun assumption i state = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1227 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1228 |
val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state; |
16656 | 1229 |
val thy = Theory.deref thy_ref; |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1230 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1231 |
fun newth n (env as Envir.Envir {maxidx, ...}, tpairs) = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1232 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1233 |
der = Pt.infer_derivs' |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1234 |
((if Envir.is_empty env then I else (Pt.norm_proof' env)) o |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1235 |
Pt.assumption_proof Bs Bi n) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1236 |
maxidx = maxidx, |
16656 | 1237 |
shyps = may_insert_env_sorts thy env shyps, |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1238 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1239 |
tpairs = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1240 |
if Envir.is_empty env then tpairs |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1241 |
else map (pairself (Envir.norm_term env)) tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1242 |
prop = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1243 |
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
|
1244 |
Logic.list_implies (Bs, C) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1245 |
else (*normalize the new rule fully*) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1246 |
Envir.norm_term env (Logic.list_implies (Bs, C))}; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1247 |
fun addprfs [] _ = Seq.empty |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1248 |
| addprfs ((t, u) :: apairs) n = Seq.make (fn () => Seq.pull |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1249 |
(Seq.mapp (newth n) |
16656 | 1250 |
(Unify.unifiers (thy, Envir.empty maxidx, (t, u) :: tpairs)) |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1251 |
(addprfs apairs (n + 1)))) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1252 |
in addprfs (Logic.assum_pairs (~1, Bi)) 1 end; |
0 | 1253 |
|
250 | 1254 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. |
0 | 1255 |
Checks if Bi's conclusion is alpha-convertible to one of its assumptions*) |
1256 |
fun eq_assumption i state = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1257 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1258 |
val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1259 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1260 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1261 |
(case find_index (op aconv) (Logic.assum_pairs (~1, Bi)) of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1262 |
~1 => raise THM ("eq_assumption", 0, [state]) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1263 |
| n => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1264 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1265 |
der = Pt.infer_derivs' (Pt.assumption_proof Bs Bi (n + 1)) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1266 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1267 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1268 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1269 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1270 |
prop = Logic.list_implies (Bs, C)}) |
0 | 1271 |
end; |
1272 |
||
1273 |
||
2671 | 1274 |
(*For rotate_tac: fast rotation of assumptions of subgoal i*) |
1275 |
fun rotate_rule k i state = |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1276 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1277 |
val Thm {thy_ref, der, maxidx, shyps, hyps, prop, ...} = state; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1278 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1279 |
val params = Term.strip_all_vars Bi |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1280 |
and rest = Term.strip_all_body Bi; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1281 |
val asms = Logic.strip_imp_prems rest |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1282 |
and concl = Logic.strip_imp_concl rest; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1283 |
val n = length asms; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1284 |
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
|
1285 |
val Bi' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1286 |
if 0 = m orelse m = n then Bi |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1287 |
else if 0 < m andalso m < n then |
19012 | 1288 |
let val (ps, qs) = chop m asms |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1289 |
in list_all (params, Logic.list_implies (qs @ ps, concl)) end |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1290 |
else raise THM ("rotate_rule", k, [state]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1291 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1292 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1293 |
der = Pt.infer_derivs' (Pt.rotate_proof Bs Bi m) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1294 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1295 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1296 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1297 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1298 |
prop = Logic.list_implies (Bs @ [Bi'], C)} |
2671 | 1299 |
end; |
1300 |
||
1301 |
||
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1302 |
(*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
|
1303 |
unchanged. Does nothing if k=0 or if k equals n-j, where n is the |
16656 | 1304 |
number of premises. Useful with etac and underlies defer_tac*) |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1305 |
fun permute_prems j k rl = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1306 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1307 |
val Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop} = rl; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1308 |
val prems = Logic.strip_imp_prems prop |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1309 |
and concl = Logic.strip_imp_concl prop; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1310 |
val moved_prems = List.drop (prems, j) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1311 |
and fixed_prems = List.take (prems, j) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1312 |
handle Subscript => raise THM ("permute_prems: j", j, [rl]); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1313 |
val n_j = length moved_prems; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1314 |
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
|
1315 |
val prop' = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1316 |
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
|
1317 |
else if 0 < m andalso m < n_j then |
19012 | 1318 |
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
|
1319 |
in Logic.list_implies (fixed_prems @ qs @ ps, concl) end |
16725 | 1320 |
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
|
1321 |
in |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1322 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1323 |
der = Pt.infer_derivs' (Pt.permute_prems_prf prems j m) der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1324 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1325 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1326 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1327 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1328 |
prop = prop'} |
7248
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1329 |
end; |
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1330 |
|
322151fe6f02
new primitive rule permute_prems to underlie defer_tac and rotate_prems
paulson
parents:
7070
diff
changeset
|
1331 |
|
0 | 1332 |
(** User renaming of parameters in a subgoal **) |
1333 |
||
1334 |
(*Calls error rather than raising an exception because it is intended |
|
1335 |
for top-level use -- exception handling would not make sense here. |
|
1336 |
The names in cs, if distinct, are used for the innermost parameters; |
|
17868 | 1337 |
preceding parameters may be renamed to make all params distinct.*) |
0 | 1338 |
fun rename_params_rule (cs, i) state = |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1339 |
let |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1340 |
val Thm {thy_ref, der, maxidx, shyps, hyps, ...} = state; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1341 |
val (tpairs, Bs, Bi, C) = dest_state (state, i); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1342 |
val iparams = map #1 (Logic.strip_params Bi); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1343 |
val short = length iparams - length cs; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1344 |
val newnames = |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1345 |
if short < 0 then error "More names than abstractions!" |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1346 |
else variantlist (Library.take (short, iparams), cs) @ cs; |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1347 |
val freenames = map (#1 o dest_Free) (term_frees Bi); |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1348 |
val newBi = Logic.list_rename_params (newnames, Bi); |
250 | 1349 |
in |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1350 |
case findrep cs of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1351 |
c :: _ => (warning ("Can't rename. Bound variables not distinct: " ^ c); state) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1352 |
| [] => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1353 |
(case cs inter_string freenames of |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1354 |
a :: _ => (warning ("Can't rename. Bound/Free variable clash: " ^ a); state) |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1355 |
| [] => |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1356 |
Thm {thy_ref = thy_ref, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1357 |
der = der, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1358 |
maxidx = maxidx, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1359 |
shyps = shyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1360 |
hyps = hyps, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1361 |
tpairs = tpairs, |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1362 |
prop = Logic.list_implies (Bs @ [newBi], C)}) |
0 | 1363 |
end; |
1364 |
||
12982 | 1365 |
|
0 | 1366 |
(*** Preservation of bound variable names ***) |
1367 |
||
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1368 |
fun rename_boundvars pat obj (thm as Thm {thy_ref, der, maxidx, shyps, hyps, tpairs, prop}) = |
12982 | 1369 |
(case Term.rename_abs pat obj prop of |
15531 | 1370 |
NONE => thm |
1371 |
| SOME prop' => Thm |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1372 |
{thy_ref = thy_ref, |
12982 | 1373 |
der = der, |
1374 |
maxidx = maxidx, |
|
1375 |
hyps = hyps, |
|
1376 |
shyps = shyps, |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1377 |
tpairs = tpairs, |
12982 | 1378 |
prop = prop'}); |
10416
5b33e732e459
- Moved rewriting functions to meta_simplifier.ML
berghofe
parents:
10348
diff
changeset
|
1379 |
|
0 | 1380 |
|
16656 | 1381 |
(* strip_apply f (A, B) strips off all assumptions/parameters from A |
0 | 1382 |
introduced by lifting over B, and applies f to remaining part of A*) |
1383 |
fun strip_apply f = |
|
1384 |
let fun strip(Const("==>",_)$ A1 $ B1, |
|
250 | 1385 |
Const("==>",_)$ _ $ B2) = implies $ A1 $ strip(B1,B2) |
1386 |
| strip((c as Const("all",_)) $ Abs(a,T,t1), |
|
1387 |
Const("all",_) $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2)) |
|
1388 |
| strip(A,_) = f A |
|
0 | 1389 |
in strip end; |
1390 |
||
1391 |
(*Use the alist to rename all bound variables and some unknowns in a term |
|
1392 |
dpairs = current disagreement pairs; tpairs = permanent ones (flexflex); |
|
1393 |
Preserves unknowns in tpairs and on lhs of dpairs. *) |
|
1394 |
fun rename_bvs([],_,_,_) = I |
|
1395 |
| rename_bvs(al,dpairs,tpairs,B) = |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
1396 |
let val vars = foldr add_term_vars [] |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
1397 |
(map fst dpairs @ map fst tpairs @ map snd tpairs) |
250 | 1398 |
(*unknowns appearing elsewhere be preserved!*) |
1399 |
val vids = map (#1 o #1 o dest_Var) vars; |
|
1400 |
fun rename(t as Var((x,i),T)) = |
|
17184 | 1401 |
(case AList.lookup (op =) al x of |
15531 | 1402 |
SOME(y) => if x mem_string vids orelse y mem_string vids then t |
250 | 1403 |
else Var((y,i),T) |
15531 | 1404 |
| NONE=> t) |
0 | 1405 |
| rename(Abs(x,T,t)) = |
18944 | 1406 |
Abs (the_default x (AList.lookup (op =) al x), T, rename t) |
0 | 1407 |
| rename(f$t) = rename f $ rename t |
1408 |
| rename(t) = t; |
|
250 | 1409 |
fun strip_ren Ai = strip_apply rename (Ai,B) |
0 | 1410 |
in strip_ren end; |
1411 |
||
1412 |
(*Function to rename bounds/unknowns in the argument, lifted over B*) |
|
1413 |
fun rename_bvars(dpairs, tpairs, B) = |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
1414 |
rename_bvs(foldr Term.match_bvars [] dpairs, dpairs, tpairs, B); |
0 | 1415 |
|
1416 |
||
1417 |
(*** RESOLUTION ***) |
|
1418 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1419 |
(** Lifting optimizations **) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1420 |
|
0 | 1421 |
(*strip off pairs of assumptions/parameters in parallel -- they are |
1422 |
identical because of lifting*) |
|
250 | 1423 |
fun strip_assums2 (Const("==>", _) $ _ $ B1, |
1424 |
Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2) |
|
0 | 1425 |
| strip_assums2 (Const("all",_)$Abs(a,T,t1), |
250 | 1426 |
Const("all",_)$Abs(_,_,t2)) = |
0 | 1427 |
let val (B1,B2) = strip_assums2 (t1,t2) |
1428 |
in (Abs(a,T,B1), Abs(a,T,B2)) end |
|
1429 |
| strip_assums2 BB = BB; |
|
1430 |
||
1431 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1432 |
(*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
|
1433 |
fun norm_term_skip env 0 t = Envir.norm_term env t |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1434 |
| norm_term_skip env n (Const("all",_)$Abs(a,T,t)) = |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1435 |
let val Envir.Envir{iTs, ...} = env |
15797 | 1436 |
val T' = Envir.typ_subst_TVars iTs T |
1238 | 1437 |
(*Must instantiate types of parameters because they are flattened; |
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1438 |
this could be a NEW parameter*) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1439 |
in all T' $ Abs(a, T', norm_term_skip env n t) end |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1440 |
| norm_term_skip env n (Const("==>", _) $ A $ B) = |
1238 | 1441 |
implies $ A $ norm_term_skip env (n-1) B |
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1442 |
| norm_term_skip env n t = error"norm_term_skip: too few assumptions??"; |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1443 |
|
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1444 |
|
0 | 1445 |
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C) |
250 | 1446 |
Unifies B with Bi, replacing subgoal i (1 <= i <= n) |
0 | 1447 |
If match then forbid instantiations in proof state |
1448 |
If lifted then shorten the dpair using strip_assums2. |
|
1449 |
If eres_flg then simultaneously proves A1 by assumption. |
|
250 | 1450 |
nsubgoal is the number of new subgoals (written m above). |
0 | 1451 |
Curried so that resolution calls dest_state only once. |
1452 |
*) |
|
4270 | 1453 |
local exception COMPOSE |
0 | 1454 |
in |
18486 | 1455 |
fun bicompose_aux flatten match (state, (stpairs, Bs, Bi, C), lifted) |
0 | 1456 |
(eres_flg, orule, nsubgoal) = |
1529 | 1457 |
let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1458 |
and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps, |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1459 |
tpairs=rtpairs, prop=rprop,...} = orule |
1529 | 1460 |
(*How many hyps to skip over during normalization*) |
1238 | 1461 |
and nlift = Logic.count_prems(strip_all_body Bi, |
1462 |
if eres_flg then ~1 else 0) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1463 |
val thy_ref = merge_thys2 state orule; |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1464 |
val thy = Theory.deref thy_ref; |
0 | 1465 |
(** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **) |
11518 | 1466 |
fun addth A (As, oldAs, rder', n) ((env as Envir.Envir {maxidx, ...}, tpairs), thq) = |
250 | 1467 |
let val normt = Envir.norm_term env; |
1468 |
(*perform minimal copying here by examining env*) |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1469 |
val (ntpairs, normp) = |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1470 |
if Envir.is_empty env then (tpairs, (Bs @ As, C)) |
250 | 1471 |
else |
1472 |
let val ntps = map (pairself normt) tpairs |
|
19861 | 1473 |
in if Envir.above env smax then |
1238 | 1474 |
(*no assignments in state; normalize the rule only*) |
1475 |
if lifted |
|
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1476 |
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
|
1477 |
else (ntps, (Bs @ map normt As, C)) |
1529 | 1478 |
else if match then raise COMPOSE |
250 | 1479 |
else (*normalize the new rule fully*) |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1480 |
(ntps, (map normt (Bs @ As), normt C)) |
250 | 1481 |
end |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1482 |
val th = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1483 |
Thm{thy_ref = thy_ref, |
11518 | 1484 |
der = Pt.infer_derivs |
1485 |
((if Envir.is_empty env then I |
|
19861 | 1486 |
else if Envir.above env smax then |
11518 | 1487 |
(fn f => fn der => f (Pt.norm_proof' env der)) |
1488 |
else |
|
1489 |
curry op oo (Pt.norm_proof' env)) |
|
18486 | 1490 |
(Pt.bicompose_proof flatten Bs oldAs As A n)) rder' sder, |
2386 | 1491 |
maxidx = maxidx, |
16656 | 1492 |
shyps = may_insert_env_sorts thy env (Sorts.union rshyps sshyps), |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1493 |
hyps = union_hyps rhyps shyps, |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1494 |
tpairs = ntpairs, |
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1495 |
prop = Logic.list_implies normp} |
19475 | 1496 |
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
|
1497 |
val (rAs,B) = Logic.strip_prems(nsubgoal, [], rprop) |
0 | 1498 |
handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]); |
1499 |
(*Modify assumptions, deleting n-th if n>0 for e-resolution*) |
|
1500 |
fun newAs(As0, n, dpairs, tpairs) = |
|
11518 | 1501 |
let val (As1, rder') = |
1502 |
if !Logic.auto_rename orelse not lifted then (As0, rder) |
|
1503 |
else (map (rename_bvars(dpairs,tpairs,B)) As0, |
|
1504 |
Pt.infer_derivs' (Pt.map_proof_terms |
|
1505 |
(rename_bvars (dpairs, tpairs, Bound 0)) I) rder); |
|
18486 | 1506 |
in (map (if flatten then (Logic.flatten_params n) else I) As1, As1, rder', n) |
250 | 1507 |
handle TERM _ => |
1508 |
raise THM("bicompose: 1st premise", 0, [orule]) |
|
0 | 1509 |
end; |
2147 | 1510 |
val env = Envir.empty(Int.max(rmax,smax)); |
0 | 1511 |
val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi); |
1512 |
val dpairs = BBi :: (rtpairs@stpairs); |
|
1513 |
(*elim-resolution: try each assumption in turn. Initially n=1*) |
|
11518 | 1514 |
fun tryasms (_, _, _, []) = Seq.empty |
1515 |
| tryasms (A, As, n, (t,u)::apairs) = |
|
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1516 |
(case Seq.pull(Unify.unifiers(thy, env, (t,u)::dpairs)) of |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1517 |
NONE => tryasms (A, As, n+1, apairs) |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1518 |
| cell as SOME((_,tpairs),_) => |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1519 |
Seq.it_right (addth A (newAs(As, n, [BBi,(u,t)], tpairs))) |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1520 |
(Seq.make(fn()=> cell), |
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1521 |
Seq.make(fn()=> Seq.pull (tryasms(A, As, n+1, apairs))))) |
0 | 1522 |
fun eres [] = raise THM("bicompose: no premises", 0, [orule,state]) |
15531 | 1523 |
| eres (A1::As) = tryasms(SOME A1, As, 1, Logic.assum_pairs(nlift+1,A1)) |
0 | 1524 |
(*ordinary resolution*) |
15531 | 1525 |
fun res(NONE) = Seq.empty |
1526 |
| res(cell as SOME((_,tpairs),_)) = |
|
1527 |
Seq.it_right (addth NONE (newAs(rev rAs, 0, [BBi], tpairs))) |
|
4270 | 1528 |
(Seq.make (fn()=> cell), Seq.empty) |
0 | 1529 |
in if eres_flg then eres(rev rAs) |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1530 |
else res(Seq.pull(Unify.unifiers(thy, env, dpairs))) |
0 | 1531 |
end; |
7528 | 1532 |
end; |
0 | 1533 |
|
18501
915105af2e80
turned bicompose_no_flatten into compose_no_flatten, without elimination;
wenzelm
parents:
18486
diff
changeset
|
1534 |
fun compose_no_flatten match (orule, nsubgoal) i state = |
915105af2e80
turned bicompose_no_flatten into compose_no_flatten, without elimination;
wenzelm
parents:
18486
diff
changeset
|
1535 |
bicompose_aux false match (state, dest_state (state, i), false) (false, orule, nsubgoal); |
0 | 1536 |
|
18501
915105af2e80
turned bicompose_no_flatten into compose_no_flatten, without elimination;
wenzelm
parents:
18486
diff
changeset
|
1537 |
fun bicompose match arg i state = |
915105af2e80
turned bicompose_no_flatten into compose_no_flatten, without elimination;
wenzelm
parents:
18486
diff
changeset
|
1538 |
bicompose_aux true match (state, dest_state (state,i), false) arg; |
0 | 1539 |
|
1540 |
(*Quick test whether rule is resolvable with the subgoal with hyps Hs |
|
1541 |
and conclusion B. If eres_flg then checks 1st premise of rule also*) |
|
1542 |
fun could_bires (Hs, B, eres_flg, rule) = |
|
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
1543 |
let fun could_reshyp (A1::_) = exists (fn H => could_unify (A1, H)) Hs |
250 | 1544 |
| could_reshyp [] = false; (*no premise -- illegal*) |
1545 |
in could_unify(concl_of rule, B) andalso |
|
1546 |
(not eres_flg orelse could_reshyp (prems_of rule)) |
|
0 | 1547 |
end; |
1548 |
||
1549 |
(*Bi-resolution of a state with a list of (flag,rule) pairs. |
|
1550 |
Puts the rule above: rule/state. Renames vars in the rules. *) |
|
250 | 1551 |
fun biresolution match brules i state = |
18035 | 1552 |
let val (stpairs, Bs, Bi, C) = dest_state(state,i); |
18145 | 1553 |
val lift = lift_rule (cprem_of state i); |
250 | 1554 |
val B = Logic.strip_assums_concl Bi; |
1555 |
val Hs = Logic.strip_assums_hyp Bi; |
|
18486 | 1556 |
val comp = bicompose_aux true match (state, (stpairs, Bs, Bi, C), true); |
4270 | 1557 |
fun res [] = Seq.empty |
250 | 1558 |
| res ((eres_flg, rule)::brules) = |
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13629
diff
changeset
|
1559 |
if !Pattern.trace_unify_fail orelse |
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13629
diff
changeset
|
1560 |
could_bires (Hs, B, eres_flg, rule) |
4270 | 1561 |
then Seq.make (*delay processing remainder till needed*) |
15531 | 1562 |
(fn()=> SOME(comp (eres_flg, lift rule, nprems_of rule), |
250 | 1563 |
res brules)) |
1564 |
else res brules |
|
4270 | 1565 |
in Seq.flat (res brules) end; |
0 | 1566 |
|
1567 |
||
2509 | 1568 |
(*** Oracles ***) |
1569 |
||
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1570 |
fun invoke_oracle_i thy1 name = |
3812 | 1571 |
let |
1572 |
val oracle = |
|
17412 | 1573 |
(case Symtab.lookup (#2 (#oracles (Theory.rep_theory thy1))) name of |
15531 | 1574 |
NONE => raise THM ("Unknown oracle: " ^ name, 0, []) |
1575 |
| SOME (f, _) => f); |
|
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
1576 |
val thy_ref1 = Theory.self_ref thy1; |
3812 | 1577 |
in |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1578 |
fn (thy2, data) => |
3812 | 1579 |
let |
16847
8fc160b12e73
invoke_oracle: do not keep theory value, but theory_ref;
wenzelm
parents:
16725
diff
changeset
|
1580 |
val thy' = Theory.merge (Theory.deref thy_ref1, thy2); |
18969 | 1581 |
val (prop, T, maxidx) = Sign.certify_term thy' (oracle (thy', data)); |
3812 | 1582 |
in |
1583 |
if T <> propT then |
|
1584 |
raise THM ("Oracle's result must have type prop: " ^ name, 0, []) |
|
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1585 |
else |
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1586 |
Thm {thy_ref = Theory.self_ref thy', |
11518 | 1587 |
der = (true, Pt.oracle_proof name prop), |
3812 | 1588 |
maxidx = maxidx, |
16656 | 1589 |
shyps = may_insert_term_sorts thy' prop [], |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1590 |
hyps = [], |
13658
c9ad3e64ddcf
Changed handling of flex-flex constraints: now stored in separate
berghofe
parents:
13642
diff
changeset
|
1591 |
tpairs = [], |
16601
ee8eefade568
more efficient treatment of shyps and hyps (use ordered lists);
wenzelm
parents:
16425
diff
changeset
|
1592 |
prop = prop} |
3812 | 1593 |
end |
1594 |
end; |
|
1595 |
||
15672 | 1596 |
fun invoke_oracle thy = |
16425
2427be27cc60
accomodate identification of type Sign.sg and theory;
wenzelm
parents:
16352
diff
changeset
|
1597 |
invoke_oracle_i thy o NameSpace.intern (Theory.oracle_space thy); |
15672 | 1598 |
|
0 | 1599 |
end; |
1503 | 1600 |
|
6089 | 1601 |
structure BasicThm: BASIC_THM = Thm; |
1602 |
open BasicThm; |