author  wenzelm 
Sun, 11 Nov 2001 21:31:35 +0100  
changeset 12138  7cad58fbc866 
parent 12123  739eba13e2cd 
child 12235  5fa04fc9b254 
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 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

32 
val thms_containing: theory > string list > (string * thm) list 
6091  33 
val store_thm: (bstring * thm) * theory attribute list > theory > theory * thm 
7405  34 
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

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

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

38 
val add_thms: ((bstring * thm) * theory attribute list) list > theory > theory * thm list 
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

39 
val add_thmss: ((bstring * thm list) * theory attribute list) list > theory > theory * thm list list 
9192  40 
val have_thmss: theory attribute list > ((bstring * theory attribute list) * 
41 
(thm list * theory attribute list) list) list > theory > theory * (string * thm list) list 

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

42 
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

43 
val add_axioms_i: ((bstring * term) * theory attribute list) list > theory > theory * thm list 
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

44 
val add_axiomss: ((bstring * string list) * theory attribute list) list > theory > theory * thm list list 
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

45 
val add_axiomss_i: ((bstring * term list) * theory attribute list) list > theory > theory * thm list list 
9318  46 
val add_defs: bool > ((bstring * string) * theory attribute list) list 
47 
> theory > theory * thm list 

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

49 
> theory > theory * thm list 

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

51 
> theory > theory * thm list list 

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

53 
> theory > theory * thm list list 

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

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

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

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

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

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

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

61 
val add_typedecls: (bstring * string list * mixfix) list > theory > theory 
3987  62 
end; 
63 

64 
structure PureThy: PURE_THY = 

65 
struct 

66 

67 

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

68 
(*** theorem database ***) 
3987  69 

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

70 
(** data kind 'Pure/theorems' **) 
3987  71 

5005  72 
structure TheoremsDataArgs = 
73 
struct 

74 
val name = "Pure/theorems"; 

3987  75 

5005  76 
type T = 
77 
{space: NameSpace.T, 

6091  78 
thms_tab: thm list Symtab.table, 
79 
const_idx: int * (int * thm) list Symtab.table} ref; 

3987  80 

4853  81 
fun mk_empty _ = 
5005  82 
ref {space = NameSpace.empty, thms_tab = Symtab.empty, const_idx = (0, Symtab.empty)} : T; 
3987  83 

5005  84 
val empty = mk_empty (); 
6547  85 
fun copy (ref x) = ref x; 
12123  86 
val finish = I; 
5005  87 
val prep_ext = mk_empty; 
88 
val merge = mk_empty; 

89 

8720  90 
fun pretty sg (ref {space, thms_tab, const_idx = _}) = 
4853  91 
let 
10008  92 
val prt_thm = Display.pretty_thm_sg sg; 
4853  93 
fun prt_thms (name, [th]) = 
94 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] 

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

3987  96 

6846  97 
val thmss = NameSpace.cond_extern_table space thms_tab; 
9215  98 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
8720  99 

9215  100 
fun print sg data = Pretty.writeln (pretty sg data); 
3987  101 
end; 
102 

5005  103 
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); 
104 
val get_theorems_sg = TheoremsData.get_sg; 

105 
val get_theorems = TheoremsData.get; 

106 

6367  107 
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; 
108 

3987  109 

5000  110 
(* print theory *) 
3987  111 

5005  112 
val print_theorems = TheoremsData.print; 
8720  113 

5000  114 
fun print_theory thy = 
9215  115 
Display.pretty_full_theory thy @ 
116 
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] 

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

118 

3987  119 

120 

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

121 
(** retrieve theorems **) 
3987  122 

9564  123 
(* selections *) 
124 

125 
fun the_thms _ (Some thms) = thms 

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

4037  127 

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

130 

131 

9808  132 
(* get_thm(s)_closure  statically scoped versions *) 
9564  133 

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

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

135 

9564  136 
fun lookup_thms thy = 
137 
let 

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

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

140 
in 

141 
fn name => 

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

3987  145 

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

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

149 

