author  wenzelm 
Wed, 06 Jul 2005 20:00:29 +0200  
changeset 16722  040728f6a103 
parent 16536  c5744af6b28a 
child 16787  b6b6e2faaa41 
permissions  rwrr 
3987  1 
(* Title: Pure/pure_thy.ML 
2 
ID: $Id$ 

3 
Author: Markus Wenzel, TU Muenchen 

4 

16441  5 
Theorem storage. 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 
16493  10 
datatype interval = FromTo of int * int  From of int  Single of int 
11 
datatype thmref = Name of string  NameSelection of string * interval list 

5000  12 
val print_theorems: theory > unit 
13 
val print_theory: theory > unit 

15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

14 
val get_thm: theory > thmref > thm 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

15 
val get_thms: theory > thmref > thm list 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

16 
val get_thmss: theory > thmref list > thm list 
5091  17 
structure ProtoPure: 
18 
sig 

19 
val thy: theory 

20 
val Goal_def: thm 

21 
end 

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

23 

3987  24 
signature PURE_THY = 
25 
sig 

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

26 
include BASIC_PURE_THY 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

27 
val string_of_thmref: thmref > string 
16441  28 
val theorem_space: theory > NameSpace.T 
16493  29 
val print_theorems_diff: theory > theory > unit 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

30 
val get_thm_closure: theory > thmref > thm 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

31 
val get_thms_closure: theory > thmref > thm list 
9564  32 
val single_thm: string > thm list > thm 
16493  33 
val name_of_thmref: thmref > string 
34 
val map_name_of_thmref: (string > string) > thmref > thmref 

15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

35 
val select_thm: thmref > thm list > thm list 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

36 
val selections: string * thm list > (thmref * thm) list 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

37 
val fact_index_of: theory > FactIndex.T 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

38 
val valid_thms: theory > thmref * thm list > bool 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

39 
val thms_containing: theory > FactIndex.spec > (string * thm list) list 
13646  40 
val thms_containing_consts: theory > string list > (string * thm) list 
16336  41 
val thms_of: theory > (string * thm) list 
42 
val all_thms_of: theory > (string * thm) list 

12695  43 
val hide_thms: bool > string list > theory > theory 
6091  44 
val store_thm: (bstring * thm) * theory attribute list > theory > theory * thm 
7405  45 
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

46 
val smart_store_thms_open: (bstring * thm list) > thm list 
7899  47 
val forall_elim_var: int > thm > thm 
48 
val forall_elim_vars: int > thm > thm 

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

49 
val add_thms: ((bstring * thm) * theory attribute list) list > theory > theory * thm list 
12711  50 
val add_thmss: ((bstring * thm list) * theory attribute list) list > theory 
51 
> theory * thm list list 

16132  52 
val note_thmss: theory attribute > ((bstring * theory attribute list) * 
16441  53 
(thmref * theory attribute list) list) list > 
54 
theory > theory * (bstring * thm list) list 

16132  55 
val note_thmss_i: theory attribute > ((bstring * theory attribute list) * 
16441  56 
(thm list * theory attribute list) list) list > 
57 
theory > theory * (bstring * thm list) list 

58 
val add_axioms: ((bstring * string) * theory attribute list) list > 

59 
theory > theory * thm list 

60 
val add_axioms_i: ((bstring * term) * theory attribute list) list > 

61 
theory > theory * thm list 

62 
val add_axiomss: ((bstring * string list) * theory attribute list) list > 

63 
theory > theory * thm list list 

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

65 
theory > theory * thm list list 

66 
val add_defs: bool > ((bstring * string) * theory attribute list) list > 

67 
theory > theory * thm list 

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

69 
theory > theory * thm list 

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

71 
theory > theory * thm list list 

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

73 
theory > theory * thm list list 

3987  74 
end; 
75 

76 
structure PureThy: PURE_THY = 

77 
struct 

78 

79 

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

80 
(*** theorem database ***) 
3987  81 

16441  82 
(** dataype theorems **) 
3987  83 

16493  84 
fun pretty_theorems_diff thy prev_thms (space, thms) = 
16441  85 
let 
86 
val prt_thm = Display.pretty_thm_sg thy; 

87 
fun prt_thms (name, [th]) = 

88 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] 

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

16493  90 

91 
val diff_thmss = Symtab.fold (fn fact => 

92 
if not (Symtab.member eq_thms prev_thms fact) then cons fact else I) thms []; 

