author  wenzelm 
Tue, 27 Aug 2002 16:41:01 +0200  
changeset 13539  7d62554fa0e0 
parent 13424  584a4a4c30ed 
child 13646  46ed3d042ba5 
permissions  rwrr 
3987  1 
(* Title: Pure/pure_thy.ML 
2 
ID: $Id$ 

3 
Author: Markus Wenzel, TU Muenchen 

9318  4 
License: GPL (GNU GENERAL PUBLIC LICENSE) 
3987  5 

5091  6 
Theorem database, derived theory operations, and the ProtoPure theory. 
3987  7 
*) 
8 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

9 
signature BASIC_PURE_THY = 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

10 
sig 
5000  11 
val print_theorems: theory > unit 
12 
val print_theory: theory > unit 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

13 
val get_thm: theory > xstring > thm 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

14 
val get_thms: theory > xstring > thm list 
6094  15 
val get_thmss: theory > xstring list > thm list 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

16 
val thms_of: theory > (string * thm) list 
5091  17 
structure ProtoPure: 
18 
sig 

19 
val thy: theory 

20 
val flexpair_def: thm 

21 
val Goal_def: thm 

22 
end 

4853  23 
end; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

24 

3987  25 
signature PURE_THY = 
26 
sig 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

27 
include BASIC_PURE_THY 
9808  28 
val get_thm_closure: theory > xstring > thm 
9564  29 
val get_thms_closure: theory > xstring > thm list 
30 
val single_thm: string > thm list > thm 

6367  31 
val cond_extern_thm_sg: Sign.sg > string > xstring 
13274  32 
val thms_containing: theory > string list * string list > (string * thm list) list 
12695  33 
val hide_thms: bool > string list > theory > theory 
6091  34 
val store_thm: (bstring * thm) * theory attribute list > theory > theory * thm 
7405  35 
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

36 
val smart_store_thms_open: (bstring * thm list) > thm list 
7899  37 
val forall_elim_var: int > thm > thm 
38 
val forall_elim_vars: int > thm > thm 

8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

39 
val add_thms: ((bstring * thm) * theory attribute list) list > theory > theory * thm list 
12711  40 
val add_thmss: ((bstring * thm list) * theory attribute list) list > theory 
41 
> theory * thm list list 

42 
val have_thmss: theory attribute > ((bstring * theory attribute list) * 

43 
(xstring * theory attribute list) list) list > theory > theory * (bstring * thm list) list 

44 
val have_thmss_i: theory attribute > ((bstring * theory attribute list) * 

45 
(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

46 
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

47 
val add_axioms_i: ((bstring * term) * theory attribute list) list > theory > theory * thm list 
12711  48 
val add_axiomss: ((bstring * string list) * theory attribute list) list > theory 
49 
> theory * thm list list 

50 
val add_axiomss_i: ((bstring * term list) * theory attribute list) list > theory 

51 
> theory * thm list list 

9318  52 
val add_defs: bool > ((bstring * string) * theory attribute list) list 
53 
> theory > theory * thm list 

54 
val add_defs_i: bool > ((bstring * term) * theory attribute list) list 

55 
> theory > theory * thm list 

56 
val add_defss: bool > ((bstring * string list) * theory attribute list) list 

57 
> theory > theory * thm list list 

58 
val add_defss_i: bool > ((bstring * term list) * theory attribute list) list 

59 
> theory > theory * thm list list 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

60 
val get_name: theory > string 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

61 
val put_name: string > theory > theory 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

62 
val global_path: theory > theory 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

63 
val local_path: theory > theory 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

64 
val begin_theory: string > theory list > theory 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

65 
val end_theory: theory > theory 
6682  66 
val checkpoint: theory > theory 
4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

67 
val add_typedecls: (bstring * string list * mixfix) list > theory > theory 
3987  68 
end; 
69 

70 
structure PureThy: PURE_THY = 

71 
struct 

72 

73 

4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

74 
(*** theorem database ***) 
3987  75 

4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

76 
(** data kind 'Pure/theorems' **) 
3987  77 

5005  78 
structure TheoremsDataArgs = 
79 
struct 

80 
val name = "Pure/theorems"; 

3987  81 

5005  82 
type T = 
83 
{space: NameSpace.T, 

6091  84 
thms_tab: thm list Symtab.table, 
13274  85 
index: FactIndex.T} ref; 
3987  86 

4853  87 
fun mk_empty _ = 
13274  88 
ref {space = NameSpace.empty, thms_tab = Symtab.empty, index = FactIndex.empty}: T; 
3987  89 

5005  90 
val empty = mk_empty (); 
6547  91 
fun copy (ref x) = ref x; 
5005  92 
val prep_ext = mk_empty; 
93 
val merge = mk_empty; 

94 

13274  95 
fun pretty sg (ref {space, thms_tab, index = _}) = 
4853  96 
let 
10008  97 
val prt_thm = Display.pretty_thm_sg sg; 
4853  98 
fun prt_thms (name, [th]) = 
99 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] 

100 
 prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths); 

