author  skalberg 
Sun, 13 Feb 2005 17:15:14 +0100  
changeset 15531  08c8dad8e399 
parent 15518  81e5f6d3ab1d 
child 15570  8d8c70b41bab 
permissions  rwrr 
3987  1 
(* Title: Pure/pure_thy.ML 
2 
ID: $Id$ 

3 
Author: Markus Wenzel, TU Muenchen 

4 

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

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

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

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

10 
type thmref 
5000  11 
val print_theorems: theory > unit 
12 
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

13 
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

14 
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

15 
val get_thmss: theory > thmref 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 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 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

27 
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

28 
val get_thms_closure: theory > thmref > thm list 
9564  29 
val single_thm: string > thm list > thm 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

30 
val select_thm: thmref > thm list > thm list 
6367  31 
val cond_extern_thm_sg: Sign.sg > string > xstring 
13274  32 
val thms_containing: theory > string list * string list > (string * thm list) list 
13646  33 
val thms_containing_consts: theory > string list > (string * thm) list 
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

34 
val find_matching_thms: (thm > thm list) * (term > term) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

35 
> theory > term > (string * thm) list 
13646  36 
val find_intros: theory > term > (string * thm) list 
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset

37 
val find_intros_goal : theory > thm > int > (string * thm) list 
13646  38 
val find_elims : theory > term > (string * thm) list 
12695  39 
val hide_thms: bool > string list > theory > theory 
6091  40 
val store_thm: (bstring * thm) * theory attribute list > theory > theory * thm 
7405  41 
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

42 
val smart_store_thms_open: (bstring * thm list) > thm list 
7899  43 
val forall_elim_var: int > thm > thm 
44 
val forall_elim_vars: int > thm > thm 

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

45 
val add_thms: ((bstring * thm) * theory attribute list) list > theory > theory * thm list 
12711  46 
val add_thmss: ((bstring * thm list) * theory attribute list) list > theory 
47 
> theory * thm list list 

14564  48 
val note_thmss: theory attribute > ((bstring * theory attribute list) * 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

49 
(thmref * theory attribute list) list) list > theory > theory * (bstring * thm list) list 
14564  50 
val note_thmss_i: theory attribute > ((bstring * theory attribute list) * 
12711  51 
(thm list * theory attribute list) list) list > theory > theory * (bstring * thm list) list 
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset

52 
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

53 
val add_axioms_i: ((bstring * term) * theory attribute list) list > theory > theory * thm list 
12711  54 
val add_axiomss: ((bstring * string list) * theory attribute list) list > theory 
55 
> theory * thm list list 

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

57 
> theory * thm list list 

9318  58 
val add_defs: bool > ((bstring * string) * theory attribute list) list 
59 
> theory > theory * thm list 

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

61 
> theory > theory * thm list 

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

63 
> theory > theory * thm list list 

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

65 
> theory > theory * thm list list 

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

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

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

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

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

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

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

73 
val add_typedecls: (bstring * string list * mixfix) list > theory > theory 
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 

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

82 
(** data kind 'Pure/theorems' **) 
3987  83 

5005  84 
structure TheoremsDataArgs = 
85 
struct 

86 
val name = "Pure/theorems"; 

3987  87 

5005  88 
type T = 
89 
{space: NameSpace.T, 

6091  90 
thms_tab: thm list Symtab.table, 
13274  91 
index: FactIndex.T} ref; 
3987  92 

4853  93 
fun mk_empty _ = 
13274  94 
ref {space = NameSpace.empty, thms_tab = Symtab.empty, index = FactIndex.empty}: T; 
3987  95 

5005  96 
val empty = mk_empty (); 
6547  97 
fun copy (ref x) = ref x; 
5005  98 
val prep_ext = mk_empty; 
99 
val merge = mk_empty; 

100 

13274  101 
fun pretty sg (ref {space, thms_tab, index = _}) = 
4853  102 
let 
10008  103 
val prt_thm = Display.pretty_thm_sg sg; 
4853  104 
fun prt_thms (name, [th]) = 
105 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] 

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

3987  107 

6846  108 
val thmss = NameSpace.cond_extern_table space thms_tab; 
9215  109 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
8720  110 

9215  111 
fun print sg data = Pretty.writeln (pretty sg data); 
3987  112 
end; 
113 

5005  114 
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); 
115 
val get_theorems_sg = TheoremsData.get_sg; 

116 
val get_theorems = TheoremsData.get; 

117 

6367  118 
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; 
119 

3987  120 

5000  121 
(* print theory *) 
3987  122 

5005  123 
val print_theorems = TheoremsData.print; 
8720  124 

5000  125 
fun print_theory thy = 
9215  126 
Display.pretty_full_theory thy @ 
127 
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] 

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

129 

3987  130 

131 

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

