author | kleing |
Mon, 21 Jun 2004 10:25:57 +0200 | |
changeset 14981 | e73f8140af78 |
parent 14854 | 61bdf2ae4dc5 |
child 15387 | 24aff9e3de3f |
permissions | -rw-r--r-- |
3987 | 1 |
(* Title: Pure/pure_thy.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
5091 | 5 |
Theorem database, derived theory operations, and the ProtoPure theory. |
3987 | 6 |
*) |
7 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
8 |
signature BASIC_PURE_THY = |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
9 |
sig |
5000 | 10 |
val print_theorems: theory -> unit |
11 |
val print_theory: theory -> unit |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
12 |
val get_thm: theory -> xstring -> thm |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
13 |
val get_thms: theory -> xstring -> thm list |
6094 | 14 |
val get_thmss: theory -> xstring list -> thm list |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
15 |
val thms_of: theory -> (string * thm) list |
5091 | 16 |
structure ProtoPure: |
17 |
sig |
|
18 |
val thy: theory |
|
19 |
val Goal_def: thm |
|
20 |
end |
|
4853 | 21 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
22 |
|
3987 | 23 |
signature PURE_THY = |
24 |
sig |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
25 |
include BASIC_PURE_THY |
9808 | 26 |
val get_thm_closure: theory -> xstring -> thm |
9564 | 27 |
val get_thms_closure: theory -> xstring -> thm list |
28 |
val single_thm: string -> thm list -> thm |
|
6367 | 29 |
val cond_extern_thm_sg: Sign.sg -> string -> xstring |
13274 | 30 |
val thms_containing: theory -> string list * string list -> (string * thm list) list |
13646 | 31 |
val thms_containing_consts: theory -> string list -> (string * thm) list |
32 |
val find_intros: theory -> term -> (string * thm) list |
|
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
33 |
val find_intros_goal : theory -> thm -> int -> (string * thm) list |
13646 | 34 |
val find_elims : theory -> term -> (string * thm) list |
12695 | 35 |
val hide_thms: bool -> string list -> theory -> theory |
6091 | 36 |
val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm |
7405 | 37 |
val smart_store_thms: (bstring * thm list) -> thm list |
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset
|
38 |
val smart_store_thms_open: (bstring * thm list) -> thm list |
7899 | 39 |
val forall_elim_var: int -> thm -> thm |
40 |
val forall_elim_vars: int -> thm -> thm |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
41 |
val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory * thm list |
12711 | 42 |
val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory |
43 |
-> theory * thm list list |
|
14564 | 44 |
val note_thmss: theory attribute -> ((bstring * theory attribute list) * |
12711 | 45 |
(xstring * theory attribute list) list) list -> theory -> theory * (bstring * thm list) list |
14564 | 46 |
val note_thmss_i: theory attribute -> ((bstring * theory attribute list) * |
12711 | 47 |
(thm list * theory attribute list) list) list -> theory -> theory * (bstring * thm list) list |
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
48 |
val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list |
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
49 |
val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list |
12711 | 50 |
val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory |
51 |
-> theory * thm list list |
|
52 |
val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory |
|
53 |
-> theory * thm list list |
|
9318 | 54 |
val add_defs: bool -> ((bstring * string) * theory attribute list) list |
55 |
-> theory -> theory * thm list |
|
56 |
val add_defs_i: bool -> ((bstring * term) * theory attribute list) list |
|
57 |
-> theory -> theory * thm list |
|
58 |
val add_defss: bool -> ((bstring * string list) * theory attribute list) list |
|
59 |
-> theory -> theory * thm list list |
|
60 |
val add_defss_i: bool -> ((bstring * term list) * theory attribute list) list |
|
61 |
-> theory -> theory * thm list list |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
62 |
val get_name: theory -> string |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
63 |
val put_name: string -> theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
64 |
val global_path: theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
65 |
val local_path: theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
66 |
val begin_theory: string -> theory list -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
67 |
val end_theory: theory -> theory |
6682 | 68 |
val checkpoint: theory -> theory |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
69 |
val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory |
3987 | 70 |
end; |
71 |
||
72 |
structure PureThy: PURE_THY = |
|
73 |
struct |
|
74 |
||
75 |
||
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
76 |
(*** theorem database ***) |
3987 | 77 |
|
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
78 |
(** data kind 'Pure/theorems' **) |
3987 | 79 |
|
5005 | 80 |
structure TheoremsDataArgs = |
81 |
struct |
|
82 |
val name = "Pure/theorems"; |
|
3987 | 83 |
|
5005 | 84 |
type T = |
85 |
{space: NameSpace.T, |
|
6091 | 86 |
thms_tab: thm list Symtab.table, |
13274 | 87 |
index: FactIndex.T} ref; |
3987 | 88 |
|
4853 | 89 |
fun mk_empty _ = |
13274 | 90 |
ref {space = NameSpace.empty, thms_tab = Symtab.empty, index = FactIndex.empty}: T; |
3987 | 91 |
|
5005 | 92 |
val empty = mk_empty (); |
6547 | 93 |
fun copy (ref x) = ref x; |
5005 | 94 |
val prep_ext = mk_empty; |
95 |
val merge = mk_empty; |
|
96 |
||
13274 | 97 |
fun pretty sg (ref {space, thms_tab, index = _}) = |
4853 | 98 |
let |
10008 | 99 |
val prt_thm = Display.pretty_thm_sg sg; |
4853 | 100 |
fun prt_thms (name, [th]) = |
101 |
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] |
|
102 |
| prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths); |
|
3987 | 103 |
|
6846 | 104 |
val thmss = NameSpace.cond_extern_table space thms_tab; |
9215 | 105 |
in Pretty.big_list "theorems:" (map prt_thms thmss) end; |
8720 | 106 |
|
9215 | 107 |
fun print sg data = Pretty.writeln (pretty sg data); |
3987 | 108 |
end; |
109 |
||
5005 | 110 |
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); |
111 |
val get_theorems_sg = TheoremsData.get_sg; |
|
112 |
val get_theorems = TheoremsData.get; |
|
113 |
||
6367 | 114 |
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; |
115 |
||
3987 | 116 |
|
5000 | 117 |
(* print theory *) |
3987 | 118 |
|
5005 | 119 |
val print_theorems = TheoremsData.print; |
8720 | 120 |
|
5000 | 121 |
fun print_theory thy = |
9215 | 122 |
Display.pretty_full_theory thy @ |
123 |
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] |
|
8720 | 124 |
|> Pretty.chunks |> Pretty.writeln; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
125 |
|
3987 | 126 |
|
127 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
128 |
(** retrieve theorems **) |
3987 | 129 |
|
9564 | 130 |
(* selections *) |
131 |
||
132 |
fun the_thms _ (Some thms) = thms |
|
133 |
| the_thms name None = error ("Unknown theorem(s) " ^ quote name); |
|
4037 | 134 |
|
9564 | 135 |
fun single_thm _ [thm] = thm |
136 |
| single_thm name _ = error ("Single theorem expected " ^ quote name); |
|
137 |
||
138 |
||
9808 | 139 |
(* get_thm(s)_closure -- statically scoped versions *) |
9564 | 140 |
|
141 |
(*beware of proper order of evaluation!*) |
|
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
142 |
|
9564 | 143 |
fun lookup_thms thy = |
144 |
let |
|
145 |
val sg_ref = Sign.self_ref (Theory.sign_of thy); |
|
146 |
val ref {space, thms_tab, ...} = get_theorems thy; |
|
147 |
in |
|
148 |
fn name => |
|
10667 | 149 |
apsome (map (Thm.transfer_sg (Sign.deref sg_ref))) (*semi-dynamic identity*) |
9564 | 150 |
(Symtab.lookup (thms_tab, NameSpace.intern space name)) (*static content*) |
151 |
end; |
|
3987 | 152 |
|
9564 | 153 |
fun get_thms_closure thy = |
154 |
let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) |
|
155 |
in fn name => the_thms name (get_first (fn f => f name) closures) end; |
|
156 |
||
9808 | 157 |
fun get_thm_closure thy = |
158 |
let val get = get_thms_closure thy |
|
159 |
in fn name => single_thm name (get name) end; |
|
160 |
||
9564 | 161 |
|
162 |
(* get_thm etc. *) |
|
163 |
||
164 |
fun get_thms theory name = |
|
165 |
get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory) |
|
166 |
|> the_thms name |> map (Thm.transfer theory); |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
167 |
|
6091 | 168 |
fun get_thmss thy names = flat (map (get_thms thy) names); |
9564 | 169 |
fun get_thm thy name = single_thm name (get_thms thy name); |
4783 | 170 |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
171 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
172 |
(* thms_of *) |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
173 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
174 |
fun thms_of thy = |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
175 |
let val ref {thms_tab, ...} = get_theorems thy in |
13274 | 176 |
map (fn th => (Thm.name_of_thm th, th)) (flat (map snd (Symtab.dest thms_tab))) |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
177 |
end; |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
178 |
|
3987 | 179 |
|
13274 | 180 |
(* thms_containing *) |
3987 | 181 |
|
13274 | 182 |
fun thms_containing thy idx = |
183 |
let |
|
184 |
fun valid (name, ths) = |
|
185 |
(case try (transform_error (get_thms thy)) name of |
|
186 |
None => false |
|
187 |
| Some ths' => Library.equal_lists Thm.eq_thm (ths, ths')); |
|
188 |
in |
|
189 |
(thy :: Theory.ancestors_of thy) |
|
190 |
|> map (gen_distinct eq_fst o filter valid o FactIndex.find idx o #index o ! o get_theorems) |
|
191 |
|> flat |
|
192 |
end; |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
193 |
|
13646 | 194 |
fun thms_containing_consts thy consts = |
195 |
thms_containing thy (consts, []) |> map #2 |> flat |
|
196 |
|> map (fn th => (Thm.name_of_thm th, th)) |
|
197 |
||
198 |
(* intro/elim theorems *) |
|
199 |
||
200 |
(* intro: given a goal state, find a suitable intro rule for some subgoal *) |
|
201 |
(* elim: given a theorem thm, |
|
202 |
find a theorem whose major premise eliminates the conclusion of thm *) |
|
203 |
||
204 |
(*top_const: main constant, ignoring Trueprop *) |
|
205 |
fun top_const (_ $ t) = (case head_of t of Const (c, _) => Some c | _ => None) |
|
206 |
| top_const _ = None; |
|
207 |
||
208 |
val intro_const = top_const o concl_of; |
|
209 |
fun elim_const thm = case prems_of thm of [] => None | p::_ => top_const p; |
|
210 |
||
211 |
fun index_intros thy c = thms_containing_consts thy [c] |
|
212 |
|> filter (fn (_, thm) => intro_const thm = Some c); |
|
213 |
fun index_elims thy c = thms_containing_consts thy [c] |
|
214 |
|> filter (fn (_, thm) => elim_const thm = Some c); |
|
215 |
||
216 |
(*returns all those named_thms whose subterm extracted by extract can be |
|
217 |
instantiated to obj; the list is sorted according to the number of premises |
|
218 |
and the size of the required substitution.*) |
|
219 |
fun select_match(obj, signobj, named_thms, extract) = |
|
220 |
let val tsig = Sign.tsig_of signobj |
|
221 |
fun matches prop = |
|
222 |
case extract prop of |
|
223 |
None => false |
|
224 |
| Some pat => Pattern.matches tsig (pat, obj); |
|
225 |
||
226 |
fun substsize prop = |
|
227 |
let val Some pat = extract prop |
|
228 |
val (_,subst) = Pattern.match tsig (pat,obj) |
|
229 |
in foldl op+ (0, map (size_of_term o snd) subst) end |
|
230 |
||
231 |
fun thm_ord ((p0,s0,_),(p1,s1,_)) = |
|
232 |
prod_ord (int_ord o pairself (fn 0 => 0 | x => 1)) int_ord ((p0,s0),(p1,s1)); |
|
233 |
||
234 |
fun select((p as (_,thm))::named_thms, sels) = |
|
235 |
let val {prop, sign, ...} = rep_thm thm |
|
236 |
in select(named_thms, |
|
237 |
if Sign.subsig(sign, signobj) andalso matches prop |
|
238 |
then (nprems_of thm,substsize prop,p)::sels |
|
239 |
else sels) |
|
240 |
end |
|
241 |
| select([],sels) = sels |
|
242 |
||
243 |
in map (fn (_,_,t) => t) (sort thm_ord (select(named_thms, []))) end; |
|
244 |
||
245 |
fun find_matching index extract thy prop = |
|
246 |
(case top_const prop of None => [] |
|
247 |
| Some c => select_match(prop,Theory.sign_of thy,index thy c,extract)) |
|
248 |
||
249 |
val find_intros = find_matching index_intros (Some o Logic.strip_imp_concl) |
|
250 |
||
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
251 |
fun find_intros_goal thy st i = |
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
252 |
find_intros thy (Logic.concl_of_goal (prop_of st) i); |
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
253 |
|
13646 | 254 |
val find_elims = find_matching index_elims |
255 |
(fn prop => case Logic.strip_imp_prems prop of [] => None | p::_ => Some p) |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
256 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
257 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
258 |
(** store theorems **) (*DESTRUCTIVE*) |
3987 | 259 |
|
12695 | 260 |
(* hiding -- affects current theory node only! *) |
261 |
||
13424 | 262 |
fun hide_thms fully names thy = |
12695 | 263 |
let |
13274 | 264 |
val r as ref {space, thms_tab, index} = get_theorems thy; |
13424 | 265 |
val space' = NameSpace.hide fully (space, names); |
13274 | 266 |
in r := {space = space', thms_tab = thms_tab, index = index}; thy end; |
12695 | 267 |
|
268 |
||
4853 | 269 |
(* naming *) |
270 |
||
11998 | 271 |
fun gen_names j len name = |
272 |
map (fn i => name ^ "_" ^ string_of_int i) (j+1 upto j+len); |
|
4853 | 273 |
|
11998 | 274 |
fun name_multi name xs = gen_names 0 (length xs) name ~~ xs; |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
275 |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
276 |
fun name_thm pre (p as (_, thm)) = |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
277 |
if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm p; |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
278 |
|
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
279 |
fun name_thms pre name [x] = [name_thm pre (name, x)] |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
280 |
| name_thms pre name xs = map (name_thm pre) (name_multi name xs); |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
281 |
|
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
282 |
fun name_thmss name xs = (case filter_out (null o fst) xs of |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
283 |
[([x], z)] => [([name_thm true (name, x)], z)] |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
284 |
| _ => snd (foldl_map (fn (i, (ys, z)) => (i + length ys, |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
285 |
(map (name_thm true) (gen_names i (length ys) name ~~ ys), z))) (0, xs))); |
4853 | 286 |
|
287 |
||
11998 | 288 |
(* enter_thms *) |
4853 | 289 |
|
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
290 |
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name); |
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
291 |
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name); |
3987 | 292 |
|
11998 | 293 |
fun enter_thms _ _ _ app_att thy ("", thms) = app_att (thy, thms) |
294 |
| enter_thms sg pre_name post_name app_att thy (bname, thms) = |
|
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
295 |
let |
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
296 |
val name = Sign.full_name sg bname; |
11998 | 297 |
val (thy', thms') = app_att (thy, pre_name name thms); |
298 |
val named_thms = post_name name thms'; |
|
3987 | 299 |
|
13274 | 300 |
val r as ref {space, thms_tab, index} = get_theorems_sg sg; |
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
301 |
val space' = NameSpace.extend (space, [name]); |
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
302 |
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); |
13274 | 303 |
val index' = FactIndex.add (K false) (index, (name, named_thms)); |
304 |
in |
|
305 |
(case Symtab.lookup (thms_tab, name) of |
|
306 |
None => () |
|
307 |
| Some thms' => |
|
308 |
if Library.equal_lists Thm.eq_thm (thms', named_thms) then warn_same name |
|
309 |
else warn_overwrite name); |
|
310 |
r := {space = space', thms_tab = thms_tab', index = index'}; |
|
11998 | 311 |
(thy', named_thms) |
312 |
end; |
|
3987 | 313 |
|
4853 | 314 |
|
6091 | 315 |
(* add_thms(s) *) |
4853 | 316 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
317 |
fun add_thms_atts pre_name ((bname, thms), atts) thy = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
318 |
enter_thms (Theory.sign_of thy) pre_name (name_thms false) |
11998 | 319 |
(Thm.applys_attributes o rpair atts) thy (bname, thms); |
4853 | 320 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
321 |
fun gen_add_thmss pre_name args theory = |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
322 |
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); |
5907 | 323 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
324 |
fun gen_add_thms pre_name args = |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
325 |
apsnd (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args); |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
326 |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
327 |
val add_thmss = gen_add_thmss (name_thms true); |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
328 |
val add_thms = gen_add_thms (name_thms true); |
5907 | 329 |
|
330 |
||
14564 | 331 |
(* note_thmss(_i) *) |
5907 | 332 |
|
9192 | 333 |
local |
12711 | 334 |
|
14564 | 335 |
fun gen_note_thss get kind_att (thy, ((bname, more_atts), ths_atts)) = |
12711 | 336 |
let |
337 |
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); |
|
338 |
val (thy', thms) = enter_thms (Theory.sign_of thy) |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
339 |
name_thmss (name_thms false) (apsnd flat o foldl_map app) thy |
12711 | 340 |
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); |
341 |
in (thy', (bname, thms)) end; |
|
342 |
||
14564 | 343 |
fun gen_note_thmss get kind_att args thy = |
344 |
foldl_map (gen_note_thss get kind_att) (thy, args); |
|
12711 | 345 |
|
9192 | 346 |
in |
12711 | 347 |
|
14564 | 348 |
val note_thmss = gen_note_thmss get_thms; |
349 |
val note_thmss_i = gen_note_thmss (K I); |
|
12711 | 350 |
|
9192 | 351 |
end; |
5280 | 352 |
|
353 |
||
6091 | 354 |
(* store_thm *) |
5280 | 355 |
|
11998 | 356 |
fun store_thm ((bname, thm), atts) thy = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
357 |
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy |
5280 | 358 |
in (thy', th') end; |
3987 | 359 |
|
360 |
||
7405 | 361 |
(* smart_store_thms *) |
3987 | 362 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
363 |
fun gen_smart_store_thms _ (name, []) = |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
364 |
error ("Cannot store empty list of theorems: " ^ quote name) |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
365 |
| gen_smart_store_thms name_thm (name, [thm]) = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
366 |
snd (enter_thms (Thm.sign_of_thm thm) (name_thm true) (name_thm false) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
367 |
I () (name, [thm])) |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
368 |
| gen_smart_store_thms name_thm (name, thms) = |
7405 | 369 |
let |
370 |
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); |
|
371 |
val sg_ref = foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms); |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
372 |
in snd (enter_thms (Sign.deref sg_ref) (name_thm true) (name_thm false) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
373 |
I () (name, thms)) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
374 |
end; |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
375 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
376 |
val smart_store_thms = gen_smart_store_thms name_thms; |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
377 |
val smart_store_thms_open = gen_smart_store_thms (K (K I)); |
3987 | 378 |
|
379 |
||
7899 | 380 |
(* forall_elim_vars (belongs to drule.ML) *) |
381 |
||
13713 | 382 |
(*Replace outermost quantified variable by Var of given index.*) |
7899 | 383 |
fun forall_elim_var i th = |
384 |
let val {prop,sign,...} = rep_thm th |
|
385 |
in case prop of |
|
13713 | 386 |
Const ("all", _) $ Abs (a, T, _) => |
387 |
let val used = map (fst o fst) |
|
388 |
(filter (equal i o snd o fst) (Term.add_vars ([], prop))) |
|
389 |
in forall_elim (cterm_of sign (Var ((variant used a, i), T))) th end |
|
390 |
| _ => raise THM ("forall_elim_var", i, [th]) |
|
7899 | 391 |
end; |
392 |
||
393 |
(*Repeat forall_elim_var until all outer quantifiers are removed*) |
|
394 |
fun forall_elim_vars i th = |
|
395 |
forall_elim_vars i (forall_elim_var i th) |
|
396 |
handle THM _ => th; |
|
397 |
||
398 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
399 |
(* store axioms as theorems *) |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
400 |
|
4853 | 401 |
local |
7899 | 402 |
fun get_axs thy named_axs = |
403 |
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; |
|
7753 | 404 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
405 |
fun add_single add (thy, ((name, ax), atts)) = |
4853 | 406 |
let |
11998 | 407 |
val named_ax = [(name, ax)]; |
7753 | 408 |
val thy' = add named_ax thy; |
409 |
val thm = hd (get_axs thy' named_ax); |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
410 |
in apsnd hd (gen_add_thms (K I) [((name, thm), atts)] thy') end; |
7753 | 411 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
412 |
fun add_multi add (thy, ((name, axs), atts)) = |
7753 | 413 |
let |
414 |
val named_axs = name_multi name axs; |
|
4853 | 415 |
val thy' = add named_axs thy; |
7753 | 416 |
val thms = get_axs thy' named_axs; |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
417 |
in apsnd hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
418 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
419 |
fun add_singles add args thy = foldl_map (add_single add) (thy, args); |
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
420 |
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); |
4853 | 421 |
in |
7753 | 422 |
val add_axioms = add_singles Theory.add_axioms; |
423 |
val add_axioms_i = add_singles Theory.add_axioms_i; |
|
424 |
val add_axiomss = add_multis Theory.add_axioms; |
|
425 |
val add_axiomss_i = add_multis Theory.add_axioms_i; |
|
9318 | 426 |
val add_defs = add_singles o Theory.add_defs; |
427 |
val add_defs_i = add_singles o Theory.add_defs_i; |
|
428 |
val add_defss = add_multis o Theory.add_defs; |
|
429 |
val add_defss_i = add_multis o Theory.add_defs_i; |
|
4853 | 430 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
431 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
432 |
|
3987 | 433 |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
434 |
(*** derived theory operations ***) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
435 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
436 |
(** theory management **) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
437 |
|
5005 | 438 |
(* data kind 'Pure/theory_management' *) |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
439 |
|
5005 | 440 |
structure TheoryManagementDataArgs = |
441 |
struct |
|
442 |
val name = "Pure/theory_management"; |
|
6660 | 443 |
type T = {name: string, version: int}; |
5000 | 444 |
|
6660 | 445 |
val empty = {name = "", version = 0}; |
6547 | 446 |
val copy = I; |
5005 | 447 |
val prep_ext = I; |
5000 | 448 |
fun merge _ = empty; |
5005 | 449 |
fun print _ _ = (); |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
450 |
end; |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
451 |
|
5005 | 452 |
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); |
453 |
val get_info = TheoryManagementData.get; |
|
454 |
val put_info = TheoryManagementData.put; |
|
455 |
||
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
456 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
457 |
(* get / put name *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
458 |
|
5000 | 459 |
val get_name = #name o get_info; |
6660 | 460 |
fun put_name name = put_info {name = name, version = 0}; |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
461 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
462 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
463 |
(* control prefixing of theory name *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
464 |
|
5210 | 465 |
val global_path = Theory.root_path; |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
466 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
467 |
fun local_path thy = |
5210 | 468 |
thy |> Theory.root_path |> Theory.add_path (get_name thy); |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
469 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
470 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
471 |
(* begin / end theory *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
472 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
473 |
fun begin_theory name thys = |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
474 |
Theory.prep_ext_merge thys |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
475 |
|> put_name name |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
476 |
|> local_path; |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
477 |
|
12123 | 478 |
fun end_theory thy = |
479 |
thy |
|
480 |
|> Theory.add_name (get_name thy); |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
481 |
|
6682 | 482 |
fun checkpoint thy = |
483 |
if is_draft thy then |
|
484 |
let val {name, version} = get_info thy in |
|
485 |
thy |
|
486 |
|> Theory.add_name (name ^ ":" ^ string_of_int version) |
|
487 |
|> put_info {name = name, version = version + 1} |
|
488 |
end |
|
489 |
else thy; |
|
5000 | 490 |
|
491 |
||
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
492 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
493 |
(** add logical types **) |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
494 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
495 |
fun add_typedecls decls thy = |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
496 |
let |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
497 |
val full = Sign.full_name (Theory.sign_of thy); |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
498 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
499 |
fun type_of (raw_name, vs, mx) = |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
500 |
if null (duplicates vs) then (raw_name, length vs, mx) |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
501 |
else error ("Duplicate parameters in type declaration: " ^ quote raw_name); |
14854 | 502 |
in thy |> Theory.add_types (map type_of decls) end; |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
503 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
504 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
505 |
|
5091 | 506 |
(*** the ProtoPure theory ***) |
3987 | 507 |
|
14669 | 508 |
|
509 |
(*It might make sense to restrict the polymorphism of the constant "==" to |
|
510 |
sort logic, instead of the universal sort, {}. Unfortunately, this change |
|
511 |
causes HOL/Import/shuffler.ML to fail.*) |
|
512 |
||
3987 | 513 |
val proto_pure = |
514 |
Theory.pre_pure |
|
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
515 |
|> Library.apply [TheoremsData.init, TheoryManagementData.init, Proofterm.init] |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
516 |
|> put_name "ProtoPure" |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
517 |
|> global_path |
3987 | 518 |
|> Theory.add_types |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
519 |
[("fun", 2, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
520 |
("prop", 0, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
521 |
("itself", 1, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
522 |
("dummy", 0, NoSyn)] |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
523 |
|> Theory.add_nonterminals Syntax.pure_nonterms |
3987 | 524 |
|> Theory.add_syntax Syntax.pure_syntax |
6692 | 525 |
|> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax |
3987 | 526 |
|> Theory.add_syntax |
7949 | 527 |
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), |
9534 | 528 |
(Term.dummy_patternN, "aprop", Delimfix "'_")] |
3987 | 529 |
|> Theory.add_consts |
14854 | 530 |
[("==", "['a, 'a] => prop", InfixrName ("==", 2)), |
3987 | 531 |
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), |
532 |
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), |
|
10667 | 533 |
("Goal", "prop => prop", NoSyn), |
6547 | 534 |
("TYPE", "'a itself", NoSyn), |
9534 | 535 |
(Term.dummy_patternN, "'a", Delimfix "'_")] |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
13800
diff
changeset
|
536 |
|> Theory.add_finals_i false |
14854 | 537 |
[Const("==", [TFree ("'a", []), TFree ("'a", [])] ---> propT), |
538 |
Const("==>", [propT, propT] ---> propT), |
|
539 |
Const("all", (TFree("'a", []) --> propT) --> propT), |
|
540 |
Const("TYPE", a_itselfT)] |
|
5041
a1d0a6d555cd
Goals may now contain assumptions, which are not returned.
nipkow
parents:
5026
diff
changeset
|
541 |
|> Theory.add_modesyntax ("", false) |
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset
|
542 |
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) |
12250 | 543 |
|> Theory.add_trfuns Syntax.pure_trfuns |
544 |
|> Theory.add_trfunsT Syntax.pure_trfunsT |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
545 |
|> local_path |
10667 | 546 |
|> (#1 oo (add_defs_i false o map Thm.no_attributes)) |
547 |
[("Goal_def", let val A = Free ("A", propT) in Logic.mk_equals (Logic.mk_goal A, A) end)] |
|
9238 | 548 |
|> (#1 o add_thmss [(("nothing", []), [])]) |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
549 |
|> Theory.add_axioms_i Proofterm.equality_axms |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
550 |
|> end_theory; |
3987 | 551 |
|
5091 | 552 |
structure ProtoPure = |
553 |
struct |
|
554 |
val thy = proto_pure; |
|
555 |
val Goal_def = get_axiom thy "Goal_def"; |
|
556 |
end; |
|
3987 | 557 |
|
558 |
||
559 |
end; |
|
560 |
||
561 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
562 |
structure BasicPureThy: BASIC_PURE_THY = PureThy; |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
563 |
open BasicPureThy; |