3987  101 

6846  102 
val thmss = NameSpace.cond_extern_table space thms_tab; 
9215  103 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
8720  104 

9215  105 
fun print sg data = Pretty.writeln (pretty sg data); 
3987  106 
end; 
107 

5005  108 
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); 
109 
val get_theorems_sg = TheoremsData.get_sg; 

110 
val get_theorems = TheoremsData.get; 

111 

6367  112 
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; 
113 

3987  114 

5000  115 
(* print theory *) 
3987  116 

5005  117 
val print_theorems = TheoremsData.print; 
8720  118 

5000  119 
fun print_theory thy = 
9215  120 
Display.pretty_full_theory thy @ 
121 
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] 

8720  122 
> Pretty.chunks > Pretty.writeln; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

123 

3987  124 

125 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

126 
(** retrieve theorems **) 
3987  127 

9564  128 
(* selections *) 
129 

130 
fun the_thms _ (Some thms) = thms 

131 
 the_thms name None = error ("Unknown theorem(s) " ^ quote name); 

4037  132 

9564  133 
fun single_thm _ [thm] = thm 
134 
 single_thm name _ = error ("Single theorem expected " ^ quote name); 

135 

136 

9808  137 
(* get_thm(s)_closure  statically scoped versions *) 
9564  138 

139 
(*beware of proper order of evaluation!*) 

4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

140 

9564  141 
fun lookup_thms thy = 
142 
let 

143 
val sg_ref = Sign.self_ref (Theory.sign_of thy); 

144 
val ref {space, thms_tab, ...} = get_theorems thy; 

145 
in 

146 
fn name => 

10667  147 
apsome (map (Thm.transfer_sg (Sign.deref sg_ref))) (*semidynamic identity*) 
9564  148 
(Symtab.lookup (thms_tab, NameSpace.intern space name)) (*static content*) 
149 
end; 

3987  150 

9564  151 
fun get_thms_closure thy = 
152 
let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) 

153 
in fn name => the_thms name (get_first (fn f => f name) closures) end; 

154 

9808  155 
fun get_thm_closure thy = 
156 
let val get = get_thms_closure thy 

157 
in fn name => single_thm name (get name) end; 

158 

9564  159 

160 
(* get_thm etc. *) 

161 

162 
fun get_thms theory name = 

163 
get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory) 

164 
> the_thms name > map (Thm.transfer theory); 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

165 

6091  166 
fun get_thmss thy names = flat (map (get_thms thy) names); 
9564  167 
fun get_thm thy name = single_thm name (get_thms thy name); 
4783  168 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

169 

0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

170 
(* thms_of *) 
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 
fun thms_of thy = 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

173 
let val ref {thms_tab, ...} = get_theorems thy in 
13274  174 
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

175 
end; 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

176 

3987  177 

13274  178 
(* thms_containing *) 
3987  179 

13274  180 
fun thms_containing thy idx = 
181 
let 

182 
fun valid (name, ths) = 

183 
(case try (transform_error (get_thms thy)) name of 

184 
None => false 

185 
 Some ths' => Library.equal_lists Thm.eq_thm (ths, ths')); 

186 
in 

187 
(thy :: Theory.ancestors_of thy) 