9808  150 
fun get_thm_closure thy = 
151 
let val get = get_thms_closure thy 

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

153 

9564  154 

155 
(* get_thm etc. *) 

156 

157 
fun get_thms theory name = 

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

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

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

160 

6091  161 
fun get_thmss thy names = flat (map (get_thms thy) names); 
9564  162 
fun get_thm thy name = single_thm name (get_thms thy name); 
4783  163 

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

164 

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

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

166 

6091  167 
fun attach_name thm = (Thm.name_of_thm thm, thm); 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

168 

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

169 
fun thms_of thy = 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

170 
let val ref {thms_tab, ...} = get_theorems thy in 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

171 
map attach_name (flat (map snd (Symtab.dest thms_tab))) 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

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

173 

3987  174 

175 

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

176 
(** theorems indexed by constants **) 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

177 

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

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

179 

6091  180 
fun add_const_idx ((next, table), thm) = 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

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

182 
val {hyps, prop, ...} = Thm.rep_thm thm; 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

183 
val consts = 
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7753
diff
changeset

184 
foldr add_term_consts (hyps, add_term_consts (prop, [])); 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

185 

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

186 
fun add (tab, c) = 
6091  187 
Symtab.update ((c, (next, thm) :: Symtab.lookup_multi (tab, c)), tab); 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

188 
in (next + 1, foldl add (table, consts)) end; 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

189 

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

190 
fun make_const_idx thm_tab = 
5686  191 
Symtab.foldl (fn (x, (_, ths)) => foldl add_const_idx (x, ths)) ((0, Symtab.empty), thm_tab); 
4022
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 
(* lookup index *) 
3987  195 

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

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

197 
fun containing [] thy = thms_of thy 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

198 
 containing consts thy = 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

199 
let 
4037  200 
fun int ([], _) = [] 
201 
 int (_, []) = [] 

202 
 int (xxs as ((x as (i:int, _)) :: xs), yys as ((y as (j, _)) :: ys)) = 

203 
if i = j then x :: int (xs, ys) 

204 
else if i > j then int (xs, yys) 

205 
else int (xxs, ys); 

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

206 

4037  207 
fun ints [xs] = xs 
208 
 ints xss = if exists null xss then [] else foldl int (hd xss, tl xss); 

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

209 

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

210 
val ref {const_idx = (_, ctab), ...} = get_theorems thy; 
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

211 
val ithmss = map (fn c => Symtab.lookup_multi (ctab, c)) consts; 
6977  212 
in map (attach_name o snd) (ints ithmss) end; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

213 

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

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

215 
fun thms_containing thy consts = 
6977  216 
(case filter (is_none o Sign.const_type (Theory.sign_of thy)) consts of 
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7753
diff
changeset

217 
[] => flat (map (containing consts) (thy :: Theory.ancestors_of thy)) 
10008  218 
 cs => raise THEORY ("thms_containing: undeclared consts " ^ commas_quote cs, [thy])) 
219 
> map (apsnd (Thm.transfer thy)); 

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

220 

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

221 

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

222 

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

223 
(** store theorems **) (*DESTRUCTIVE*) 
3987  224 

4853  225 
(* naming *) 
226 

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

4853  229 

11998  230 
fun name_thm name [x] = [Thm.name_thm (name, x)]; 
231 
fun name_multi name xs = gen_names 0 (length xs) name ~~ xs; 

232 
fun name_thms name xs = map Thm.name_thm (name_multi name xs); 

233 
fun name_thmss name = snd o foldl_map (fn (i, (ys, z)) => (i + length ys, 

234 
(map Thm.name_thm (gen_names i (length ys) name ~~ ys), z))) o pair 0; 

4853  235 

236 

11998  237 
(* enter_thms *) 
4853  238 

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

239 
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

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

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

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

245 
val name = Sign.full_name sg bname; 
11998  246 
val (thy', thms') = app_att (thy, pre_name name thms); 
247 
val named_thms = post_name name thms'; 

3987  248 

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

249 
val r as ref {space, thms_tab, const_idx} = get_theorems_sg sg; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

