author  wenzelm 
Wed, 13 Apr 2005 18:34:22 +0200  
changeset 15703  727ef1b8b3ee 
parent 15696  1da4ce092c0b 
child 15715  dfa913c68f9d 
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 
15703  27 
datatype interval = FromTo of int * int  From of int  Single of int 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

28 
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

29 
val get_thms_closure: theory > thmref > thm list 
9564  30 
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

31 
val select_thm: thmref > thm list > thm list 
6367  32 
val cond_extern_thm_sg: Sign.sg > string > xstring 
13274  33 
val thms_containing: theory > string list * string list > (string * thm list) list 
13646  34 
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

35 
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

36 
> theory > term > (string * thm) list 
13646  37 
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

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

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

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

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

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

49 
val note_thmss: 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

50 
theory attribute > ((bstring * theory attribute list) * 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

51 
(thmref * theory attribute list) list) list > theory > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

52 
theory * (bstring * thm list) list 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

53 
val note_thmss_i: 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

54 
theory attribute > ((bstring * theory attribute list) * 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

55 
(thm list * theory attribute list) list) list > theory > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

56 
theory * (bstring * thm list) list 
15696  57 
val note_thmss_accesses: 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

58 
(string > string list) > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

59 
theory attribute > ((bstring * theory attribute list) * 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

60 
(thmref * theory attribute list) list) list > theory > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

61 
theory * (bstring * thm list) list 
15696  62 
val note_thmss_accesses_i: 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

63 
(string > string list) > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

64 
theory attribute > ((bstring * theory attribute list) * 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

65 
(thm list * theory attribute list) list) list > theory > 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

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

67 
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

68 
val add_axioms_i: ((bstring * term) * theory attribute list) list > theory > theory * thm list 
12711  69 
val add_axiomss: ((bstring * string list) * theory attribute list) list > theory 
70 
> theory * thm list list 

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

72 
> theory * thm list list 

9318  73 
val add_defs: bool > ((bstring * string) * theory attribute list) list 
74 
> theory > theory * thm list 

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

76 
> theory > theory * thm list 

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

78 
> theory > theory * thm list list 

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

80 
> theory > theory * thm list list 

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

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

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

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

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

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

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

88 
val add_typedecls: (bstring * string list * mixfix) list > theory > theory 
3987  89 
end; 
90 

91 
structure PureThy: PURE_THY = 

92 
struct 

93 

94 

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

95 
(*** theorem database ***) 
3987  96 

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

97 
(** data kind 'Pure/theorems' **) 
3987  98 

5005  99 
structure TheoremsDataArgs = 
100 
struct 

101 
val name = "Pure/theorems"; 

3987  102 

5005  103 
type T = 
104 
{space: NameSpace.T, 

6091  105 
thms_tab: thm list Symtab.table, 
13274  106 
index: FactIndex.T} ref; 
3987  107 

4853  108 
fun mk_empty _ = 
13274  109 
ref {space = NameSpace.empty, thms_tab = Symtab.empty, index = FactIndex.empty}: T; 
3987  110 

5005  111 
val empty = mk_empty (); 
6547  112 
fun copy (ref x) = ref x; 
5005  113 
val prep_ext = mk_empty; 
114 
val merge = mk_empty; 

115 

13274  116 
fun pretty sg (ref {space, thms_tab, index = _}) = 
4853  117 
let 
10008  118 
val prt_thm = Display.pretty_thm_sg sg; 
4853  119 
fun prt_thms (name, [th]) = 
120 
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] 

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

3987  122 

6846  123 
val thmss = NameSpace.cond_extern_table space thms_tab; 
9215  124 
in Pretty.big_list "theorems:" (map prt_thms thmss) end; 
8720  125 

9215  126 
fun print sg data = Pretty.writeln (pretty sg data); 
3987  127 
end; 
128 

5005  129 
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); 
130 
val get_theorems_sg = TheoremsData.get_sg; 

131 
val get_theorems = TheoremsData.get; 

132 

6367  133 
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; 
134 

3987  135 

5000  136 
(* print theory *) 
3987  137 

5005  138 
val print_theorems = TheoremsData.print; 
8720  139 

5000  140 
fun print_theory thy = 
9215  141 
Display.pretty_full_theory thy @ 
142 
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] 

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