132 
(** retrieve theorems **) 
3987  133 

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

134 
type thmref = xstring * int list option; 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

135 

9564  136 
(* selections *) 
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 

15531  144 
fun select_thm (s, NONE) xs = xs 
145 
 select_thm (s, SOME is) xs = map 

15518  146 
(fn i => (if i < 1 then raise LIST "" else nth_elem (i1, xs)) handle LIST _ => 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

147 
error ("Bad subscript " ^ string_of_int i ^ " for " ^ quote s)) is; 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

148 

9564  149 

9808  150 
(* get_thm(s)_closure  statically scoped versions *) 
9564  151 

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

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

153 

9564  154 
fun lookup_thms thy = 
155 
let 

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

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

158 
in 

159 
fn name => 

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

3987  163 

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

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

166 
in fn namei as (name, _) => select_thm namei 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

167 
(the_thms name (get_first (fn f => f name) closures)) 
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

168 
end; 
9564  169 

9808  170 
fun get_thm_closure thy = 
171 
let val get = get_thms_closure thy 

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

172 
in fn namei as (name, _) => single_thm name (get namei) end; 
9808  173 

9564  174 

175 
(* get_thm etc. *) 

176 

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

177 
fun get_thms theory (namei as (name, _)) = 
9564  178 
get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory) 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

179 
> the_thms name > select_thm namei > map (Thm.transfer theory); 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

180 

6091  181 
fun get_thmss thy names = flat (map (get_thms thy) names); 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

182 
fun get_thm thy (namei as (name, _)) = single_thm name (get_thms thy namei); 
4783  183 

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

184 

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

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

186 

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

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

188 
let val ref {thms_tab, ...} = get_theorems thy in 
13274  189 
map (fn th => (Thm.name_of_thm th, th)) (flat (map snd (Symtab.dest thms_tab))) 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

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

191 

3987  192 

13274  193 
(* thms_containing *) 
3987  194 

13274  195 
fun thms_containing thy idx = 
196 
let 

197 
fun valid (name, ths) = 

15531  198 
(case try (transform_error (get_thms thy)) (name, NONE) of 
199 
NONE => false 

200 
 SOME ths' => Library.equal_lists Thm.eq_thm (ths, ths')); 

13274  201 
in 
202 
(thy :: Theory.ancestors_of thy) 

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

204 
> flat 

205 
end; 

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

206 

13646  207 
fun thms_containing_consts thy consts = 
208 
thms_containing thy (consts, []) > map #2 > flat 

209 
> map (fn th => (Thm.name_of_thm th, th)) 

210 

211 
(* intro/elim theorems *) 

212 

213 
(* intro: given a goal state, find a suitable intro rule for some subgoal *) 

214 
(* elim: given a theorem thm, 

215 
find a theorem whose major premise eliminates the conclusion of thm *) 

216 

15531  217 
fun top_const t = (case head_of t of Const (c, _) => SOME c  _ => NONE); 
13646  218 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

219 
(* This is a hack to remove the Trueprop constant that most logics use *) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

220 
fun rem_top (_ $ t) = t 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

221 
 rem_top _ = Bound 0 (* does not match anything *) 
13646  222 

223 
(*returns all those named_thms whose subterm extracted by extract can be 

224 
instantiated to obj; the list is sorted according to the number of premises 

225 
and the size of the required substitution.*) 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

226 
fun select_match(c,obj, signobj, named_thms, (extract_thms,extract_term)) = 
13646  227 
let val tsig = Sign.tsig_of signobj 
228 
fun matches prop = 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

229 
let val pat = extract_term prop 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

230 
in case head_of pat of 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

231 
Const(d,_) => c=d andalso Pattern.matches tsig (pat,obj) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

232 
 _ => false 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

233 
end 
13646  234 

235 
fun substsize prop = 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

236 
let val pat = extract_term prop 
13646  237 
val (_,subst) = Pattern.match tsig (pat,obj) 
238 
in foldl op+ (0, map (size_of_term o snd) subst) end 

239 

240 
fun thm_ord ((p0,s0,_),(p1,s1,_)) = 

241 
prod_ord (int_ord o pairself (fn 0 => 0  x => 1)) int_ord ((p0,s0),(p1,s1)); 

242 

243 
fun select((p as (_,thm))::named_thms, sels) = 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

244 
let 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

245 
fun sel(thm::thms,sels) = 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

246 
let val {prop, ...} = rep_thm thm 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

247 
in if matches prop 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

248 
then (nprems_of thm,substsize prop,p)::sels 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

249 
else sel(thms,sels) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

250 
end 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

251 
 sel([],sels) = sels 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

252 
val {sign, ...} = rep_thm thm 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

253 
in select(named_thms,if Sign.subsig(sign, signobj) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

254 
then sel(extract_thms thm,sels) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

255 
else sels) 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

