author  wenzelm 
Sat, 07 Jan 2006 23:27:53 +0100  
changeset 18614  3618d5ae0ac8 
parent 18418  bf448d999b7e 
child 18666  f37a43cec547 
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 
18031  11 
datatype thmref = 
12 
Name of string  

13 
NameSelection of string * interval list  

14 
Fact of string 

5000  15 
val print_theorems: theory > unit 
16 
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

17 
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

18 
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

19 
val get_thmss: theory > thmref list > thm list 
17930
e7160d70be1f
added thm(s) retrieval functions (from goals.ML);
wenzelm
parents:
17703
diff
changeset

20 
val thm: xstring > thm 
e7160d70be1f
added thm(s) retrieval functions (from goals.ML);
wenzelm
parents:
17703
diff
changeset

21 
val thms: xstring > thm list 
5091  22 
structure ProtoPure: 
23 
sig 

24 
val thy: theory 

18031  25 
val prop_def: thm 
5091  26 
end 
4853  27 
end; 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

28 

3987  29 
signature PURE_THY = 
30 
sig 

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

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

32 
val string_of_thmref: thmref > string 
16493  33 
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

34 
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

35 
val get_thms_closure: theory > thmref > thm list 
9564  36 
val single_thm: string > thm list > thm 
16493  37 
val name_of_thmref: thmref > string 
38 
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

39 
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

40 
val selections: string * thm list > (thmref * thm) list 
17162  41 
val theorems_of: theory > thm list NameSpace.table 
42 
val theorem_space: theory > NameSpace.T 

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

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

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

45 
val thms_containing: theory > FactIndex.spec > (string * thm list) list 
13646  46 
val thms_containing_consts: theory > string list > (string * thm) list 
16336  47 
val thms_of: theory > (string * thm) list 
48 
val all_thms_of: theory > (string * thm) list 

12695  49 
val hide_thms: bool > string list > theory > theory 
18358  50 
val store_thm: (bstring * thm) * theory attribute list > theory > thm * theory 
7405  51 
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

52 
val smart_store_thms_open: (bstring * thm list) > thm list 
7899  53 
val forall_elim_var: int > thm > thm 
54 
val forall_elim_vars: int > thm > thm 

18377  55 
val add_thms: ((bstring * thm) * theory attribute list) list > theory > thm list * theory 
12711  56 
val add_thmss: ((bstring * thm list) * theory attribute list) list > theory 
18377  57 
> thm list list * theory 
16132  58 
val note_thmss: theory attribute > ((bstring * theory attribute list) * 
16441  59 
(thmref * theory attribute list) list) list > 
18377  60 
theory > (bstring * thm list) list * theory 
16132  61 
val note_thmss_i: theory attribute > ((bstring * theory attribute list) * 
16441  62 
(thm list * theory attribute list) list) list > 
18377  63 
theory > (bstring * thm list) list * theory 
16441  64 
val add_axioms: ((bstring * string) * theory attribute list) list > 
18377  65 
theory > thm list * theory 
16441  66 
val add_axioms_i: ((bstring * term) * theory attribute list) list > 
18377  67 
theory > thm list * theory 
16441  68 
val add_axiomss: ((bstring * string list) * theory attribute list) list > 
18377  69 
theory > thm list list * theory 
16441  70 
val add_axiomss_i: ((bstring * term list) * theory attribute list) list > 
18377  71 
theory > thm list list * theory 
16441  72 
val add_defs: bool > ((bstring * string) * theory attribute list) list > 
18358  73 
theory > thm list * theory 
16441  74 
val add_defs_i: bool > ((bstring * term) * theory attribute list) list > 
18358  75 
theory > thm list * theory 
16441  76 
val add_defss: bool > ((bstring * string list) * theory attribute list) list > 
18358  77 
theory > thm list list * theory 
16441  78 
val add_defss_i: bool > ((bstring * term list) * theory attribute list) list > 
18358  79 
theory > thm list list * theory 
17342
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

80 
val generic_setup: string > theory > theory 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

81 
val add_oracle: bstring * string * string > theory > theory 
3987  82 
end; 
83 

84 
structure PureThy: PURE_THY = 