144 

3987  145 

146 

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

147 
(** retrieve theorems **) 
3987  148 

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

4037  151 

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

154 

15703  155 

156 
(* selections *) 

157 

158 
datatype interval = 

159 
FromTo of int * int  

160 
From of int  

161 
Single of int; 

162 

163 
type thmref = xstring * interval list option; 

164 

165 
local 

166 

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

168 
 interval n (From i) = i upto n 

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

170 

171 
fun select name thms n i = 

172 
if i < 1 orelse i > n then 

173 
error ("Bad subscript " ^ string_of_int i ^ " for " ^ 

174 
quote name ^ " (length " ^ string_of_int n ^ ")") 

175 
else List.nth (thms, i  1); 

176 

177 
in 

178 

179 
fun select_thm (_, NONE) thms = thms 

180 
 select_thm (name, SOME is) thms = 

181 
let val n = length thms 

182 
in map (select name thms n) (List.concat (map (interval n) is)) end; 

183 

184 
end; 

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

185 

9564  186 

9808  187 
(* get_thm(s)_closure  statically scoped versions *) 
9564  188 

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

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

190 

9564  191 
fun lookup_thms thy = 
192 
let 

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

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

195 
in 

196 
fn name => 

15570  197 
Option.map (map (Thm.transfer_sg (Sign.deref sg_ref))) (*semidynamic identity*) 
9564  198 
(Symtab.lookup (thms_tab, NameSpace.intern space name)) (*static content*) 
199 
end; 

3987  200 

9564  201 
fun get_thms_closure thy = 
202 
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

203 
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

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

205 
end; 
9564  206 

9808  207 
fun get_thm_closure thy = 
208 
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

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

9564  211 

212 
(* get_thm etc. *) 

213 

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

214 
fun get_thms theory (namei as (name, _)) = 
9564  215 
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

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

217 