93 
val thmss = diff_thmss > map (apfst (NameSpace.extern space)) > Library.sort_wrt #1; 

16441  94 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
95 

16493  96 
fun pretty_theorems thy = pretty_theorems_diff thy Symtab.empty; 
97 

16441  98 
structure TheoremsData = TheoryDataFun 
99 
(struct 

5005  100 
val name = "Pure/theorems"; 
101 
type T = 

16441  102 
{theorems: thm list NameSpace.table, 
103 
index: FactIndex.T} ref; 

3987  104 

4853  105 
fun mk_empty _ = 
16336  106 
ref {theorems = NameSpace.empty_table, index = FactIndex.empty}: T; 
3987  107 

5005  108 
val empty = mk_empty (); 
6547  109 
fun copy (ref x) = ref x; 
16441  110 
val extend = mk_empty; 
111 
fun merge _ = mk_empty; 

112 
fun print thy (ref {theorems, index}) = Pretty.writeln (pretty_theorems thy theorems); 

113 
end); 

3987  114 

16493  115 
val get_theorems_ref = TheoremsData.get; 
116 
val get_theorems = ! o get_theorems_ref; 

117 
val theorem_space = #1 o #theorems o get_theorems; 

118 
val fact_index_of = #index o get_theorems; 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

119 

6367  120 

5000  121 
(* print theory *) 
3987  122 

5005  123 
val print_theorems = TheoremsData.print; 
8720  124 

