author  wenzelm 
Tue, 31 May 2005 11:53:23 +0200  
changeset 16132  afd2d32c7d94 
parent 16023  66561f6814bd 
child 16336  e3892698c57d 
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 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

28 
val string_of_thmref: thmref > string 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

29 
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

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

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

33 
val selections: string * thm list > (thmref * thm) list 
16132  34 
val extern_thm_sg: Sign.sg > string > xstring 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

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

37 
val thms_containing: theory > FactIndex.spec > (string * thm list) list 
13646  38 
val thms_containing_consts: theory > string list > (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 

16132  48 
val note_thmss: theory attribute > ((bstring * theory attribute list) * 
49 
(thmref * theory attribute list) list) list > theory > theory * (bstring * thm list) list 

50 
val note_thmss_i: theory attribute > ((bstring * theory attribute list) * 

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, 

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

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

4853  93 
fun mk_empty _ = 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

94 
ref {space = NameSpace.empty, theorems = 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 

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

101 
fun pretty sg (ref {space, theorems, 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 

16132  108 
val thmss = NameSpace.extern_table space theorems; 
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 

16132  118 
val extern_thm_sg = NameSpace.extern o #space o ! o get_theorems_sg; 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

119 
val fact_index_of = #index o ! o get_theorems; 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

120 

6367  121 

3987  122 

5000  123 
(* print theory *) 
3987  124 

5005  125 
val print_theorems = TheoremsData.print; 
8720  126 

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

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

131 

3987  132 

133 

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

134 
(** retrieve theorems **) 
3987  135 

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

4037  138 

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

141 

15703  142 

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

143 
(* datatype interval *) 
15703  144 

145 
datatype interval = 

146 
FromTo of int * int  

147 
From of int  

148 
Single of int; 

149 

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

151 
 interval n (From i) = i upto n 

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

153 

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

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

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

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

157 

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

158 

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

159 
(* type thmref *) 
15703  160 

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

161 
type thmref = xstring * interval list option; 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

162 

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

163 
fun string_of_thmref (name, NONE) = name 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

164 
 string_of_thmref (name, SOME is) = 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

166 

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

167 

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

168 
(* select_thm *) 
15703  169 

170 
fun select_thm (_, NONE) thms = thms 

171 
 select_thm (name, SOME is) thms = 

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

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

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

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

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

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

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

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

179 
in map select (List.concat (map (interval n) is)) end; 
15703  180 

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

181 

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

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

183 

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

184 
fun selections (name, [thm]) = [((name, NONE), thm)] 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

185 
 selections (name, thms) = (1 upto length thms, thms) > ListPair.map (fn (i, thm) => 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

186 
((name, SOME [Single i]), thm)); 
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset

187 

9564  188 

9808  189 
(* get_thm(s)_closure  statically scoped versions *) 
9564  190 

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

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

192 

9564  193 
fun lookup_thms thy = 
194 
let 

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

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

196 
val ref {space, theorems, ...} = get_theorems thy; 
9564  197 
in 
198 
fn name => 

15570  199 
Option.map (map (Thm.transfer_sg (Sign.deref sg_ref))) (*semidynamic identity*) 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

200 
(Symtab.lookup (theorems, NameSpace.intern space name)) (*static content*) 
9564  201 
end; 
3987  202 

9564  203 
fun get_thms_closure thy = 
204 
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

205 
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

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

207 
end; 
9564  208 

9808  209 
fun get_thm_closure thy = 
210 
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

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

9564  213 

214 
(* get_thm etc. *) 

215 

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

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

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

219 

15570  220 
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

221 
fun get_thm thy (namei as (name, _)) = single_thm name (get_thms thy namei); 
4783  222 

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

223 

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

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

225 

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

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

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

228 
NONE => false 
16132  229 
 SOME ths' => Thm.eq_thms (ths, ths')); 
3987  230 

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

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

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

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

234 
FactIndex.find (fact_index_of thy) spec 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

235 
> List.filter (fn (name, ths) => valid_thms theory ((name, NONE), ths)) 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

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

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

238 

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

241 
> map (fn th => (Thm.name_of_thm th, th)); 
13646  242 

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

243 

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

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

245 

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

246 
fun thms_of thy = 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

247 
let val ref {theorems, ...} = get_theorems thy in 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

248 
map (fn th => (Thm.name_of_thm th, th)) (List.concat (map snd (Symtab.dest theorems))) 
15882
a191d2bee3e1
new thms_containing that searches for patterns instead of constants
kleing
parents:
15801
diff
changeset

249 
end; 
15703  250 

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

251 

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

252 

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

253 
(** store theorems **) (*DESTRUCTIVE*) 
3987  254 

12695  255 
(* hiding  affects current theory node only! *) 
256 

13424  257 
fun hide_thms fully names thy = 
12695  258 
let 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

259 
val r as ref {space, theorems, index} = get_theorems thy; 
16132  260 
val space' = fold (NameSpace.hide fully) names space; 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

261 
in r := {space = space', theorems = theorems, index = index}; thy end; 
12695  262 

263 

4853  264 
(* naming *) 
265 

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

4853  268 

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

270 

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

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

272 
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

273 

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

274 
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

275 
 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

276 

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

277 
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

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

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

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

282 

11998  283 
(* enter_thms *) 
4853  284 

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

285 
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

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

16132  288 
fun enter_thms _ _ _ app_att thy ("", thms) = app_att (thy, thms) 
289 
 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

290 
let 
16132  291 
val name = Sign.full_name sg bname; 
11998  292 
val (thy', thms') = app_att (thy, pre_name name thms); 
293 
val named_thms = post_name name thms'; 

3987  294 

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

295 
val r as ref {space, theorems, index} = get_theorems_sg sg; 
16132  296 
val space' = Sign.declare_name sg name space; 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

297 
val theorems' = Symtab.update ((name, named_thms), theorems); 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

298 
val index' = FactIndex.add (K false) (name, named_thms) index; 
13274  299 
in 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

300 
(case Symtab.lookup (theorems, name) of 
15531  301 
NONE => () 
302 
 SOME thms' => 

16132  303 
if Thm.eq_thms (thms', named_thms) then warn_same name 
13274  304 
else warn_overwrite name); 
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

305 
r := {space = space', theorems = theorems', index = index'}; 
11998  306 
(thy', named_thms) 
307 
end; 

3987  308 

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

309 

6091  310 
(* add_thms(s) *) 
4853  311 

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

312 
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

313 
enter_thms (Theory.sign_of thy) pre_name (name_thms false) 
11998  314 
(Thm.applys_attributes o rpair atts) thy (bname, thms); 
4853  315 

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

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

317 
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); 
5907  318 

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

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

320 
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

321 

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

322 
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

323 
val add_thms = gen_add_thms (name_thms true); 
5907  324 

325 

14564  326 
(* note_thmss(_i) *) 
5907  327 

9192  328 
local 
12711  329 

16132  330 
fun gen_note_thss get kind_att (thy, ((bname, more_atts), ths_atts)) = 
12711  331 
let 
332 
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); 

16132  333 
val (thy', thms) = enter_thms (Theory.sign_of thy) 
15570  334 
name_thmss (name_thms false) (apsnd List.concat o foldl_map app) thy 
12711  335 
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); 
336 
in (thy', (bname, thms)) end; 

337 

16132  338 
fun gen_note_thmss get kind_att args thy = 
339 
foldl_map (gen_note_thss get kind_att) (thy, args); 

12711  340 

9192  341 
in 
12711  342 

16132  343 
val note_thmss = gen_note_thmss get_thms; 
344 
val note_thmss_i = gen_note_thmss (K I); 

12711  345 

9192  346 
end; 
5280  347 

348 

6091  349 
(* store_thm *) 
5280  350 

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

352 
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy 
5280  353 
in (thy', th') end; 
3987  354 

355 

7405  356 
(* smart_store_thms *) 
3987  357 

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

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

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

360 
 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

361 
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

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

363 
 gen_smart_store_thms name_thm (name, thms) = 
7405  364 
let 
365 
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); 

15570  366 
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

367 
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

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

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

370 

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

371 
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

372 
val smart_store_thms_open = gen_smart_store_thms (K (K I)); 
3987  373 

374 

7899  375 
(* forall_elim_vars (belongs to drule.ML) *) 
376 

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

380 
in case prop of 

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

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

7899  386 
end; 
387 

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

389 
fun forall_elim_vars i th = 

390 
forall_elim_vars i (forall_elim_var i th) 

391 
handle THM _ => th; 

392 

393 

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

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

395 

4853  396 
local 
7899  397 
fun get_axs thy named_axs = 
398 
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; 

7753  399 

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

400 
fun add_single add (thy, ((name, ax), atts)) = 
4853  401 
let 
11998  402 
val named_ax = [(name, ax)]; 
7753  403 
val thy' = add named_ax thy; 
404 
val thm = hd (get_axs thy' named_ax); 

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

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

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

407 
fun add_multi add (thy, ((name, axs), atts)) = 
7753  408 
let 
409 
val named_axs = name_multi name axs; 

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

412 
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

413 

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

414 
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

415 
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); 
4853  416 
in 
7753  417 
val add_axioms = add_singles Theory.add_axioms; 
418 
val add_axioms_i = add_singles Theory.add_axioms_i; 

419 
val add_axiomss = add_multis Theory.add_axioms; 

420 
val add_axiomss_i = add_multis Theory.add_axioms_i; 

9318  421 
val add_defs = add_singles o Theory.add_defs; 
422 
val add_defs_i = add_singles o Theory.add_defs_i; 

423 
val add_defss = add_multis o Theory.add_defs; 

424 
val add_defss_i = add_multis o Theory.add_defs_i; 

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

426 

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

427 

3987  428 

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

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

430 

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

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

432 

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

434 

5005  435 
structure TheoryManagementDataArgs = 
436 
struct 

437 
val name = "Pure/theory_management"; 

6660  438 
type T = {name: string, version: int}; 
5000  439 

6660  440 
val empty = {name = "", version = 0}; 
6547  441 
val copy = I; 
5005  442 
val prep_ext = I; 
5000  443 
fun merge _ = empty; 
5005  444 
fun print _ _ = (); 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

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

446 

5005  447 
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); 
448 
val get_info = TheoryManagementData.get; 

449 
val put_info = TheoryManagementData.put; 

450 

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

451 

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

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

453 

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

456 

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

457 

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

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

459 

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

461 

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

462 
fun local_path thy = 
5210  463 
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

464 

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

465 

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

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

467 

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

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

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

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

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

472 

12123  473 
fun end_theory thy = 
474 
thy 

475 
> Theory.add_name (get_name thy); 

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

476 

6682  477 
fun checkpoint thy = 
478 
if is_draft thy then 

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

480 
thy 

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

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

483 
end 

484 
else thy; 

5000  485 

486 

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

487 

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

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

489 

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

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

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

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

493 

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

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

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

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

498 

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

499 

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

500 

5091  501 
(*** the ProtoPure theory ***) 
3987  502 

503 
val proto_pure = 

504 
Theory.pre_pure 

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

505 
> TheoryManagementData.init > put_name "ProtoPure" 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

506 
> TheoremsData.init 
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset

507 
> Proofterm.init 
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset

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

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

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

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

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

514 
> Theory.add_nonterminals Syntax.pure_nonterms 
3987  515 
> Theory.add_syntax Syntax.pure_syntax 
15801  516 
> Theory.add_syntax Syntax.pure_appl_syntax 
6692  517 
> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax 
3987  518 
> Theory.add_syntax 
7949  519 
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), 
9534  520 
(Term.dummy_patternN, "aprop", Delimfix "'_")] 
3987  521 
> Theory.add_consts 
14854  522 
[("==", "['a, 'a] => prop", InfixrName ("==", 2)), 
3987  523 
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), 
524 
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), 

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

528 
> Theory.add_finals_i false 
14854  529 
[Const("==", [TFree ("'a", []), TFree ("'a", [])] > propT), 
530 
Const("==>", [propT, propT] > propT), 

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

532 
Const("TYPE", a_itselfT)] 

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

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

534 
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) 
12250  535 
> Theory.add_trfuns Syntax.pure_trfuns 
536 
> Theory.add_trfunsT Syntax.pure_trfunsT 

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

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

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

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

542 
> end_theory; 
3987  543 

5091  544 
structure ProtoPure = 
545 
struct 

546 
val thy = proto_pure; 

547 
val Goal_def = get_axiom thy "Goal_def"; 

548 
end; 

3987  549 

550 
end; 

551 

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

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

553 
open BasicPureThy; 