250 

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

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

252 
(case Symtab.lookup (thms_tab, name) of 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

253 
None => false 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

254 
 Some thms' => 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

255 
if Library.equal_lists Thm.eq_thm (thms', named_thms) then (warn_same name; false) 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

256 
else (warn_overwrite name; true)); 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

257 

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

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

259 
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

260 
val const_idx' = 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

261 
if overwrite then make_const_idx thms_tab' 
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

262 
else foldl add_const_idx (const_idx, named_thms); 
11998  263 
in r := {space = space', thms_tab = thms_tab', const_idx = const_idx'}; 
264 
(thy', named_thms) 

265 
end; 

3987  266 

4853  267 

6091  268 
(* add_thms(s) *) 
4853  269 

11998  270 
fun add_thms' app_name ((bname, thms), atts) thy = 
271 
enter_thms (Theory.sign_of thy) app_name app_name 

272 
(Thm.applys_attributes o rpair atts) thy (bname, thms); 

4853  273 

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

274 
fun add_thms args theory = 
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

275 
(theory, args) 
11998  276 
> foldl_map (fn (thy, ((bname, thm), atts)) => add_thms' name_thm 
277 
((bname, [thm]), atts) thy) 

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

278 
> apsnd (map hd); 
5907  279 

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

280 
fun add_thmss args theory = 
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

281 
(theory, args) 
11998  282 
> foldl_map (fn (thy, arg) => add_thms' name_thms arg thy); 
5907  283 

284 

6091  285 
(* have_thmss *) 
5907  286 

9192  287 
local 
288 
fun have_thss kind_atts (thy, ((bname, more_atts), ths_atts)) = 

289 
let 

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

11998  291 
val (thy', thms) = enter_thms (Theory.sign_of thy) 
292 
name_thmss name_thms (apsnd flat o foldl_map app) thy 

293 
(bname, map (fn (ths, atts) => 

294 
(ths, atts @ more_atts @ kind_atts)) ths_atts); 

295 
in (thy', (bname, thms)) end; 

9192  296 
in 
297 
fun have_thmss kind_atts args thy = foldl_map (have_thss kind_atts) (thy, args); 

298 
end; 

5280  299 

300 

6091  301 
(* store_thm *) 
5280  302 

11998  303 
fun store_thm ((bname, thm), atts) thy = 
304 
let val (thy', [th']) = add_thms' name_thm ((bname, [thm]), atts) thy 

5280  305 
in (thy', th') end; 
3987  306 

307 

7405  308 
(* smart_store_thms *) 
3987  309 

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

311 
error ("Cannot store empty list of theorems: " ^ quote name) 
11998  312 
 gen_smart_store_thms name_thm _ (name, [thm]) = 
313 
snd (enter_thms (Thm.sign_of_thm thm) name_thm name_thm I () (name, [thm])) 

314 
 gen_smart_store_thms _ name_thm (name, thms) = 

7405  315 
let 
316 
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); 

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

11998  318 
in snd (enter_thms (Sign.deref sg_ref) name_thm name_thm I () (name, thms)) end; 
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

319 

11998  320 
val smart_store_thms = gen_smart_store_thms name_thm name_thms; 
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset

321 
val smart_store_thms_open = gen_smart_store_thms (K I) (K I); 
3987  322 

323 

7899  324 
(* forall_elim_vars (belongs to drule.ML) *) 
325 

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

327 
Could clash with Vars already present.*) 

328 
fun forall_elim_var i th = 

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

330 
in case prop of 

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

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

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

334 
end; 

335 

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

337 
fun forall_elim_vars i th = 

338 
forall_elim_vars i (forall_elim_var i th) 

339 
handle THM _ => th; 

340 

341 

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

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

343 

4853  344 
local 
7899  345 
fun get_axs thy named_axs = 
346 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  347 

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

348 
fun add_single add (thy, ((name, ax), atts)) = 
4853  349 
let 
11998  350 
val named_ax = [(name, ax)]; 
7753  351 
val thy' = add named_ax thy; 
352 
val thm = hd (get_axs thy' named_ax); 

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

353 
in apsnd hd (add_thms [((name, thm), atts)] thy') end; 
7753  354 

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

355 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  356 
let 
357 
val named_axs = name_multi name axs; 

4853  358 
val thy' = add named_axs thy; 
7753  359 
val thms = get_axs thy' named_axs; 
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

360 
in apsnd hd (add_thmss [((name, thms), atts)] thy') end; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

361 

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

362 
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

363 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  364 
in 
7753  365 
val add_axioms = add_singles Theory.add_axioms; 
366 
val add_axioms_i = add_singles Theory.add_axioms_i; 

367 
val add_axiomss = add_multis Theory.add_axioms; 

368 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  369 
val add_defs = add_singles o Theory.add_defs; 
370 
val add_defs_i = add_singles o Theory.add_defs_i; 

371 
val add_defss = add_multis o Theory.add_defs; 

372 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

374 

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

375 

3987  376 

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

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

378 

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

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

380 

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

382 

5005  383 
structure TheoryManagementDataArgs = 
384 
struct 

385 
val name = "Pure/theory_management"; 

6660  386 
type T = {name: string, version: int}; 
5000  387 

6660  388 
val empty = {name = "", version = 0}; 
6547  389 
val copy = I; 
12123  390 
val finish = I; 
5005  391 
val prep_ext = I; 
5000  392 
fun merge _ = empty; 
5005  393 
fun print _ _ = (); 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

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

395 

5005  396 
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); 
397 
val get_info = TheoryManagementData.get; 

398 
val put_info = TheoryManagementData.put; 

399 

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

400 

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

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

402 

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

405 

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 
(* control prefixing of theory name *) 
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

408 

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

410 

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

411 
fun local_path thy = 
5210  412 
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

413 

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

414 

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

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

416 

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

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

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

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

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

421 

12123  422 
fun end_theory thy = 
423 
thy 

424 
> Theory.finish 

425 
> Theory.add_name (get_name thy); 

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

426 

6682  427 
fun checkpoint thy = 
428 
if is_draft thy then 

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

430 
thy 

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

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

433 
end 

434 
else thy; 

5000  435 

436 

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

437 

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

438 
(** add logical types **) 
4922
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 add_typedecls decls thy = 
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

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

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

443 

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

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

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

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

447 

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

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

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

450 

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

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

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

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

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

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

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

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

458 

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

459 

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

460 

5091  461 
(*** the ProtoPure theory ***) 
3987  462 

463 
val proto_pure = 

464 
Theory.pre_pure 

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

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

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

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

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

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

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

472 
("dummy", 0, NoSyn)] 
3987  473 
> Theory.add_classes_i [(logicC, [])] 
474 
> Theory.add_defsort_i logicS 

475 
> Theory.add_arities_i 

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

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

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

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

479 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  480 
> Theory.add_syntax Syntax.pure_syntax 
6692  481 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  482 
> Theory.add_trfuns Syntax.pure_trfuns 
483 
> Theory.add_trfunsT Syntax.pure_trfunsT 

484 
> Theory.add_syntax 

7949  485 
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), 
9534  486 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  487 
> Theory.add_consts 
488 
[("==", "['a::{}, 'a] => prop", InfixrName ("==", 2)), 

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

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

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

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

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

496 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

497 
> local_path 
9318  498 
> (#1 oo (add_defs false o map Thm.no_attributes)) 
10667  499 
[("flexpair_def", "(t =?= u) == (t == u::'a::{})")] 
500 
> (#1 oo (add_defs_i false o map Thm.no_attributes)) 

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

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

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

504 
> end_theory; 
3987  505 

5091  506 
structure ProtoPure = 
507 
struct 

508 
val thy = proto_pure; 

509 
val flexpair_def = get_axiom thy "flexpair_def"; 

510 
val Goal_def = get_axiom thy "Goal_def"; 

511 
end; 

3987  512 

513 

514 
end; 

515 

516 

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

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

518 
open BasicPureThy; 