16493  125 
fun print_theorems_diff prev_thy thy = 
126 
Pretty.writeln (pretty_theorems_diff thy 

127 
(#2 (#theorems (get_theorems prev_thy))) (#theorems (get_theorems thy))); 

128 

5000  129 
fun print_theory thy = 
9215  130 
Display.pretty_full_theory thy @ 
16493  131 
[pretty_theorems thy (#theorems (get_theorems thy))] 
8720  132 
> Pretty.chunks > Pretty.writeln; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

133 

3987  134 

135 

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

136 
(** retrieve theorems **) 
3987  137 

15531  138 
fun the_thms _ (SOME thms) = thms 
139 
 the_thms name NONE = error ("Unknown theorem(s) " ^ quote name); 

4037  140 

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

143 

15703  144 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

145 
(* datatype interval *) 
15703  146 

147 
datatype interval = 

148 
FromTo of int * int  

149 
From of int  

150 
Single of int; 

151 

152 
fun interval _ (FromTo (i, j)) = i upto j 

153 
 interval n (From i) = i upto n 

154 
 interval _ (Single i) = [i]; 

155 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

156 
fun string_of_interval (FromTo (i, j)) = string_of_int i ^ "" ^ string_of_int j 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

157 
 string_of_interval (From i) = string_of_int i ^ "" 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

158 
 string_of_interval (Single i) = string_of_int i; 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

159 

66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

160 

16493  161 
(* datatype thmref *) 
162 

163 
datatype thmref = 

164 
Name of string  

165 
NameSelection of string * interval list; 

15703  166 

16493  167 
fun name_of_thmref (Name name) = name 
168 
 name_of_thmref (NameSelection (name, _)) = name; 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

169 

16493  170 
fun map_name_of_thmref f (Name name) = Name (f name) 
171 
 map_name_of_thmref f (NameSelection (name, is)) = NameSelection (f name, is); 

172 

173 
fun string_of_thmref (Name name) = name 

174 
 string_of_thmref (NameSelection (name, is)) = 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

175 
name ^ enclose "(" ")" (commas (map string_of_interval is)); 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

176 

66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

177 

66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

178 
(* select_thm *) 
15703  179 

16493  180 
fun select_thm (Name _) thms = thms 
181 
 select_thm (NameSelection (name, is)) thms = 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

182 
let 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

183 
val n = length thms; 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

184 
fun select i = 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

185 
if i < 1 orelse i > n then 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

186 
error ("Bad subscript " ^ string_of_int i ^ " for " ^ 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

187 
quote name ^ " (length " ^ string_of_int n ^ ")") 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

188 
else List.nth (thms, i  1); 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

189 
in map select (List.concat (map (interval n) is)) end; 
15703  190 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

191 

66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

192 
(* selections *) 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

193 

16493  194 
fun selections (name, [thm]) = [(Name name, thm)] 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

195 
 selections (name, thms) = (1 upto length thms, thms) > ListPair.map (fn (i, thm) => 
16493  196 
(NameSelection (name, [Single i]), thm)); 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

197 

9564  198 

9808  199 
(* get_thm(s)_closure  statically scoped versions *) 
9564  200 

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

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

202 

9564  203 
fun lookup_thms thy = 
204 
let 

16441  205 
val thy_ref = Theory.self_ref thy; 
16493  206 
val (space, thms) = #theorems (get_theorems thy); 
9564  207 
in 
208 
fn name => 

16441  209 
Option.map (map (Thm.transfer (Theory.deref thy_ref))) (*dynamic identity*) 
210 
(Symtab.lookup (thms, NameSpace.intern space name)) (*static content*) 

9564  211 
end; 
3987  212 

9564  213 
fun get_thms_closure thy = 
16441  214 
let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) in 
16493  215 
fn thmref => 
216 
let val name = name_of_thmref thmref 

217 
in select_thm thmref (the_thms name (get_first (fn f => f name) closures)) end 

15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

218 
end; 
9564  219 

9808  220 
fun get_thm_closure thy = 
221 
let val get = get_thms_closure thy 

16493  222 
in fn thmref => single_thm (name_of_thmref thmref) (get thmref) end; 
9808  223 

9564  224 

16441  225 
(* get_thms etc. *) 
9564  226 

16493  227 
fun get_thms theory thmref = 
228 
let val name = name_of_thmref thmref in 

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

230 
> the_thms name > select_thm thmref > map (Thm.transfer theory) 

231 
end; 

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

232 

16493  233 
fun get_thmss thy thmrefs = List.concat (map (get_thms thy) thmrefs); 
234 
fun get_thm thy thmref = single_thm (name_of_thmref thmref) (get_thms thy thmref); 

4783  235 

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

236 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

238 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

239 
fun valid_thms thy (thmref, ths) = 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

240 
(case try (transform_error (get_thms thy)) thmref of 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

241 
NONE => false 
16132  242 
 SOME ths' => Thm.eq_thms (ths, ths')); 
3987  243 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

244 
fun thms_containing theory spec = 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

245 
(theory :: Theory.ancestors_of theory) 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

246 
> map (fn thy => 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

247 
FactIndex.find (fact_index_of thy) spec 
16493  248 
> List.filter (fn (name, ths) => valid_thms theory (Name name, ths)) 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

249 
> gen_distinct eq_fst) 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

250 
> List.concat; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

251 

13646  252 
fun thms_containing_consts thy consts = 
15570  253 
thms_containing thy (consts, []) > map #2 > List.concat 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

254 
> map (fn th => (Thm.name_of_thm th, th)); 
13646  255 

15882
a191d2bee3e1
new thms_containing that searches for patterns instead of constants
kleing
parents:
15801
diff
changeset

256 

16336  257 
(* thms_of etc. *) 
15882
a191d2bee3e1
new thms_containing that searches for patterns instead of constants
kleing
parents:
15801
diff
changeset

258 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

259 
fun thms_of thy = 
16493  260 
let val (_, thms) = #theorems (get_theorems thy) in 
16336  261 
map (fn th => (Thm.name_of_thm th, th)) (List.concat (map snd (Symtab.dest thms))) 
15882
a191d2bee3e1
new thms_containing that searches for patterns instead of constants
kleing
parents:
15801
diff
changeset

262 
end; 
15703  263 

16336  264 
fun all_thms_of thy = List.concat (map thms_of (thy :: Theory.ancestors_of thy)); 
265 

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

266 

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

267 

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

268 
(** store theorems **) (*DESTRUCTIVE*) 
3987  269 

16441  270 
(* hiding  affects current theory node only *) 
12695  271 

13424  272 
fun hide_thms fully names thy = 
12695  273 
let 
16493  274 
val r as ref {theorems = (space, thms), index} = get_theorems_ref thy; 
16132  275 
val space' = fold (NameSpace.hide fully) names space; 
16336  276 
in r := {theorems = (space', thms), index = index}; thy end; 
12695  277 

278 

4853  279 
(* naming *) 
280 

11998  281 
fun gen_names j len name = 
16441  282 
map (fn i => name ^ "_" ^ string_of_int i) (j + 1 upto j + len); 
4853  283 

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

285 

16441  286 
fun name_thm pre (name, thm) = 
287 
if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm (name, thm); 

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

288 

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

289 
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

290 
 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

291 

16441  292 
fun name_thmss name xs = 
293 
(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

294 
[([x], z)] => [([name_thm true (name, x)], z)] 
16441  295 
 _ => snd (foldl_map (fn (i, (ys, z)) => 
296 
(i + length ys, (map (name_thm true) (gen_names i (length ys) name ~~ ys), z))) (0, xs))); 

4853  297 

298 

11998  299 
(* enter_thms *) 
4853  300 

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

301 
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

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

16441  304 
fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) 
305 
 enter_thms pre_name post_name app_att (bname, thms) thy = 

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

306 
let 
16441  307 
val name = Sign.full_name thy bname; 
308 
val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms)); 

16513
f38693aad717
enter_thms: use theorem database of thy *after* attribute application;
wenzelm
parents:
16493
diff
changeset

309 
val r as ref {theorems = (space, theorems), index} = get_theorems_ref thy'; 
f38693aad717
enter_thms: use theorem database of thy *after* attribute application;
wenzelm
parents:
16493
diff
changeset

310 
val space' = Sign.declare_name thy' name space; 
16441  311 
val theorems' = Symtab.update ((name, thms'), theorems); 
312 
val index' = FactIndex.add (K false) (name, thms') index; 