85 
struct 

86 

87 

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

88 
(*** theorem database ***) 
3987  89 

16441  90 
(** dataype theorems **) 
3987  91 

16493  92 
fun pretty_theorems_diff thy prev_thms (space, thms) = 
16441  93 
let 
94 
val prt_thm = Display.pretty_thm_sg thy; 

95 
fun prt_thms (name, [th]) = 

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

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

16493  98 

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

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

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

16441  102 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
103 

16493  104 
fun pretty_theorems thy = pretty_theorems_diff thy Symtab.empty; 
105 

16441  106 
structure TheoremsData = TheoryDataFun 
107 
(struct 

5005  108 
val name = "Pure/theorems"; 
109 
type T = 

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

3987  112 

4853  113 
fun mk_empty _ = 
16336  114 
ref {theorems = NameSpace.empty_table, index = FactIndex.empty}: T; 
3987  115 

5005  116 
val empty = mk_empty (); 
6547  117 
fun copy (ref x) = ref x; 
16441  118 
val extend = mk_empty; 
119 
fun merge _ = mk_empty; 

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

121 
end); 

3987  122 

16493  123 
val get_theorems_ref = TheoremsData.get; 
124 
val get_theorems = ! o get_theorems_ref; 

17162  125 
val theorems_of = #theorems o get_theorems; 
126 
val theorem_space = #1 o theorems_of; 

16493  127 
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

128 

6367  129 

5000  130 
(* print theory *) 
3987  131 

5005  132 
val print_theorems = TheoremsData.print; 
8720  133 

16493  134 
fun print_theorems_diff prev_thy thy = 
135 
Pretty.writeln (pretty_theorems_diff thy 

17162  136 
(#2 (theorems_of prev_thy)) (#theorems (get_theorems thy))); 
16493  137 

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

142 

3987  143 

144 

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

145 
(** retrieve theorems **) 
3987  146 

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

4037  149 

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

152 

15703  153 

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

154 
(* datatype interval *) 
15703  155 

156 
datatype interval = 

157 
FromTo of int * int  

158 
From of int  

159 
Single of int; 

160 

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

162 
 interval n (From i) = i upto n 

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

164 

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

165 
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

166 
 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

167 
 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

168 

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

169 

16493  170 
(* datatype thmref *) 
171 

172 
datatype thmref = 

173 
Name of string  

18031  174 
NameSelection of string * interval list  
175 
Fact of string; 

15703  176 

16493  177 
fun name_of_thmref (Name name) = name 
18031  178 
 name_of_thmref (NameSelection (name, _)) = name 
179 
 name_of_thmref (Fact _) = raise ERROR_MESSAGE "Illegal literal fact"; 

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

180 

16493  181 
fun map_name_of_thmref f (Name name) = Name (f name) 
18031  182 
 map_name_of_thmref f (NameSelection (name, is)) = NameSelection (f name, is) 
183 
 map_name_of_thmref _ thmref = thmref; 

16493  184 

185 
fun string_of_thmref (Name name) = name 

186 
 string_of_thmref (NameSelection (name, is)) = 

18031  187 
name ^ enclose "(" ")" (commas (map string_of_interval is)) 
188 
 string_of_thmref (Fact _) = raise ERROR_MESSAGE "Illegal literal fact"; 

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

189 

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

190 

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

191 
(* select_thm *) 
15703  192 

16493  193 
fun select_thm (Name _) thms = thms 
18031  194 
 select_thm (Fact _) thms = thms 
16493  195 
 select_thm (NameSelection (name, is)) thms = 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

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

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

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

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

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

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

203 
in map select (List.concat (map (interval n) is)) end; 
15703  204 

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

205 

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

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

207 

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

209 
 selections (name, thms) = (1 upto length thms, thms) > ListPair.map (fn (i, thm) => 
16493  210 
(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

211 

9564  212 

9808  213 
(* get_thm(s)_closure  statically scoped versions *) 
9564  214 

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

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

216 

9564  217 
fun lookup_thms thy = 
218 
let 

16441  219 
val thy_ref = Theory.self_ref thy; 
16493  220 
val (space, thms) = #theorems (get_theorems thy); 
9564  221 
in 
222 
fn name => 

17221  223 
Option.map (map (Thm.transfer (Theory.deref thy_ref))) (*dynamic identity*) 
17418  224 
(Symtab.lookup thms (NameSpace.intern space name)) (*static content*) 
9564  225 
end; 
3987  226 

9564  227 
fun get_thms_closure thy = 
16441  228 
let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) in 
16493  229 
fn thmref => 
18031  230 
let val name = name_of_thmref thmref; 
16493  231 
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

232 
end; 
9564  233 

9808  234 
fun get_thm_closure thy = 
235 
let val get = get_thms_closure thy 

16493  236 
in fn thmref => single_thm (name_of_thmref thmref) (get thmref) end; 
9808  237 

9564  238 

16441  239 
(* get_thms etc. *) 
9564  240 

16493  241 
fun get_thms theory thmref = 
242 
let val name = name_of_thmref thmref in 

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

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

245 
end; 

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

246 

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

4783  249 

17930
e7160d70be1f
added thm(s) retrieval functions (from goals.ML);
wenzelm
parents:
17703
diff
changeset

250 
fun thm name = get_thm (the_context ()) (Name name); 
e7160d70be1f
added thm(s) retrieval functions (from goals.ML);
wenzelm
parents:
17703
diff
changeset

251 
fun thms name = get_thms (the_context ()) (Name name); 
e7160d70be1f
added thm(s) retrieval functions (from goals.ML);
wenzelm
parents:
17703
diff
changeset

252 

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

253 

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

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

255 

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

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

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

258 
NONE => false 
16132  259 
 SOME ths' => Thm.eq_thms (ths, ths')); 
3987  260 

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

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

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

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

264 
FactIndex.find (fact_index_of thy) spec 
16493  265 
> List.filter (fn (name, ths) => valid_thms theory (Name name, ths)) 
17496  266 
> gen_distinct (eq_fst (op =))) 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