188 
> map (gen_distinct eq_fst o filter valid o FactIndex.find idx o #index o ! o get_theorems) 

189 
> flat 

190 
end; 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

191 

0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

192 

0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

193 

0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

194 
(** store theorems **) (*DESTRUCTIVE*) 
3987  195 

12695  196 
(* hiding  affects current theory node only! *) 
197 

13424  198 
fun hide_thms fully names thy = 
12695  199 
let 
13274  200 
val r as ref {space, thms_tab, index} = get_theorems thy; 
13424  201 
val space' = NameSpace.hide fully (space, names); 
13274  202 
in r := {space = space', thms_tab = thms_tab, index = index}; thy end; 
12695  203 

204 

4853  205 
(* naming *) 
206 

11998  207 
fun gen_names j len name = 
208 
map (fn i => name ^ "_" ^ string_of_int i) (j+1 upto j+len); 

4853  209 

11998  210 
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

211 

12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

212 
fun name_thm pre (p as (_, thm)) = 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

213 
if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm p; 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

214 

0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

215 
fun name_thms pre name [x] = [name_thm pre (name, x)] 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

216 
 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

217 

5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

218 
fun name_thmss name xs = (case filter_out (null o fst) xs of 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

219 
[([x], z)] => [([name_thm true (name, x)], z)] 
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

220 
 _ => snd (foldl_map (fn (i, (ys, z)) => (i + length ys, 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

221 
(map (name_thm true) (gen_names i (length ys) name ~~ ys), z))) (0, xs))); 
4853  222 

223 

11998  224 
(* enter_thms *) 
4853  225 

7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

226 
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

227 
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name); 
3987  228 

11998  229 
fun enter_thms _ _ _ app_att thy ("", thms) = app_att (thy, thms) 
230 
 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

231 
let 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

232 
val name = Sign.full_name sg bname; 
11998  233 
val (thy', thms') = app_att (thy, pre_name name thms); 
234 
val named_thms = post_name name thms'; 

3987  235 

13274  236 
val r as ref {space, thms_tab, index} = get_theorems_sg sg; 
13539
7d62554fa0e0
disallow duplicate fact bindings for drafts (i.e. within newstyle theory files);
wenzelm
parents:
13424
diff
changeset

237 
val _ = conditional (Sign.is_draft sg andalso is_some (Symtab.lookup (thms_tab, name))) 
7d62554fa0e0
disallow duplicate fact bindings for drafts (i.e. within newstyle theory files);
wenzelm
parents:
13424
diff
changeset

238 
(fn () => error ("Duplicate fact binding " ^ quote name)); 
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

239 
val space' = NameSpace.extend (space, [name]); 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

240 
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); 
13274  241 
val index' = FactIndex.add (K false) (index, (name, named_thms)); 
242 
in 

243 
(case Symtab.lookup (thms_tab, name) of 

244 
None => () 

245 
 Some thms' => 

246 
if Library.equal_lists Thm.eq_thm (thms', named_thms) then warn_same name 

247 
else warn_overwrite name); 

248 
r := {space = space', thms_tab = thms_tab', index = index'}; 

11998  249 
(thy', named_thms) 
250 
end; 

3987  251 

4853  252 

6091  253 
(* add_thms(s) *) 
4853  254 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

255 
fun add_thms_atts pre_name ((bname, thms), atts) thy = 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

256 
enter_thms (Theory.sign_of thy) pre_name (name_thms false) 
11998  257 
(Thm.applys_attributes o rpair atts) thy (bname, thms); 
4853  258 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

259 
fun gen_add_thmss pre_name args theory = 
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

260 
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); 
5907  261 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

262 
fun gen_add_thms pre_name args = 
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

263 
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

264 

12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

265 
val add_thmss = gen_add_thmss (name_thms true); 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

266 
val add_thms = gen_add_thms (name_thms true); 
5907  267 

268 

12711  269 
(* have_thmss(_i) *) 
5907  270 

9192  271 
local 
12711  272 

273 
fun gen_have_thss get kind_att (thy, ((bname, more_atts), ths_atts)) = 

274 
let 

275 
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); 

276 
val (thy', thms) = enter_thms (Theory.sign_of thy) 

12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

277 
name_thmss (name_thms false) (apsnd flat o foldl_map app) thy 
12711  278 
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); 
279 
in (thy', (bname, thms)) end; 

280 

281 
fun gen_have_thmss get kind_att args thy = 

282 
foldl_map (gen_have_thss get kind_att) (thy, args); 

283 

9192  284 
in 
12711  285 

286 
val have_thmss = gen_have_thmss get_thms; 

287 
val have_thmss_i = gen_have_thmss (K I); 

288 

9192  289 
end; 
5280  290 

291 

6091  292 
(* store_thm *) 
5280  293 

11998  294 
fun store_thm ((bname, thm), atts) thy = 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

295 
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
5280  296 
in (thy', th') end; 
3987  297 

298 

7405  299 
(* smart_store_thms *) 
3987  300 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

301 
fun gen_smart_store_thms _ (name, []) = 
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

302 
error ("Cannot store empty list of theorems: " ^ quote name) 
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

303 
 gen_smart_store_thms name_thm (name, [thm]) = 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

304 
snd (enter_thms (Thm.sign_of_thm thm) (name_thm true) (name_thm false) 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

305 
I () (name, [thm])) 
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

306 
 gen_smart_store_thms name_thm (name, thms) = 
7405  307 
let 
308 
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); 

309 
val sg_ref = foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms); 