13274  313 
in 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

314 
(case Symtab.lookup (theorems, name) of 
15531  315 
NONE => () 
16441  316 
 SOME thms'' => 
317 
if Thm.eq_thms (thms', thms'') then warn_same name 

13274  318 
else warn_overwrite name); 
16336  319 
r := {theorems = (space', theorems'), index = index'}; 
16441  320 
(thy', thms') 
11998  321 
end; 
3987  322 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

323 

6091  324 
(* add_thms(s) *) 
4853  325 

16441  326 
fun add_thms_atts pre_name ((bname, thms), atts) = 
327 
enter_thms pre_name (name_thms false) 

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

4853  329 

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

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

331 
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); 
5907  332 

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

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

334 
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

335 

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

336 
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

337 
val add_thms = gen_add_thms (name_thms true); 
5907  338 

339 

14564  340 
(* note_thmss(_i) *) 
5907  341 

9192  342 
local 
12711  343 

16132  344 
fun gen_note_thss get kind_att (thy, ((bname, more_atts), ths_atts)) = 
12711  345 
let 
346 
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); 

16441  347 
val (thy', thms) = thy > enter_thms 
348 
name_thmss (name_thms false) (apsnd List.concat o foldl_map app) 

12711  349 
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); 
350 
in (thy', (bname, thms)) end; 

351 

16132  352 
fun gen_note_thmss get kind_att args thy = 
353 
foldl_map (gen_note_thss get kind_att) (thy, args); 

12711  354 

9192  355 
in 
12711  356 

16132  357 
val note_thmss = gen_note_thmss get_thms; 
358 
val note_thmss_i = gen_note_thmss (K I); 

12711  359 

9192  360 
end; 
5280  361 

362 

6091  363 
(* store_thm *) 
5280  364 

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

366 
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
5280  367 
in (thy', th') end; 
3987  368 

369 

16441  370 
(* smart_store_thms(_open) *) 
3987  371 

16441  372 
local 
373 

374 
fun smart_store _ (name, []) = 

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

375 
error ("Cannot store empty list of theorems: " ^ quote name) 
16441  376 
 smart_store name_thm (name, [thm]) = 
377 
#2 (enter_thms (name_thm true) (name_thm false) I (name, [thm]) (Thm.theory_of_thm thm)) 

378 
 smart_store name_thm (name, thms) = 

7405  379 
let 
16441  380 
fun merge (thy, th) = Theory.merge (thy, Thm.theory_of_thm th); 
381 
val thy = Library.foldl merge (Thm.theory_of_thm (hd thms), tl thms); 

382 
in #2 (enter_thms (name_thm true) (name_thm false) I (name, thms) thy) end; 

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

383 

16441  384 
in 
385 

386 
val smart_store_thms = smart_store name_thms; 

387 
val smart_store_thms_open = smart_store (K (K I)); 

388 

389 
end; 

3987  390 

391 

16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

392 
(* forall_elim_var(s)  belongs to drule.ML *) 
7899  393 

16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

394 
fun forall_elim_vars_aux strip_vars i th = 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

395 
let 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

396 
val {thy, tpairs, prop, ...} = Thm.rep_thm th; 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

397 
fun add_used t used = (used, t) > Term.foldl_aterms 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

398 
(fn (xs, Var ((x, j), _)) => if i = j then x ins_string xs else xs  (xs, _) => xs); 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

399 
val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []); 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