268 

13646  269 
fun thms_containing_consts thy consts = 
15570  270 
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

271 
> map (fn th => (Thm.name_of_thm th, th)); 
13646  272 

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

273 

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

275 

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

276 
fun thms_of thy = 
17162  277 
let val thms = #2 (theorems_of thy) 
278 
in map (fn th => (Thm.name_of_thm th, th)) (List.concat (map snd (Symtab.dest thms))) end; 

15703  279 

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

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

282 

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

283 

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

284 
(** store theorems **) (*DESTRUCTIVE*) 
3987  285 

16441  286 
(* hiding  affects current theory node only *) 
12695  287 

13424  288 
fun hide_thms fully names thy = 
12695  289 
let 
16493  290 
val r as ref {theorems = (space, thms), index} = get_theorems_ref thy; 
16132  291 
val space' = fold (NameSpace.hide fully) names space; 
16336  292 
in r := {theorems = (space', thms), index = index}; thy end; 
12695  293 

294 

4853  295 
(* naming *) 
296 

18614  297 
fun gen_names _ len "" = replicate len "" 
298 
 gen_names j len name = map (fn i => name ^ "_" ^ string_of_int i) (j + 1 upto j + len); 

4853  299 

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

301 

16441  302 
fun name_thm pre (name, thm) = 
303 
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

304 

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

305 
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

306 
 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

307 

16441  308 
fun name_thmss name xs = 
309 
(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

310 
[([x], z)] => [([name_thm true (name, x)], z)] 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

311 
 _ => fst (fold_map (fn (ys, z) => fn i => 
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

312 
((map (name_thm true) (gen_names i (length ys) name ~~ ys), z), i + length ys)) xs 0)); 
4853  313 

314 

11998  315 
(* enter_thms *) 
4853  316 

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

317 
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

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

18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

320 
fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) > swap 
16441  321 
 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

322 
let 
16441  323 
val name = Sign.full_name thy bname; 
324 
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

325 
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

326 
val space' = Sign.declare_name thy' name space; 
17418  327 
val theorems' = Symtab.update (name, thms') theorems; 
18031  328 
val index' = FactIndex.add_global (name, thms') index; 
13274  329 
in 
17418  330 
(case Symtab.lookup theorems name of 
15531  331 
NONE => () 
16441  332 
 SOME thms'' => 
333 
if Thm.eq_thms (thms', thms'') then warn_same name 

13274  334 
else warn_overwrite name); 
16336  335 
r := {theorems = (space', theorems'), index = index'}; 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

336 
(thms', thy') 
11998  337 
end; 
3987  338 

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

339 

6091  340 
(* add_thms(s) *) 
4853  341 

16441  342 
fun add_thms_atts pre_name ((bname, thms), atts) = 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

343 
enter_thms pre_name (name_thms false) 
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

344 
(Thm.applys_attributes atts) (bname, thms); 
4853  345 

18377  346 
fun gen_add_thmss pre_name = 
347 
fold_map (add_thms_atts pre_name); 

5907  348 

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

349 
fun gen_add_thms pre_name args = 
18377  350 
apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args); 
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset

351 

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

352 
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

353 
val add_thms = gen_add_thms (name_thms true); 
5907  354 

355 

14564  356 
(* note_thmss(_i) *) 
5907  357 

9192  358 
local 
12711  359 

18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

360 
fun gen_note_thss get kind_att ((bname, more_atts), ths_atts) thy = 
12711  361 
let 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

362 
fun app (x, (ths, atts)) = Thm.applys_attributes atts (x, ths); 
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

363 
val (thms, thy') = thy > enter_thms 
16441  364 
name_thmss (name_thms false) (apsnd List.concat o foldl_map app) 
12711  365 
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

366 
in ((bname, thms), thy') end; 
12711  367 

18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

368 
fun gen_note_thmss get kind_att = 
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

369 
fold_map (gen_note_thss get kind_att); 
12711  370 

9192  371 
in 
12711  372 

18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

373 
val note_thmss = gen_note_thmss get_thms; 
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

374 
val note_thmss_i = gen_note_thmss (K I); 
12711  375 

9192  376 
end; 
5280  377 

378 

6091  379 
(* store_thm *) 
5280  380 

11998  381 
fun store_thm ((bname, thm), atts) thy = 
18377  382 
let val ([th'], thy') = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
18358  383 
in (th', thy') end; 
3987  384 

385 

16441  386 
(* smart_store_thms(_open) *) 
3987  387 

16441  388 
local 
389 

390 
fun smart_store _ (name, []) = 

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

391 
error ("Cannot store empty list of theorems: " ^ quote name) 
16441  392 
 smart_store name_thm (name, [thm]) = 
18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

393 
fst (enter_thms (name_thm true) (name_thm false) I (name, [thm]) (Thm.theory_of_thm thm)) 
16441  394 
 smart_store name_thm (name, thms) = 
7405  395 
let 
16441  396 
fun merge (thy, th) = Theory.merge (thy, Thm.theory_of_thm th); 
397 
val thy = Library.foldl merge (Thm.theory_of_thm (hd thms), tl thms); 

18418
bf448d999b7e
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset

398 
in fst (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

399 

16441  400 
in 
401 

402 
val smart_store_thms = smart_store name_thms; 

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

404 

405 
end; 

3987  406 

407 

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

408 
(* forall_elim_var(s)  belongs to drule.ML *) 
7899  409 

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

410 
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

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

412 
val {thy, tpairs, prop, ...} = Thm.rep_thm th; 
16787  413 
val add_used = Term.fold_aterms 
414 
(fn Var ((x, j), _) => if i = j then curry (op ins_string) x else I  _ => I); 

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

415 
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

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

417 
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

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

419 
in fold Thm.forall_elim cvars th end; 
7899  420 

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

421 
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

422 

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

423 
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

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

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

427 

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

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

429 

4853  430 
local 
17418  431 
fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name); 
432 
fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs; 

18377  433 
fun add_single add ((name, ax), atts) thy = 
4853  434 
let 
11998  435 
val named_ax = [(name, ax)]; 
7753  436 
val thy' = add named_ax thy; 
437 
val thm = hd (get_axs thy' named_ax); 

18377  438 
in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end; 
439 
fun add_multi add ((name, axs), atts) thy = 

7753  440 
let 
441 
val named_axs = name_multi name axs; 

4853  442 
val thy' = add named_axs thy; 
7753  443 
val thms = get_axs thy' named_axs; 
18377  444 
in apfst hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end; 
445 
fun add_singles add = fold_map (add_single add); 

446 
fun add_multis add = fold_map (add_multi add); 

4853  447 
in 
7753  448 
val add_axioms = add_singles Theory.add_axioms; 
449 
val add_axioms_i = add_singles Theory.add_axioms_i; 

450 
val add_axiomss = add_multis Theory.add_axioms; 

451 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

18377  452 
val add_defs = add_singles o Theory.add_defs; 
453 
val add_defs_i = add_singles o Theory.add_defs_i; 

454 
val add_defss = add_multis o Theory.add_defs; 

455 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

457 

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

458 

3987  459 

17342
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

460 
(*** ML setup ***) 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

461 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

462 
(* generic_setup *) 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

463 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

464 
val generic_setup = 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

465 
Context.use_let "val setup: (theory > theory) list" "Library.apply setup"; 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

466 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

467 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

468 
(* add_oracle *) 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

469 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

470 
fun add_oracle (name, T, oracle) = 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

471 
let val txt = 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

472 
"local\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

473 
\ type T = " ^ T ^ ";\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

474 
\ val oracle: theory > T > term = " ^ oracle ^ ";\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

475 
\ val name = " ^ quote name ^ ";\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

476 
\ exception Arg of T;\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

477 
\ val _ = Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

478 
\ val thy = Context.the_context ();\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

479 
\ val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

480 
\in\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

481 
\ fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\ 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

482 
\end;\n"; 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

483 
in Context.use_mltext_theory txt false end; 
92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

484 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

485 

92504e2f6c07
added generic_setup, add_oracle (from isar_thy.ML);
wenzelm
parents:
17221
diff
changeset

486 

5091  487 
(*** the ProtoPure theory ***) 
3987  488 

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

491 

3987  492 
val proto_pure = 
16493  493 
Context.pre_pure_thy 
16987  494 
> Compress.init_data 
16536  495 
> Sign.init_data 
496 
> Theory.init_data 

497 
> Proofterm.init_data 

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

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

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

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

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

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

504 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  505 
> Theory.add_syntax Syntax.pure_syntax 
15801  506 
> Theory.add_syntax Syntax.pure_appl_syntax 
6692  507 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  508 
> Theory.add_syntax 
16441  509 
[("==>", "prop => prop => prop", Delimfix "op ==>"), 
9534  510 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  511 
> Theory.add_consts 
16441  512 
[("==", "'a => 'a => prop", InfixrName ("==", 2)), 
513 
("==>", "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 

3987  514 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 
18031  515 
("prop", "prop => prop", NoSyn), 
6547  516 
("TYPE", "'a itself", NoSyn), 
9534  517 
(Term.dummy_patternN, "'a", Delimfix "'_")] 
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
13800
diff
changeset

518 
> Theory.add_finals_i false 
16441  519 
[Const ("==", [aT, aT] > propT), 
520 
Const ("==>", [propT, propT] > propT), 

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

17703  522 
Const ("TYPE", a_itselfT), 
523 
Const (Term.dummy_patternN, aT)] 

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

524 
> Theory.add_modesyntax ("", false) 
18377  525 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  526 
> Theory.add_trfuns Syntax.pure_trfuns 
527 
> Theory.add_trfunsT Syntax.pure_trfunsT 

16441  528 
> Sign.local_path 
18377  529 
> (add_defs_i false o map Thm.no_attributes) 
530 
[("prop_def", Logic.mk_equals (Logic.protect A, A))] > snd 

531 
> add_thmss [(("nothing", []), [])] > snd 

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

532 
> Theory.add_axioms_i Proofterm.equality_axms 
16493  533 
> Theory.end_theory; 
3987  534 

5091  535 
structure ProtoPure = 
536 
struct 

537 
val thy = proto_pure; 

18031  538 
val prop_def = get_axiom thy "prop_def"; 
5091  539 
end; 
3987  540 

541 
end; 

542 

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

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

544 
open BasicPureThy; 