12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

310 
in snd (enter_thms (Sign.deref sg_ref) (name_thm true) (name_thm false) 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

311 
I () (name, thms)) 
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

312 
end; 
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

313 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

314 
val smart_store_thms = gen_smart_store_thms name_thms; 
12872
0855c3ab2047
Theorems are only "prenamed" if the do not already have names.
berghofe
parents:
12711
diff
changeset

315 
val smart_store_thms_open = gen_smart_store_thms (K (K I)); 
3987  316 

317 

7899  318 
(* forall_elim_vars (belongs to drule.ML) *) 
319 

320 
(*Replace outermost quantified variable by Var of given index. 

321 
Could clash with Vars already present.*) 

322 
fun forall_elim_var i th = 

323 
let val {prop,sign,...} = rep_thm th 

324 
in case prop of 

325 
Const("all",_) $ Abs(a,T,_) => 

326 
forall_elim (cterm_of sign (Var((a,i), T))) th 

327 
 _ => raise THM("forall_elim_var", i, [th]) 

328 
end; 

329 

330 
(*Repeat forall_elim_var until all outer quantifiers are removed*) 

331 
fun forall_elim_vars i th = 

332 
forall_elim_vars i (forall_elim_var i th) 

333 
handle THM _ => th; 

334 

335 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

336 
(* store axioms as theorems *) 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

337 

4853  338 
local 
7899  339 
fun get_axs thy named_axs = 
340 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  341 

8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