400 
val vars = strip_vars prop; 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

401 
val cvars = (Term.variantlist (map #1 vars, used), vars) 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

402 
> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T))); 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

403 
in fold Thm.forall_elim cvars th end; 
7899  404 

16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

405 
val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars; 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

406 

040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

407 
fun forall_elim_var i th = forall_elim_vars_aux 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

408 
(fn Const ("all", _) $ Abs (a, T, _) => [(a, T)] 
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset

409 
 _ => raise THM ("forall_elim_vars", i, [th])) i th; 
7899  410 

411 

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

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

413 

4853  414 
local 
7899  415 
fun get_axs thy named_axs = 
416 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  417 

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

418 
fun add_single add (thy, ((name, ax), atts)) = 
4853  419 
let 
11998  420 
val named_ax = [(name, ax)]; 
7753  421 
val thy' = add named_ax thy; 
422 
val thm = hd (get_axs thy' named_ax); 

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

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

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

425 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  426 
let 
427 
val named_axs = name_multi name axs; 

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

430 
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

431 

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

432 
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

433 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  434 
in 
7753  435 
val add_axioms = add_singles Theory.add_axioms; 
436 
val add_axioms_i = add_singles Theory.add_axioms_i; 

437 
val add_axiomss = add_multis Theory.add_axioms; 

438 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  439 
val add_defs = add_singles o Theory.add_defs; 
440 
val add_defs_i = add_singles o Theory.add_defs_i; 

441 
val add_defss = add_multis o Theory.add_defs; 

442 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

444 

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

445 

3987  446 

5091  447 
(*** the ProtoPure theory ***) 
3987  448 

16441  449 
val aT = TFree ("'a", []); 
450 
val A = Free ("A", propT); 

451 

3987  452 
val proto_pure = 
16493  453 
Context.pre_pure_thy 
16536  454 
> Sign.init_data 
455 
> Theory.init_data 

456 
> Proofterm.init_data 

16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

457 
> TheoremsData.init 
3987  458 
> Theory.add_types 
4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

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

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

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

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

463 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  464 
> Theory.add_syntax Syntax.pure_syntax 
15801  465 
> Theory.add_syntax Syntax.pure_appl_syntax 
6692  466 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  467 
> Theory.add_syntax 
16441  468 
[("==>", "prop => prop => prop", Delimfix "op ==>"), 
9534  469 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  470 
> Theory.add_consts 
16441  471 
[("==", "'a => 'a => prop", InfixrName ("==", 2)), 
472 
("==>", "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 

3987  473 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 
10667  474 
("Goal", "prop => prop", NoSyn), 
6547  475 
("TYPE", "'a itself", NoSyn), 
9534  476 
(Term.dummy_patternN, "'a", Delimfix "'_")] 
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
13800
diff
changeset

477 
> Theory.add_finals_i false 
16441  478 
[Const ("==", [aT, aT] > propT), 
479 
Const ("==>", [propT, propT] > propT), 

480 
Const ("all", (aT > propT) > propT), 

481 
Const ("TYPE", a_itselfT)] 

5041
a1d0a6d555cd
Goals may now contain assumptions, which are not returned.
nipkow
parents:
5026
diff
changeset

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

483 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  484 
> Theory.add_trfuns Syntax.pure_trfuns 
485 
> Theory.add_trfunsT Syntax.pure_trfunsT 

16441  486 
> Sign.local_path 
10667  487 
> (#1 oo (add_defs_i false o map Thm.no_attributes)) 
16441  488 
[("Goal_def", Logic.mk_equals (Logic.mk_goal A, A))] 
9238  489 
> (#1 o add_thmss [(("nothing", []), [])]) 
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset

490 
> Theory.add_axioms_i Proofterm.equality_axms 
16493  491 
> Theory.end_theory; 
3987  492 

5091  493 
structure ProtoPure = 
494 
struct 

495 
val thy = proto_pure; 

496 
val Goal_def = get_axiom thy "Goal_def"; 

497 
end; 

3987  498 

499 
end; 

500 

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

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

502 
open BasicPureThy; 