256 
end 
13646  257 
 select([],sels) = sels 
258 

259 
in map (fn (_,_,t) => t) (sort thm_ord (select(named_thms, []))) end; 

260 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

261 
fun find_matching_thms extract thy prop = 
15531  262 
(case top_const prop of NONE => [] 
263 
 SOME c => let val thms = thms_containing_consts thy [c] 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

264 
in select_match(c,prop,Theory.sign_of thy,thms,extract) end) 
13646  265 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

266 
val find_intros = 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

267 
find_matching_thms (single, rem_top o Logic.strip_imp_concl) 
13646  268 

13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset

269 
fun find_intros_goal thy st i = 
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

270 
find_intros thy (rem_top(Logic.concl_of_goal (prop_of st) i)); 
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset

271 

15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

272 
val find_elims = find_matching_thms 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

273 
(fn thm => if Thm.no_prems thm then [] else [thm], 
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset

274 
rem_top o hd o Logic.strip_imp_prems) 
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset

275 

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

276 

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

277 
(** store theorems **) (*DESTRUCTIVE*) 
3987  278 

12695  279 
(* hiding  affects current theory node only! *) 
280 

13424  281 
fun hide_thms fully names thy = 
12695  282 
let 
13274  283 
val r as ref {space, thms_tab, index} = get_theorems thy; 
13424  284 
val space' = NameSpace.hide fully (space, names); 
13274  285 
in r := {space = space', thms_tab = thms_tab, index = index}; thy end; 
12695  286 

287 

4853  288 
(* naming *) 
289 

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

4853  292 

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

294 

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

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

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

297 

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

298 
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

299 
 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

300 

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

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

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

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

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

306 

11998  307 
(* enter_thms *) 
4853  308 

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

309 
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

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

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

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

315 
val name = Sign.full_name sg bname; 
11998  316 
val (thy', thms') = app_att (thy, pre_name name thms); 
317 
val named_thms = post_name name thms'; 

3987  318 

13274  319 
val r as ref {space, thms_tab, index} = get_theorems_sg sg; 
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset

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

321 
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); 
13274  322 
val index' = FactIndex.add (K false) (index, (name, named_thms)); 
323 
in 

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

15531  325 
NONE => () 
326 
 SOME thms' => 

13274  327 
if Library.equal_lists Thm.eq_thm (thms', named_thms) then warn_same name 
328 
else warn_overwrite name); 

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

11998  330 
(thy', named_thms) 
331 
end; 

3987  332 

4853  333 

6091  334 
(* add_thms(s) *) 
4853  335 

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

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

337 
enter_thms (Theory.sign_of thy) pre_name (name_thms false) 
11998  338 
(Thm.applys_attributes o rpair atts) thy (bname, thms); 
4853  339 

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

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

341 
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); 
5907  342 

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

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

344 
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

345 

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

346 
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

347 
val add_thms = gen_add_thms (name_thms true); 
5907  348 

349 

14564  350 
(* note_thmss(_i) *) 
5907  351 

9192  352 
local 
12711  353 

14564  354 
fun gen_note_thss get kind_att (thy, ((bname, more_atts), ths_atts)) = 
12711  355 
let 
356 
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); 

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

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

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

361 

14564  362 
fun gen_note_thmss get kind_att args thy = 
363 
foldl_map (gen_note_thss get kind_att) (thy, args); 

12711  364 

9192  365 
in 
12711  366 

14564  367 
val note_thmss = gen_note_thmss get_thms; 
368 
val note_thmss_i = gen_note_thmss (K I); 

12711  369 

9192  370 
end; 
5280  371 

372 

6091  373 
(* store_thm *) 
5280  374 

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

376 
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
5280  377 
in (thy', th') end; 
3987  378 

379 

7405  380 
(* smart_store_thms *) 
3987  381 

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

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

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

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

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

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

387 
 gen_smart_store_thms name_thm (name, thms) = 
7405  388 
let 
389 
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); 

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

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

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

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

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

394 

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

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

396 
val smart_store_thms_open = gen_smart_store_thms (K (K I)); 
3987  397 

398 

7899  399 
(* forall_elim_vars (belongs to drule.ML) *) 
400 

13713  401 
(*Replace outermost quantified variable by Var of given index.*) 
7899  402 
fun forall_elim_var i th = 
403 
let val {prop,sign,...} = rep_thm th 

404 
in case prop of 

13713  405 
Const ("all", _) $ Abs (a, T, _) => 
406 
let val used = map (fst o fst) 

407 
(filter (equal i o snd o fst) (Term.add_vars ([], prop))) 

408 
in forall_elim (cterm_of sign (Var ((variant used a, i), T))) th end 

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

7899  410 
end; 
411 

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

