wenzelm@3987
|
1 |
(* Title: Pure/pure_thy.ML
|
wenzelm@3987
|
2 |
ID: $Id$
|
wenzelm@3987
|
3 |
Author: Markus Wenzel, TU Muenchen
|
wenzelm@3987
|
4 |
|
wenzelm@26430
|
5 |
Theorem storage. Pure theory syntax and logical content.
|
wenzelm@3987
|
6 |
*)
|
wenzelm@3987
|
7 |
|
wenzelm@3987
|
8 |
signature PURE_THY =
|
wenzelm@3987
|
9 |
sig
|
wenzelm@27198
|
10 |
val facts_of: theory -> Facts.T
|
wenzelm@26666
|
11 |
val intern_fact: theory -> xstring -> string
|
wenzelm@26693
|
12 |
val defined_fact: theory -> string -> bool
|
wenzelm@27198
|
13 |
val hide_fact: bool -> string -> theory -> theory
|
wenzelm@28841
|
14 |
val force_proofs: theory -> unit
|
wenzelm@26683
|
15 |
val get_fact: Context.generic -> theory -> Facts.ref -> thm list
|
wenzelm@26344
|
16 |
val get_thms: theory -> xstring -> thm list
|
wenzelm@26344
|
17 |
val get_thm: theory -> xstring -> thm
|
wenzelm@16336
|
18 |
val all_thms_of: theory -> (string * thm) list
|
wenzelm@21580
|
19 |
val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
|
wenzelm@21567
|
20 |
val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
|
wenzelm@21580
|
21 |
val burrow_facts: ('a list -> 'b list) ->
|
wenzelm@21580
|
22 |
('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
|
wenzelm@21580
|
23 |
val name_multi: string -> 'a list -> (string * 'a) list
|
wenzelm@28076
|
24 |
val name_thm: bool -> bool -> Position.T -> string -> thm -> thm
|
wenzelm@28076
|
25 |
val name_thms: bool -> bool -> Position.T -> string -> thm list -> thm list
|
wenzelm@28076
|
26 |
val name_thmss: bool -> Position.T -> string -> (thm list * 'a) list -> (thm list * 'a) list
|
wenzelm@26488
|
27 |
val store_thms: bstring * thm list -> theory -> thm list * theory
|
wenzelm@26488
|
28 |
val store_thm: bstring * thm -> theory -> thm * theory
|
wenzelm@26488
|
29 |
val store_thm_open: bstring * thm -> theory -> thm * theory
|
haftmann@27691
|
30 |
val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
|
haftmann@27683
|
31 |
val add_thm: (bstring * thm) * attribute list -> theory -> thm * theory
|
wenzelm@24965
|
32 |
val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory
|
wenzelm@26488
|
33 |
val add_thms_dynamic: bstring * (Context.generic -> thm list) -> theory -> theory
|
wenzelm@28076
|
34 |
val note_thmss: string -> ((Name.binding * attribute list) *
|
wenzelm@28076
|
35 |
(thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
|
wenzelm@28076
|
36 |
val note_thmss_grouped: string -> string -> ((Name.binding * attribute list) *
|
wenzelm@28076
|
37 |
(thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
|
haftmann@27691
|
38 |
val add_axioms: ((bstring * term) * attribute list) list -> theory -> thm list * theory
|
haftmann@27691
|
39 |
val add_axioms_cmd: ((bstring * string) * attribute list) list -> theory -> thm list * theory
|
haftmann@27691
|
40 |
val add_defs: bool -> ((bstring * term) * attribute list) list ->
|
haftmann@18377
|
41 |
theory -> thm list * theory
|
haftmann@27691
|
42 |
val add_defs_unchecked: bool -> ((bstring * term) * attribute list) list ->
|
haftmann@18377
|
43 |
theory -> thm list * theory
|
haftmann@27691
|
44 |
val add_defs_unchecked_cmd: bool -> ((bstring * string) * attribute list) list ->
|
wenzelm@19629
|
45 |
theory -> thm list * theory
|
haftmann@27691
|
46 |
val add_defs_cmd: bool -> ((bstring * string) * attribute list) list ->
|
wenzelm@19629
|
47 |
theory -> thm list * theory
|
wenzelm@26959
|
48 |
val old_appl_syntax: theory -> bool
|
wenzelm@26959
|
49 |
val old_appl_syntax_setup: theory -> theory
|
wenzelm@3987
|
50 |
end;
|
wenzelm@3987
|
51 |
|
wenzelm@3987
|
52 |
structure PureThy: PURE_THY =
|
wenzelm@3987
|
53 |
struct
|
wenzelm@3987
|
54 |
|
wenzelm@3987
|
55 |
|
wenzelm@27198
|
56 |
(*** stored facts ***)
|
wenzelm@3987
|
57 |
|
wenzelm@27198
|
58 |
(** theory data **)
|
wenzelm@3987
|
59 |
|
wenzelm@27198
|
60 |
structure FactsData = TheoryDataFun
|
wenzelm@24713
|
61 |
(
|
wenzelm@28841
|
62 |
type T = Facts.T * unit Lazy.T list;
|
wenzelm@28841
|
63 |
val empty = (Facts.empty, []);
|
wenzelm@26488
|
64 |
val copy = I;
|
wenzelm@28841
|
65 |
fun extend (facts, _) = (facts, []);
|
wenzelm@28841
|
66 |
fun merge _ ((facts1, _), (facts2, _)) = (Facts.merge (facts1, facts2), []);
|
wenzelm@24713
|
67 |
);
|
wenzelm@5005
|
68 |
|
wenzelm@28841
|
69 |
|
wenzelm@28841
|
70 |
(* facts *)
|
wenzelm@28841
|
71 |
|
wenzelm@28841
|
72 |
val facts_of = #1 o FactsData.get;
|
wenzelm@26666
|
73 |
|
wenzelm@26666
|
74 |
val intern_fact = Facts.intern o facts_of;
|
wenzelm@26693
|
75 |
val defined_fact = Facts.defined o facts_of;
|
wenzelm@16023
|
76 |
|
wenzelm@28841
|
77 |
fun hide_fact fully name = FactsData.map (apfst (Facts.hide fully name));
|
wenzelm@28841
|
78 |
|
wenzelm@28841
|
79 |
|
wenzelm@28841
|
80 |
(* proofs *)
|
wenzelm@28841
|
81 |
|
wenzelm@28841
|
82 |
fun lazy_proof thm = Lazy.lazy (fn () => Thm.force_proof thm);
|
wenzelm@28841
|
83 |
val force_proofs = List.app Lazy.force o #2 o FactsData.get;
|
wenzelm@27198
|
84 |
|
wenzelm@6367
|
85 |
|
wenzelm@4022
|
86 |
|
wenzelm@4022
|
87 |
(** retrieve theorems **)
|
wenzelm@4022
|
88 |
|
wenzelm@27198
|
89 |
fun get_fact context thy xthmref =
|
wenzelm@26683
|
90 |
let
|
wenzelm@26683
|
91 |
val xname = Facts.name_of_ref xthmref;
|
wenzelm@26683
|
92 |
val pos = Facts.pos_of_ref xthmref;
|
wenzelm@27198
|
93 |
|
wenzelm@27198
|
94 |
val name = intern_fact thy xname;
|
wenzelm@27198
|
95 |
val res = Facts.lookup context (facts_of thy) name;
|
wenzelm@27198
|
96 |
val _ = Theory.check_thy thy;
|
wenzelm@26683
|
97 |
in
|
wenzelm@27198
|
98 |
(case res of
|
wenzelm@27198
|
99 |
NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
|
wenzelm@27739
|
100 |
| SOME (static, ths) =>
|
wenzelm@27739
|
101 |
(Position.report ((if static then Markup.fact else Markup.dynamic_fact) name) pos;
|
wenzelm@27739
|
102 |
Facts.select xthmref (map (Thm.transfer thy) ths)))
|
wenzelm@26683
|
103 |
end;
|
wenzelm@26344
|
104 |
|
wenzelm@26683
|
105 |
fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
|
wenzelm@26344
|
106 |
fun get_thm thy name = Facts.the_single name (get_thms thy name);
|
wenzelm@4783
|
107 |
|
wenzelm@27198
|
108 |
fun all_thms_of thy =
|
wenzelm@27865
|
109 |
Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
|
wenzelm@16336
|
110 |
|
wenzelm@4022
|
111 |
|
wenzelm@4022
|
112 |
|
wenzelm@26488
|
113 |
(** store theorems **)
|
wenzelm@3987
|
114 |
|
wenzelm@21580
|
115 |
(* fact specifications *)
|
wenzelm@21580
|
116 |
|
wenzelm@21580
|
117 |
fun map_facts f = map (apsnd (map (apfst (map f))));
|
wenzelm@21580
|
118 |
fun burrow_fact f = split_list #>> burrow f #> op ~~;
|
wenzelm@21580
|
119 |
fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
|
wenzelm@21580
|
120 |
|
wenzelm@21580
|
121 |
|
wenzelm@4853
|
122 |
(* naming *)
|
wenzelm@4853
|
123 |
|
wenzelm@18801
|
124 |
fun name_multi name [x] = [(name, x)]
|
wenzelm@26457
|
125 |
| name_multi "" xs = map (pair "") xs
|
wenzelm@26457
|
126 |
| name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
|
berghofe@12235
|
127 |
|
wenzelm@28076
|
128 |
fun name_thm pre official pos name thm = thm
|
wenzelm@21646
|
129 |
|> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
|
wenzelm@27865
|
130 |
|> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name)
|
wenzelm@28076
|
131 |
|> Thm.default_position pos
|
wenzelm@27865
|
132 |
|> Thm.default_position (Position.thread_data ());
|
berghofe@12872
|
133 |
|
wenzelm@28076
|
134 |
fun name_thms pre official pos name xs =
|
wenzelm@28076
|
135 |
map (uncurry (name_thm pre official pos)) (name_multi name xs);
|
berghofe@12235
|
136 |
|
wenzelm@28076
|
137 |
fun name_thmss official pos name fact =
|
wenzelm@28076
|
138 |
burrow_fact (name_thms true official pos name) fact;
|
wenzelm@4853
|
139 |
|
wenzelm@4853
|
140 |
|
berghofe@11998
|
141 |
(* enter_thms *)
|
wenzelm@4853
|
142 |
|
wenzelm@28841
|
143 |
fun enter_proofs (thy, thms) =
|
wenzelm@28841
|
144 |
(FactsData.map (apsnd (fold (cons o lazy_proof) thms)) thy, thms);
|
wenzelm@28841
|
145 |
|
haftmann@28861
|
146 |
fun enter_thms pre_name post_name app_att (b, thms) thy =
|
haftmann@28861
|
147 |
if Name.is_nothing b
|
haftmann@28861
|
148 |
then swap (enter_proofs (app_att (thy, thms)))
|
haftmann@28861
|
149 |
else let
|
haftmann@28861
|
150 |
val naming = Sign.naming_of thy;
|
haftmann@28861
|
151 |
val name = NameSpace.full_binding naming b;
|
haftmann@28861
|
152 |
val (thy', thms') =
|
haftmann@28861
|
153 |
enter_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
|
haftmann@28861
|
154 |
val thms'' = map (Thm.transfer thy') thms';
|
haftmann@28864
|
155 |
val thy'' = thy' |> (FactsData.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
|
haftmann@28861
|
156 |
in (thms'', thy'') end;
|
wenzelm@5933
|
157 |
|
wenzelm@26488
|
158 |
|
wenzelm@26488
|
159 |
(* store_thm(s) *)
|
wenzelm@26488
|
160 |
|
haftmann@28861
|
161 |
fun store_thms (bname, thms) = enter_thms (name_thms true true Position.none)
|
haftmann@28861
|
162 |
(name_thms false true Position.none) I (Name.binding bname, thms);
|
wenzelm@28076
|
163 |
|
haftmann@28861
|
164 |
fun store_thm (bname, th) = store_thms (bname, [th]) #>> the_single;
|
wenzelm@26488
|
165 |
|
haftmann@28861
|
166 |
fun store_thm_open (bname, th) =
|
wenzelm@28076
|
167 |
enter_thms (name_thms true false Position.none) (name_thms false false Position.none) I
|
haftmann@28861
|
168 |
(Name.binding bname, [th]) #>> the_single;
|
wenzelm@3987
|
169 |
|
wenzelm@16023
|
170 |
|
wenzelm@6091
|
171 |
(* add_thms(s) *)
|
wenzelm@3987
|
172 |
|
wenzelm@16441
|
173 |
fun add_thms_atts pre_name ((bname, thms), atts) =
|
wenzelm@28076
|
174 |
enter_thms pre_name (name_thms false true Position.none)
|
haftmann@28861
|
175 |
(foldl_map (Thm.theory_attributes atts)) (Name.binding bname, thms);
|
wenzelm@3987
|
176 |
|
haftmann@18377
|
177 |
fun gen_add_thmss pre_name =
|
haftmann@18377
|
178 |
fold_map (add_thms_atts pre_name);
|
wenzelm@5907
|
179 |
|
berghofe@12235
|
180 |
fun gen_add_thms pre_name args =
|
haftmann@18377
|
181 |
apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
|
berghofe@12235
|
182 |
|
wenzelm@28076
|
183 |
val add_thmss = gen_add_thmss (name_thms true true Position.none);
|
wenzelm@28076
|
184 |
val add_thms = gen_add_thms (name_thms true true Position.none);
|
haftmann@27683
|
185 |
val add_thm = yield_singleton add_thms;
|
wenzelm@5907
|
186 |
|
wenzelm@5907
|
187 |
|
wenzelm@26488
|
188 |
(* add_thms_dynamic *)
|
wenzelm@26488
|
189 |
|
haftmann@28864
|
190 |
fun add_thms_dynamic (bname, f) thy = thy
|
haftmann@28864
|
191 |
|> (FactsData.map o apfst)
|
haftmann@28864
|
192 |
(Facts.add_dynamic (Sign.naming_of thy) (Name.binding bname, f) #> snd);
|
wenzelm@26488
|
193 |
|
wenzelm@26488
|
194 |
|
wenzelm@27728
|
195 |
(* note_thmss *)
|
wenzelm@5907
|
196 |
|
wenzelm@9192
|
197 |
local
|
wenzelm@12711
|
198 |
|
haftmann@28861
|
199 |
fun gen_note_thmss tag = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
|
wenzelm@12711
|
200 |
let
|
haftmann@28861
|
201 |
val pos = Name.pos_of b;
|
haftmann@28861
|
202 |
val name = Sign.full_binding thy b;
|
wenzelm@28076
|
203 |
val _ = Position.report (Markup.fact_decl name) pos;
|
wenzelm@28076
|
204 |
|
wenzelm@18728
|
205 |
fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
|
haftmann@18418
|
206 |
val (thms, thy') = thy |> enter_thms
|
wenzelm@28076
|
207 |
(name_thmss true pos) (name_thms false true pos) (apsnd flat o foldl_map app)
|
haftmann@28861
|
208 |
(b, map (fn (ths, atts) => (ths, surround tag (atts @ more_atts))) ths_atts);
|
wenzelm@28076
|
209 |
in ((name, thms), thy') end);
|
wenzelm@12711
|
210 |
|
wenzelm@9192
|
211 |
in
|
wenzelm@12711
|
212 |
|
wenzelm@27865
|
213 |
fun note_thmss k = gen_note_thmss (Thm.kind k);
|
wenzelm@27865
|
214 |
fun note_thmss_grouped k g = gen_note_thmss (Thm.kind k #> Thm.group g);
|
wenzelm@12711
|
215 |
|
wenzelm@21438
|
216 |
end;
|
wenzelm@21438
|
217 |
|
wenzelm@5280
|
218 |
|
wenzelm@4022
|
219 |
(* store axioms as theorems *)
|
wenzelm@4022
|
220 |
|
wenzelm@4853
|
221 |
local
|
wenzelm@28674
|
222 |
fun get_ax thy (name, _) = Thm.axiom thy (Sign.full_name thy name);
|
wenzelm@26655
|
223 |
fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
|
wenzelm@26553
|
224 |
fun add_axm add = fold_map (fn ((name, ax), atts) => fn thy =>
|
wenzelm@4853
|
225 |
let
|
berghofe@11998
|
226 |
val named_ax = [(name, ax)];
|
wenzelm@7753
|
227 |
val thy' = add named_ax thy;
|
wenzelm@7753
|
228 |
val thm = hd (get_axs thy' named_ax);
|
wenzelm@26553
|
229 |
in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end);
|
wenzelm@4853
|
230 |
in
|
haftmann@27691
|
231 |
val add_defs = add_axm o Theory.add_defs_i false;
|
haftmann@27691
|
232 |
val add_defs_unchecked = add_axm o Theory.add_defs_i true;
|
haftmann@27691
|
233 |
val add_axioms = add_axm Theory.add_axioms_i;
|
haftmann@27691
|
234 |
val add_defs_cmd = add_axm o Theory.add_defs false;
|
haftmann@27691
|
235 |
val add_defs_unchecked_cmd = add_axm o Theory.add_defs true;
|
haftmann@27691
|
236 |
val add_axioms_cmd = add_axm Theory.add_axioms;
|
wenzelm@4853
|
237 |
end;
|
wenzelm@4022
|
238 |
|
wenzelm@4022
|
239 |
|
wenzelm@3987
|
240 |
|
wenzelm@26430
|
241 |
(*** Pure theory syntax and logical content ***)
|
wenzelm@3987
|
242 |
|
wenzelm@24243
|
243 |
val typ = SimpleSyntax.read_typ;
|
wenzelm@24243
|
244 |
val term = SimpleSyntax.read_term;
|
wenzelm@24243
|
245 |
val prop = SimpleSyntax.read_prop;
|
wenzelm@24243
|
246 |
|
wenzelm@28856
|
247 |
val typeT = Syntax.typeT;
|
wenzelm@28856
|
248 |
val spropT = Syntax.spropT;
|
wenzelm@28856
|
249 |
|
wenzelm@26959
|
250 |
|
wenzelm@26959
|
251 |
(* application syntax variants *)
|
wenzelm@26959
|
252 |
|
wenzelm@26959
|
253 |
val appl_syntax =
|
wenzelm@26959
|
254 |
[("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
|
wenzelm@26959
|
255 |
("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
|
wenzelm@26959
|
256 |
|
wenzelm@26959
|
257 |
val applC_syntax =
|
wenzelm@26959
|
258 |
[("", typ "'a => cargs", Delimfix "_"),
|
wenzelm@26959
|
259 |
("_cargs", typ "'a => cargs => cargs", Mixfix ("_/ _", [1000, 1000], 1000)),
|
wenzelm@26959
|
260 |
("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
|
wenzelm@26959
|
261 |
("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
|
wenzelm@26959
|
262 |
|
wenzelm@26959
|
263 |
structure OldApplSyntax = TheoryDataFun
|
wenzelm@26959
|
264 |
(
|
wenzelm@26959
|
265 |
type T = bool;
|
wenzelm@26959
|
266 |
val empty = false;
|
wenzelm@26959
|
267 |
val copy = I;
|
wenzelm@26959
|
268 |
val extend = I;
|
wenzelm@26959
|
269 |
fun merge _ (b1, b2) : T =
|
wenzelm@26959
|
270 |
if b1 = b2 then b1
|
wenzelm@26959
|
271 |
else error "Cannot merge theories with different application syntax";
|
wenzelm@26959
|
272 |
);
|
wenzelm@26959
|
273 |
|
wenzelm@26959
|
274 |
val old_appl_syntax = OldApplSyntax.get;
|
wenzelm@26959
|
275 |
|
wenzelm@26959
|
276 |
val old_appl_syntax_setup =
|
wenzelm@26959
|
277 |
OldApplSyntax.put true #>
|
wenzelm@26959
|
278 |
Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
|
wenzelm@26959
|
279 |
Sign.add_syntax_i appl_syntax;
|
wenzelm@26959
|
280 |
|
wenzelm@26959
|
281 |
|
wenzelm@26959
|
282 |
(* main content *)
|
wenzelm@26959
|
283 |
|
wenzelm@26463
|
284 |
val _ = Context.>> (Context.map_theory
|
wenzelm@26959
|
285 |
(OldApplSyntax.init #>
|
wenzelm@26959
|
286 |
Sign.add_types
|
wenzelm@4922
|
287 |
[("fun", 2, NoSyn),
|
wenzelm@4922
|
288 |
("prop", 0, NoSyn),
|
wenzelm@4922
|
289 |
("itself", 1, NoSyn),
|
wenzelm@4922
|
290 |
("dummy", 0, NoSyn)]
|
wenzelm@26430
|
291 |
#> Sign.add_nonterminals Syntax.basic_nonterms
|
wenzelm@26430
|
292 |
#> Sign.add_syntax_i
|
wenzelm@26436
|
293 |
[("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)),
|
wenzelm@26436
|
294 |
("_abs", typ "'a", NoSyn),
|
wenzelm@26436
|
295 |
("", typ "'a => args", Delimfix "_"),
|
wenzelm@26436
|
296 |
("_args", typ "'a => args => args", Delimfix "_,/ _"),
|
wenzelm@26436
|
297 |
("", typ "id => idt", Delimfix "_"),
|
wenzelm@26436
|
298 |
("_idtdummy", typ "idt", Delimfix "'_"),
|
wenzelm@26436
|
299 |
("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)),
|
wenzelm@26436
|
300 |
("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)),
|
wenzelm@26436
|
301 |
("", typ "idt => idt", Delimfix "'(_')"),
|
wenzelm@26436
|
302 |
("", typ "idt => idts", Delimfix "_"),
|
wenzelm@26436
|
303 |
("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)),
|
wenzelm@26436
|
304 |
("", typ "idt => pttrn", Delimfix "_"),
|
wenzelm@26436
|
305 |
("", typ "pttrn => pttrns", Delimfix "_"),
|
wenzelm@26436
|
306 |
("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
|
wenzelm@28856
|
307 |
("", typ "aprop => aprop", Delimfix "'(_')"),
|
wenzelm@26436
|
308 |
("", typ "id => aprop", Delimfix "_"),
|
wenzelm@26436
|
309 |
("", typ "longid => aprop", Delimfix "_"),
|
wenzelm@26436
|
310 |
("", typ "var => aprop", Delimfix "_"),
|
wenzelm@26436
|
311 |
("_DDDOT", typ "aprop", Delimfix "..."),
|
wenzelm@26436
|
312 |
("_aprop", typ "aprop => prop", Delimfix "PROP _"),
|
wenzelm@26436
|
313 |
("_asm", typ "prop => asms", Delimfix "_"),
|
wenzelm@26436
|
314 |
("_asms", typ "prop => asms => asms", Delimfix "_;/ _"),
|
wenzelm@26436
|
315 |
("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
|
wenzelm@26436
|
316 |
("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"),
|
wenzelm@26436
|
317 |
("_mk_ofclass", typ "dummy", NoSyn),
|
wenzelm@26436
|
318 |
("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"),
|
wenzelm@26436
|
319 |
("", typ "id => logic", Delimfix "_"),
|
wenzelm@26436
|
320 |
("", typ "longid => logic", Delimfix "_"),
|
wenzelm@26436
|
321 |
("", typ "var => logic", Delimfix "_"),
|
wenzelm@26436
|
322 |
("_DDDOT", typ "logic", Delimfix "..."),
|
wenzelm@26436
|
323 |
("_constify", typ "num => num_const", Delimfix "_"),
|
wenzelm@26436
|
324 |
("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"),
|
wenzelm@26436
|
325 |
("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"),
|
wenzelm@26436
|
326 |
("_indexdefault", typ "index", Delimfix ""),
|
wenzelm@26436
|
327 |
("_indexvar", typ "index", Delimfix "'\\<index>"),
|
wenzelm@26436
|
328 |
("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)),
|
wenzelm@26436
|
329 |
("==>", typ "prop => prop => prop", Delimfix "op ==>"),
|
wenzelm@28622
|
330 |
(Term.dummy_patternN, typ "aprop", Delimfix "'_"),
|
wenzelm@28856
|
331 |
("_sort_constraint", typ "type => prop", Delimfix "(1SORT'_CONSTRAINT/(1'(_')))"),
|
wenzelm@28856
|
332 |
("Pure.term", typ "logic => prop", Delimfix "TERM _"),
|
wenzelm@28856
|
333 |
("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&&", 2))]
|
wenzelm@26959
|
334 |
#> Sign.add_syntax_i applC_syntax
|
wenzelm@26430
|
335 |
#> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
|
wenzelm@24243
|
336 |
[("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
|
wenzelm@24243
|
337 |
("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
|
wenzelm@24243
|
338 |
("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
|
wenzelm@28856
|
339 |
("_constrain", typ "logic => type => logic", Mixfix ("_\\<Colon>_", [4, 0], 3)),
|
wenzelm@28856
|
340 |
("_constrain", [spropT, typeT] ---> spropT, Mixfix ("_\\<Colon>_", [4, 0], 3)),
|
wenzelm@24243
|
341 |
("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)),
|
wenzelm@24243
|
342 |
("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)),
|
wenzelm@24243
|
343 |
("_type_constraint_", typ "'a", NoSyn),
|
wenzelm@24243
|
344 |
("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
|
wenzelm@24243
|
345 |
("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)),
|
wenzelm@24243
|
346 |
("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
|
wenzelm@24243
|
347 |
("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)),
|
wenzelm@24243
|
348 |
("_DDDOT", typ "aprop", Delimfix "\\<dots>"),
|
wenzelm@24243
|
349 |
("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
|
wenzelm@24243
|
350 |
("_DDDOT", typ "logic", Delimfix "\\<dots>")]
|
wenzelm@26430
|
351 |
#> Sign.add_modesyntax_i ("", false)
|
wenzelm@28856
|
352 |
[("prop", typ "prop => prop", Mixfix ("_", [0], 0))]
|
wenzelm@26430
|
353 |
#> Sign.add_modesyntax_i ("HTML", false)
|
wenzelm@24243
|
354 |
[("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
|
wenzelm@26430
|
355 |
#> Sign.add_consts_i
|
wenzelm@24243
|
356 |
[("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
|
wenzelm@24243
|
357 |
("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
|
wenzelm@24243
|
358 |
("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
|
wenzelm@24243
|
359 |
("prop", typ "prop => prop", NoSyn),
|
wenzelm@24243
|
360 |
("TYPE", typ "'a itself", NoSyn),
|
wenzelm@24243
|
361 |
(Term.dummy_patternN, typ "'a", Delimfix "'_")]
|
wenzelm@26430
|
362 |
#> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
|
wenzelm@26430
|
363 |
#> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
|
wenzelm@26430
|
364 |
#> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
|
wenzelm@26430
|
365 |
#> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
|
wenzelm@26430
|
366 |
#> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
|
wenzelm@26430
|
367 |
#> Sign.add_trfuns Syntax.pure_trfuns
|
wenzelm@26430
|
368 |
#> Sign.add_trfunsT Syntax.pure_trfunsT
|
wenzelm@26430
|
369 |
#> Sign.local_path
|
wenzelm@26430
|
370 |
#> Sign.add_consts_i
|
wenzelm@24243
|
371 |
[("term", typ "'a => prop", NoSyn),
|
wenzelm@28622
|
372 |
("sort_constraint", typ "'a itself => prop", NoSyn),
|
wenzelm@24243
|
373 |
("conjunction", typ "prop => prop => prop", NoSyn)]
|
haftmann@27691
|
374 |
#> (add_defs false o map Thm.no_attributes)
|
wenzelm@24243
|
375 |
[("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
|
wenzelm@26430
|
376 |
("term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
|
wenzelm@28622
|
377 |
("sort_constraint_def",
|
wenzelm@28622
|
378 |
prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
|
wenzelm@28622
|
379 |
\ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
|
wenzelm@28856
|
380 |
("conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
|
wenzelm@28622
|
381 |
#> Sign.hide_const false "Pure.term"
|
wenzelm@28622
|
382 |
#> Sign.hide_const false "Pure.sort_constraint"
|
wenzelm@26666
|
383 |
#> Sign.hide_const false "Pure.conjunction"
|
wenzelm@26430
|
384 |
#> add_thmss [(("nothing", []), [])] #> snd
|
wenzelm@26463
|
385 |
#> Theory.add_axioms_i Proofterm.equality_axms));
|
wenzelm@3987
|
386 |
|
wenzelm@5091
|
387 |
end;
|