342 
fun add_single add (thy, ((name, ax), atts)) = 
4853  343 
let 
11998  344 
val named_ax = [(name, ax)]; 
7753  345 
val thy' = add named_ax thy; 
346 
val thm = hd (get_axs thy' named_ax); 

12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

347 
in apsnd hd (gen_add_thms (K I) [((name, thm), atts)] thy') end; 
7753  348 

8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

349 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  350 
let 
351 
val named_axs = name_multi name axs; 

4853  352 
val thy' = add named_axs thy; 
7753  353 
val thms = get_axs thy' named_axs; 
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

354 
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

355 

8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

356 
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

357 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  358 
in 
7753  359 
val add_axioms = add_singles Theory.add_axioms; 
360 
val add_axioms_i = add_singles Theory.add_axioms_i; 

361 
val add_axiomss = add_multis Theory.add_axioms; 

362 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  363 
val add_defs = add_singles o Theory.add_defs; 
364 
val add_defs_i = add_singles o Theory.add_defs_i; 

365 
val add_defss = add_multis o Theory.add_defs; 

366 
val add_defss_i = add_multis o Theory.add_defs_i; 

4853  367 
end; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

368 

0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

369 

3987  370 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

371 
(*** derived theory operations ***) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

372 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

373 
(** theory management **) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

374 

5005  375 
(* data kind 'Pure/theory_management' *) 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

376 

5005  377 
structure TheoryManagementDataArgs = 
378 
struct 

379 
val name = "Pure/theory_management"; 

6660  380 
type T = {name: string, version: int}; 
5000  381 

6660  382 
val empty = {name = "", version = 0}; 
6547  383 
val copy = I; 
5005  384 
val prep_ext = I; 
5000  385 
fun merge _ = empty; 
5005  386 
fun print _ _ = (); 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

387 
end; 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

388 

5005  389 
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); 
390 
val get_info = TheoryManagementData.get; 

391 
val put_info = TheoryManagementData.put; 

392 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

393 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

394 
(* get / put name *) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

395 

5000  396 
val get_name = #name o get_info; 
6660  397 
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

398 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

399 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

400 
(* control prefixing of theory name *) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

401 

5210  402 
val global_path = Theory.root_path; 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

403 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

404 
fun local_path thy = 
5210  405 
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

406 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

407 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

408 
(* begin / end theory *) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

409 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

410 
fun begin_theory name thys = 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

411 
Theory.prep_ext_merge thys 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

412 
> put_name name 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

413 
> local_path; 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

414 

12123  415 
fun end_theory thy = 
416 
thy 

417 
> Theory.add_name (get_name thy); 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

418 

6682  419 
fun checkpoint thy = 
420 
if is_draft thy then 

421 
let val {name, version} = get_info thy in 

422 
thy 

423 
> Theory.add_name (name ^ ":" ^ string_of_int version) 

424 
> put_info {name = name, version = version + 1} 

425 
end 

426 
else thy; 

5000  427 

428 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

429 

38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

430 
(** add logical types **) 
4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

431 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

432 
fun add_typedecls decls thy = 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

433 
let 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

434 
val full = Sign.full_name (Theory.sign_of thy); 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

435 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

436 
fun type_of (raw_name, vs, mx) = 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

437 
if null (duplicates vs) then (raw_name, length vs, mx) 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

438 
else error ("Duplicate parameters in type declaration: " ^ quote raw_name); 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

439 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

440 
fun arity_of (raw_name, len, mx) = 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

441 
(full (Syntax.type_name raw_name mx), replicate len logicS, logicS); 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

442 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

443 
val types = map type_of decls; 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

444 
val arities = map arity_of types; 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

445 
in 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

446 
thy 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

447 
> Theory.add_types types 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

448 
> Theory.add_arities_i arities 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

449 
end; 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

450 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

451 

03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

452 

5091  453 
(*** the ProtoPure theory ***) 
3987  454 

455 
val proto_pure = 

456 
Theory.pre_pure 

11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

457 
> 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

458 
> put_name "ProtoPure" 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

459 
> global_path 
3987  460 
> Theory.add_types 
4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

461 
[("fun", 2, NoSyn), 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

462 
("prop", 0, NoSyn), 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

463 
("itself", 1, NoSyn), 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

464 
("dummy", 0, NoSyn)] 
3987  465 
> Theory.add_classes_i [(logicC, [])] 
466 
> Theory.add_defsort_i logicS 

467 
> Theory.add_arities_i 

468 
[("fun", [logicS, logicS], logicS), 

469 
("prop", [], logicS), 

470 
("itself", [logicS], logicS)] 

4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

471 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  472 
> Theory.add_syntax Syntax.pure_syntax 
6692  473 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  474 
> Theory.add_syntax 
7949  475 
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), 
9534  476 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  477 
> Theory.add_consts 
478 
[("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)), 

479 
("=?=", "['a::{}, 'a] => prop", InfixrName ("=?=", 2)), 

480 
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 

481 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 

10667  482 
("Goal", "prop => prop", NoSyn), 
6547  483 
("TYPE", "'a itself", NoSyn), 
9534  484 
(Term.dummy_patternN, "'a", Delimfix "'_")] 
5041
a1d0a6d555cd
Goals may now contain assumptions, which are not returned.
nipkow
parents:
5026
diff
changeset

485 
> Theory.add_modesyntax ("", false) 
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset

486 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  487 
> Theory.add_trfuns Syntax.pure_trfuns 
488 
> Theory.add_trfunsT Syntax.pure_trfunsT 

4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

489 
> local_path 
9318  490 
> (#1 oo (add_defs false o map Thm.no_attributes)) 
10667  491 
[("flexpair_def", "(t =?= u) == (t == u::'a::{})")] 
492 
> (#1 oo (add_defs_i false o map Thm.no_attributes)) 

493 
[("Goal_def", let val A = Free ("A", propT) in Logic.mk_equals (Logic.mk_goal A, A) end)] 

9238  494 
> (#1 o add_thmss [(("nothing", []), [])]) 
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

495 
> 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

496 
> end_theory; 
3987  497 

5091  498 
structure ProtoPure = 
499 
struct 

500 
val thy = proto_pure; 

501 
val flexpair_def = get_axiom thy "flexpair_def"; 

502 
val Goal_def = get_axiom thy "Goal_def"; 

503 
end; 

3987  504 

505 

506 
end; 

507 

508 

4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

509 
structure BasicPureThy: BASIC_PURE_THY = PureThy; 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

510 
open BasicPureThy; 