413 
fun forall_elim_vars i th = 

414 
forall_elim_vars i (forall_elim_var i th) 

415 
handle THM _ => th; 

416 

417 

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

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

419 

4853  420 
local 
7899  421 
fun get_axs thy named_axs = 
422 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  423 

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

424 
fun add_single add (thy, ((name, ax), atts)) = 
4853  425 
let 
11998  426 
val named_ax = [(name, ax)]; 
7753  427 
val thy' = add named_ax thy; 
428 
val thm = hd (get_axs thy' named_ax); 

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

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

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

431 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  432 
let 
433 
val named_axs = name_multi name axs; 

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

436 
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

437 

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

438 
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

439 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  440 
in 
7753  441 
val add_axioms = add_singles Theory.add_axioms; 
442 
val add_axioms_i = add_singles Theory.add_axioms_i; 

443 
val add_axiomss = add_multis Theory.add_axioms; 

444 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  445 
val add_defs = add_singles o Theory.add_defs; 
446 
val add_defs_i = add_singles o Theory.add_defs_i; 

447 
val add_defss = add_multis o Theory.add_defs; 

448 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

450 

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

451 

3987  452 

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

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

454 

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

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

456 

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

458 

5005  459 
structure TheoryManagementDataArgs = 
460 
struct 

461 
val name = "Pure/theory_management"; 

6660  462 
type T = {name: string, version: int}; 
5000  463 

6660  464 
val empty = {name = "", version = 0}; 
6547  465 
val copy = I; 
5005  466 
val prep_ext = I; 
5000  467 
fun merge _ = empty; 
5005  468 
fun print _ _ = (); 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

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

470 

5005  471 
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); 
472 
val get_info = TheoryManagementData.get; 

473 
val put_info = TheoryManagementData.put; 

474 

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

475 

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

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

477 

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

480 

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

481 

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

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

483 

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

485 

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

486 
fun local_path thy = 
5210  487 
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

488 

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

489 

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

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

491 

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

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

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

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

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

496 

12123  497 
fun end_theory thy = 
498 
thy 

499 
> Theory.add_name (get_name thy); 

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

500 

6682  501 
fun checkpoint thy = 
502 
if is_draft thy then 

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

504 
thy 

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

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

507 
end 

508 
else thy; 

5000  509 

510 

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

511 

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

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

513 

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

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

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

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

517 

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

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

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

520 
else error ("Duplicate parameters in type declaration: " ^ quote raw_name); 
14854  521 
in thy > Theory.add_types (map type_of decls) end; 
4922
03b81b6e1baa
added thms_closure: theory > xstring > tthm list option;
wenzelm
parents:
4853
diff
changeset

522 

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

523 

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

524 

5091  525 
(*** the ProtoPure theory ***) 
3987  526 

14669  527 

528 
(*It might make sense to restrict the polymorphism of the constant "==" to 

529 
sort logic, instead of the universal sort, {}. Unfortunately, this change 

530 
causes HOL/Import/shuffler.ML to fail.*) 

531 

3987  532 
val proto_pure = 
533 
Theory.pre_pure 

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

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

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

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

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

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

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

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

542 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  543 
> Theory.add_syntax Syntax.pure_syntax 
6692  544 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  545 
> Theory.add_syntax 
7949  546 
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), 
9534  547 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  548 
> Theory.add_consts 
14854  549 
[("==", "['a, 'a] => prop", InfixrName ("==", 2)), 
3987  550 
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 
551 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 

10667  552 
("Goal", "prop => prop", NoSyn), 
6547  553 
("TYPE", "'a itself", NoSyn), 
9534  554 
(Term.dummy_patternN, "'a", Delimfix "'_")] 
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
13800
diff
changeset

555 
> Theory.add_finals_i false 
14854  556 
[Const("==", [TFree ("'a", []), TFree ("'a", [])] > propT), 
557 
Const("==>", [propT, propT] > propT), 

558 
Const("all", (TFree("'a", []) > propT) > propT), 

559 
Const("TYPE", a_itselfT)] 

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

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

561 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  562 
> Theory.add_trfuns Syntax.pure_trfuns 
563 
> Theory.add_trfunsT Syntax.pure_trfunsT 

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

564 
> local_path 
10667  565 
> (#1 oo (add_defs_i false o map Thm.no_attributes)) 
566 
[("Goal_def", let val A = Free ("A", propT) in Logic.mk_equals (Logic.mk_goal A, A) end)] 

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

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

569 
> end_theory; 
3987  570 

5091  571 
structure ProtoPure = 
572 
struct 

573 
val thy = proto_pure; 

574 
val Goal_def = get_axiom thy "Goal_def"; 

575 
end; 

3987  576 

577 

578 
end; 

579 

580 

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

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

582 
open BasicPureThy; 