15570  218 
fun get_thmss thy names = List.concat (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

219 
fun get_thm thy (namei as (name, _)) = single_thm name (get_thms thy namei); 
4783  220 

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

221 

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

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

223 

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

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

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

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

228 

3987  229 

13274  230 
(* thms_containing *) 
3987  231 

13274  232 
fun thms_containing thy idx = 
233 
let 

234 
fun valid (name, ths) = 

15531  235 
(case try (transform_error (get_thms thy)) (name, NONE) of 
236 
NONE => false 

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

13274  238 
in 
239 
(thy :: Theory.ancestors_of thy) 

15570  240 
> map (gen_distinct eq_fst o List.filter valid o FactIndex.find idx o #index o ! o get_theorems) 
241 
> List.concat 

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

243 

13646  244 
fun thms_containing_consts thy consts = 
15570  245 
thms_containing thy (consts, []) > map #2 > List.concat 
13646  246 
> map (fn th => (Thm.name_of_thm th, th)) 
247 

15703  248 

13646  249 
(* intro/elim theorems *) 
250 

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

252 
(* elim: given a theorem thm, 

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

254 

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

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

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

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

259 
 rem_top _ = Bound 0 (* does not match anything *) 
13646  260 

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

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

263 
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

264 
fun select_match(c,obj, signobj, named_thms, (extract_thms,extract_term)) = 
13646  265 
let val tsig = Sign.tsig_of signobj 
266 
fun matches prop = 

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

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

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

269 
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

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

271 
end 
13646  272 

273 
fun substsize prop = 

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

274 
let val pat = extract_term prop 
13646  275 
val (_,subst) = Pattern.match tsig (pat,obj) 
15570  276 
in Library.foldl op+ (0, map (size_of_term o snd) subst) end 
13646  277 

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

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

280 

281 
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

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

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

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

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

286 
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

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

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

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

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

291 
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

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

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

294 
end 
13646  295 
 select([],sels) = sels 
296 

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

298 

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

299 
fun find_matching_thms extract thy prop = 
15531  300 
(case top_const prop of NONE => [] 
301 
 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

302 
in select_match(c,prop,Theory.sign_of thy,thms,extract) end) 
13646  303 

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

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

305 
find_matching_thms (single, rem_top o Logic.strip_imp_concl) 
13646  306 

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

307 
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

308 
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

309 

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

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

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

312 
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

313 

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

314 

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

315 
(** store theorems **) (*DESTRUCTIVE*) 
3987  316 

12695  317 
(* hiding  affects current theory node only! *) 
318 

13424  319 
fun hide_thms fully names thy = 
12695  320 
let 
13274  321 
val r as ref {space, thms_tab, index} = get_theorems thy; 
13424  322 
val space' = NameSpace.hide fully (space, names); 
13274  323 
in r := {space = space', thms_tab = thms_tab, index = index}; thy end; 
12695  324 

325 

4853  326 
(* naming *) 
327 

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

4853  330 

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

332 

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

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

334 
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

335 

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

336 
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

337 
 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

338 

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

339 
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

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

341 
 _ => 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

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

344 

11998  345 
(* enter_thms *) 
4853  346 

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

347 
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

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

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

350 
fun gen_enter_thms _ _ _ _ _ app_att thy ("", thms) = app_att (thy, thms) 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

351 
 gen_enter_thms full acc 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

352 
let 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

353 
val name = full sg bname; 
11998  354 
val (thy', thms') = app_att (thy, pre_name name thms); 
355 
val named_thms = post_name name thms'; 

3987  356 

13274  357 
val r as ref {space, thms_tab, index} = get_theorems_sg sg; 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

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

359 
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); 
13274  360 
val index' = FactIndex.add (K false) (index, (name, named_thms)); 
361 
in 

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

15531  363 
NONE => () 
364 
 SOME thms' => 

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

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

11998  368 
(thy', named_thms) 
369 
end; 

3987  370 

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

371 
fun enter_thms sg = gen_enter_thms Sign.full_name NameSpace.accesses sg; 
4853  372 

6091  373 
(* add_thms(s) *) 
4853  374 

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

375 
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

376 
enter_thms (Theory.sign_of thy) pre_name (name_thms false) 
11998  377 
(Thm.applys_attributes o rpair atts) thy (bname, thms); 
4853  378 

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

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

380 
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); 
5907  381 

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

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

383 
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

384 

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

385 
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

386 
val add_thms = gen_add_thms (name_thms true); 
5907  387 

388 

14564  389 
(* note_thmss(_i) *) 
5907  390 

9192  391 
local 
12711  392 

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

393 
fun gen_note_thss enter get kind_att (thy, ((bname, more_atts), ths_atts)) = 
12711  394 
let 
395 
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); 

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

396 
val (thy', thms) = enter (Theory.sign_of thy) 
15570  397 
name_thmss (name_thms false) (apsnd List.concat o foldl_map app) thy 
12711  398 
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); 
399 
in (thy', (bname, thms)) end; 

400 

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

401 
fun gen_note_thmss enter get kind_att args thy = 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

402 
foldl_map (gen_note_thss enter get kind_att) (thy, args); 
12711  403 

9192  404 
in 
12711  405 

15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

406 
(* if path is set, only permit unqualified names *) 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

407 

484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

408 
val note_thmss = gen_note_thmss enter_thms get_thms; 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

409 
val note_thmss_i = gen_note_thmss enter_thms (K I); 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

410 

484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

411 
(* always permit qualified names, 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

412 
clients may specify nonstandard access policy *) 
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

413 

15696  414 
fun note_thmss_accesses acc = 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

415 
gen_note_thmss (gen_enter_thms Sign.full_name' acc) get_thms; 
15696  416 
fun note_thmss_accesses_i acc = 
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset

417 
gen_note_thmss (gen_enter_thms Sign.full_name' acc) (K I); 
12711  418 

9192  419 
end; 
5280  420 

421 

6091  422 
(* store_thm *) 
5280  423 

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

425 
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
5280  426 
in (thy', th') end; 
3987  427 

428 

7405  429 
(* smart_store_thms *) 
3987  430 

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

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

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

433 
 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

434 
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

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

436 
 gen_smart_store_thms name_thm (name, thms) = 
7405  437 
let 
438 
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); 

15570  439 
val sg_ref = Library.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

440 
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

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

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

443 

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

444 
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

445 
val smart_store_thms_open = gen_smart_store_thms (K (K I)); 
3987  446 

447 

7899  448 
(* forall_elim_vars (belongs to drule.ML) *) 
449 

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

453 
in case prop of 

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

15570  456 
(List.filter (equal i o snd o fst) (Term.add_vars ([], prop))) 
13713  457 
in forall_elim (cterm_of sign (Var ((variant used a, i), T))) th end 
458 
 _ => raise THM ("forall_elim_var", i, [th]) 

7899  459 
end; 
460 

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

462 
fun forall_elim_vars i th = 

463 
forall_elim_vars i (forall_elim_var i th) 

464 
handle THM _ => th; 

465 

466 

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

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

468 

4853  469 
local 
7899  470 
fun get_axs thy named_axs = 
471 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  472 

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

473 
fun add_single add (thy, ((name, ax), atts)) = 
4853  474 
let 
11998  475 
val named_ax = [(name, ax)]; 
7753  476 
val thy' = add named_ax thy; 
477 
val thm = hd (get_axs thy' named_ax); 

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

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

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

480 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  481 
let 
482 
val named_axs = name_multi name axs; 

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

485 
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

486 

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

487 
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

488 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  489 
in 
7753  490 
val add_axioms = add_singles Theory.add_axioms; 
491 
val add_axioms_i = add_singles Theory.add_axioms_i; 

492 
val add_axiomss = add_multis Theory.add_axioms; 

493 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  494 
val add_defs = add_singles o Theory.add_defs; 
495 
val add_defs_i = add_singles o Theory.add_defs_i; 

496 
val add_defss = add_multis o Theory.add_defs; 

497 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

499 

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

500 

3987  501 

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

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

503 

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

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

505 

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

507 

5005  508 
structure TheoryManagementDataArgs = 
509 
struct 

510 
val name = "Pure/theory_management"; 

6660  511 
type T = {name: string, version: int}; 
5000  512 

6660  513 
val empty = {name = "", version = 0}; 
6547  514 
val copy = I; 
5005  515 
val prep_ext = I; 
5000  516 
fun merge _ = empty; 
5005  517 
fun print _ _ = (); 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

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

519 

5005  520 
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); 
521 
val get_info = TheoryManagementData.get; 

522 
val put_info = TheoryManagementData.put; 

523 

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

524 

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

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

526 

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

529 

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

530 

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

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

532 

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

534 

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

535 
fun local_path thy = 
5210  536 
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

537 

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

538 

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

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

540 

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

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

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

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

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

545 

12123  546 
fun end_theory thy = 
547 
thy 

548 
> Theory.add_name (get_name thy); 

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

549 

6682  550 
fun checkpoint thy = 
551 
if is_draft thy then 

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

553 
thy 

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

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

556 
end 

557 
else thy; 

5000  558 

559 

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

560 

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

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

562 

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

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

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

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

566 

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

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

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

569 
else error ("Duplicate parameters in type declaration: " ^ quote raw_name); 
14854  570 
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

571 

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

572 

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

573 

5091  574 
(*** the ProtoPure theory ***) 
3987  575 

14669  576 

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

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

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

580 

3987  581 
val proto_pure = 
582 
Theory.pre_pure 

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

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

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

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

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

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

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

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

591 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  592 
> Theory.add_syntax Syntax.pure_syntax 
6692  593 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  594 
> Theory.add_syntax 
7949  595 
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), 
9534  596 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  597 
> Theory.add_consts 
14854  598 
[("==", "['a, 'a] => prop", InfixrName ("==", 2)), 
3987  599 
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 
600 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 

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

604 
> Theory.add_finals_i false 
14854  605 
[Const("==", [TFree ("'a", []), TFree ("'a", [])] > propT), 
606 
Const("==>", [propT, propT] > propT), 

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

608 
Const("TYPE", a_itselfT)] 

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

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

610 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  611 
> Theory.add_trfuns Syntax.pure_trfuns 
612 
> Theory.add_trfunsT Syntax.pure_trfunsT 

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

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

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

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

618 
> end_theory; 
3987  619 

5091  620 
structure ProtoPure = 
621 
struct 

622 
val thy = proto_pure; 

623 
val Goal_def = get_axiom thy "Goal_def"; 

624 
end; 

3987  625 

626 

627 
end; 

628 

629 

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

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

631 
open BasicPureThy; 