1 (* Title: Pure/pure_thy.ML
3 Author: Markus Wenzel, TU Muenchen
5 Theorem storage. The ProtoPure theory.
8 signature BASIC_PURE_THY =
10 datatype interval = FromTo of int * int | From of int | Single of int
13 NameSelection of string * interval list |
15 val get_thm: theory -> thmref -> thm
16 val get_thms: theory -> thmref -> thm list
17 val get_thmss: theory -> thmref list -> thm list
23 val conjunction_def: thm
29 include BASIC_PURE_THY
30 val tag_rule: Markup.property -> thm -> thm
31 val untag_rule: string -> thm -> thm
32 val tag: Markup.property -> attribute
33 val untag: string -> attribute
34 val has_name_hint: thm -> bool
35 val get_name_hint: thm -> string
36 val put_name_hint: string -> thm -> thm
37 val has_kind: thm -> bool
38 val get_kind: thm -> string
39 val kind_rule: string -> thm -> thm
40 val kind: string -> attribute
41 val kind_internal: attribute
42 val has_internal: Markup.property list -> bool
43 val is_internal: thm -> bool
44 val string_of_thmref: thmref -> string
45 val get_thm_closure: theory -> thmref -> thm
46 val get_thms_closure: theory -> thmref -> thm list
47 val single_thm: string -> thm list -> thm
48 val name_of_thmref: thmref -> string
49 val map_name_of_thmref: (string -> string) -> thmref -> thmref
50 val select_thm: thmref -> thm list -> thm list
51 val selections: string * thm list -> (thmref * thm) list
52 val theorems_of: theory -> thm list NameSpace.table
53 val fact_index_of: theory -> FactIndex.T
54 val valid_thms: theory -> thmref * thm list -> bool
55 val thms_containing: theory -> FactIndex.spec -> (string * thm list) list
56 val thms_containing_consts: theory -> string list -> (string * thm) list
57 val thms_of: theory -> (string * thm) list
58 val all_thms_of: theory -> (string * thm) list
59 val hide_thms: bool -> string list -> theory -> theory
60 val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
61 val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
62 val burrow_facts: ('a list -> 'b list) ->
63 ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
64 val name_multi: string -> 'a list -> (string * 'a) list
65 val name_thm: bool -> bool -> string -> thm -> thm
66 val name_thms: bool -> bool -> string -> thm list -> thm list
67 val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list
68 val store_thm: (bstring * thm) * attribute list -> theory -> thm * theory
69 val smart_store_thms: (bstring * thm list) -> thm list
70 val smart_store_thms_open: (bstring * thm list) -> thm list
71 val forall_elim_var: int -> thm -> thm
72 val forall_elim_vars: int -> thm -> thm
73 val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
74 val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory
75 val note_thmss: string -> ((bstring * attribute list) *
76 (thmref * attribute list) list) list -> theory -> (bstring * thm list) list * theory
77 val note_thmss_i: string -> ((bstring * attribute list) *
78 (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
79 val note_thmss_qualified: string -> string -> ((bstring * attribute list) *
80 (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
81 val add_axioms: ((bstring * string) * attribute list) list -> theory -> thm list * theory
82 val add_axioms_i: ((bstring * term) * attribute list) list -> theory -> thm list * theory
83 val add_axiomss: ((bstring * string list) * attribute list) list ->
84 theory -> thm list list * theory
85 val add_axiomss_i: ((bstring * term list) * attribute list) list ->
86 theory -> thm list list * theory
87 val simple_def: bstring * attribute list ->
88 ((bstring * typ * mixfix) * term list) * term -> theory -> (string * thm) * theory
89 val add_defs: bool -> ((bstring * string) * attribute list) list ->
90 theory -> thm list * theory
91 val add_defs_i: bool -> ((bstring * term) * attribute list) list ->
92 theory -> thm list * theory
93 val add_defs_unchecked: bool -> ((bstring * string) * attribute list) list ->
94 theory -> thm list * theory
95 val add_defs_unchecked_i: bool -> ((bstring * term) * attribute list) list ->
96 theory -> thm list * theory
97 val add_defss: bool -> ((bstring * string list) * attribute list) list ->
98 theory -> thm list list * theory
99 val add_defss_i: bool -> ((bstring * term list) * attribute list) list ->
100 theory -> thm list list * theory
101 val appl_syntax: (string * typ * mixfix) list
102 val applC_syntax: (string * typ * mixfix) list
105 structure PureThy: PURE_THY =
109 (*** theorem tags ***)
111 (* add / delete tags *)
113 fun tag_rule tg = Thm.map_tags (insert (op =) tg);
114 fun untag_rule s = Thm.map_tags (filter_out (fn (s', _) => s = s'));
116 fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x;
117 fun untag s x = Thm.rule_attribute (K (untag_rule s)) x;
120 (* unofficial theorem names *)
122 fun the_name_hint thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.nameN);
124 val has_name_hint = can the_name_hint;
125 val get_name_hint = the_default "??.unknown" o try the_name_hint;
127 fun put_name_hint name = untag_rule Markup.nameN #> tag_rule (Markup.nameN, name);
132 fun the_kind thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.kindN);
134 val has_kind = can the_kind;
135 val get_kind = the_default "??.unknown" o try the_kind;
137 fun kind_rule k = tag_rule (Markup.kindN, k) o untag_rule Markup.kindN;
138 fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x;
139 fun kind_internal x = kind Thm.internalK x;
140 fun has_internal tags = exists (fn tg => tg = (Markup.kindN, Thm.internalK)) tags;
141 val is_internal = has_internal o Thm.get_tags;
145 (*** theorem database ***)
147 (** dataype theorems **)
149 structure TheoremsData = TheoryDataFun
152 {theorems: thm list NameSpace.table,
153 index: FactIndex.T} ref;
156 ref {theorems = NameSpace.empty_table, index = FactIndex.empty}: T;
158 val empty = mk_empty ();
159 fun copy (ref x) = ref x;
160 val extend = mk_empty;
161 fun merge _ = mk_empty;
164 val get_theorems_ref = TheoremsData.get;
165 val get_theorems = ! o get_theorems_ref;
166 val theorems_of = #theorems o get_theorems;
167 val fact_index_of = #index o get_theorems;
171 (** retrieve theorems **)
173 fun the_thms _ (SOME thms) = thms
174 | the_thms name NONE = error ("Unknown theorem(s) " ^ quote name);
176 fun single_thm _ [thm] = thm
177 | single_thm name _ = error ("Single theorem expected " ^ quote name);
180 (* datatype interval *)
183 FromTo of int * int |
187 fun string_of_interval (FromTo (i, j)) = string_of_int i ^ "-" ^ string_of_int j
188 | string_of_interval (From i) = string_of_int i ^ "-"
189 | string_of_interval (Single i) = string_of_int i;
192 let fun err () = raise Fail ("Bad interval specification " ^ string_of_interval iv) in
194 FromTo (i, j) => if i <= j then i upto j else err ()
195 | From i => if i <= n then i upto n else err ()
200 (* datatype thmref *)
204 NameSelection of string * interval list |
207 fun name_of_thmref (Name name) = name
208 | name_of_thmref (NameSelection (name, _)) = name
209 | name_of_thmref (Fact _) = error "Illegal literal fact";
211 fun map_name_of_thmref f (Name name) = Name (f name)
212 | map_name_of_thmref f (NameSelection (name, is)) = NameSelection (f name, is)
213 | map_name_of_thmref _ thmref = thmref;
215 fun string_of_thmref (Name name) = name
216 | string_of_thmref (NameSelection (name, is)) =
217 name ^ enclose "(" ")" (commas (map string_of_interval is))
218 | string_of_thmref (Fact _) = error "Illegal literal fact";
223 fun select_thm (Name _) thms = thms
224 | select_thm (Fact _) thms = thms
225 | select_thm (NameSelection (name, ivs)) thms =
228 fun err msg = error (msg ^ " for " ^ quote name ^ " (length " ^ string_of_int n ^ ")");
230 if i < 1 orelse i > n then err ("Bad subscript " ^ string_of_int i)
231 else nth thms (i - 1);
232 val is = maps (interval n) ivs handle Fail msg => err msg;
233 in map select is end;
238 fun selections (name, [thm]) = [(Name name, thm)]
239 | selections (name, thms) = (1 upto length thms, thms) |> ListPair.map (fn (i, thm) =>
240 (NameSelection (name, [Single i]), thm));
243 (* get_thm(s)_closure -- statically scoped versions *)
245 (*beware of proper order of evaluation!*)
247 fun lookup_thms thy =
249 val (space, thms) = #theorems (get_theorems thy);
250 val thy_ref = Theory.check_thy thy;
253 Option.map (map (Thm.transfer (Theory.deref thy_ref))) (*dynamic identity*)
254 (Symtab.lookup thms (NameSpace.intern space name)) (*static content*)
257 fun get_thms_closure thy =
258 let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) in
260 let val name = name_of_thmref thmref;
261 in select_thm thmref (the_thms name (get_first (fn f => f name) closures)) end
264 fun get_thm_closure thy =
265 let val get = get_thms_closure thy
266 in fn thmref => single_thm (name_of_thmref thmref) (get thmref) end;
271 fun get_thms theory thmref =
272 let val name = name_of_thmref thmref in
273 get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory)
274 |> the_thms name |> select_thm thmref |> map (Thm.transfer theory)
277 fun get_thmss thy thmrefs = maps (get_thms thy) thmrefs;
278 fun get_thm thy thmref = single_thm (name_of_thmref thmref) (get_thms thy thmref);
281 (* thms_containing etc. *)
283 fun valid_thms thy (thmref, ths) =
284 (case try (get_thms thy) thmref of
286 | SOME ths' => Thm.eq_thms (ths, ths'));
288 fun thms_containing theory spec =
289 (theory :: Theory.ancestors_of theory)
291 FactIndex.find (fact_index_of thy) spec
292 |> List.filter (fn (name, ths) => valid_thms theory (Name name, ths))
293 |> distinct (eq_fst (op =)));
295 fun thms_containing_consts thy consts =
296 thms_containing thy (consts, []) |> maps #2
297 |> map (`(get_name_hint));
303 let val thms = #2 (theorems_of thy)
304 in map (`(get_name_hint)) (maps snd (Symtab.dest thms)) end;
306 fun all_thms_of thy = maps thms_of (thy :: Theory.ancestors_of thy);
310 (** store theorems **) (*DESTRUCTIVE*)
312 (* hiding -- affects current theory node only *)
314 fun hide_thms fully names thy = CRITICAL (fn () =>
316 val r as ref {theorems = (space, thms), index} = get_theorems_ref thy;
317 val space' = fold (NameSpace.hide fully) names space;
318 in r := {theorems = (space', thms), index = index}; thy end);
321 (* fact specifications *)
323 fun map_facts f = map (apsnd (map (apfst (map f))));
324 fun burrow_fact f = split_list #>> burrow f #> op ~~;
325 fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
330 fun gen_names _ len "" = replicate len ""
331 | gen_names j len name = map (fn i => name ^ "_" ^ string_of_int i) (j + 1 upto j + len);
333 fun name_multi name [x] = [(name, x)]
334 | name_multi name xs = gen_names 0 (length xs) name ~~ xs;
336 fun name_thm pre official name thm = thm
337 |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
338 |> (if has_name_hint thm andalso pre orelse name = "" then I else put_name_hint name);
340 fun name_thms pre official name xs =
341 map (uncurry (name_thm pre official)) (name_multi name xs);
343 fun name_thmss official name fact =
344 burrow_fact (name_thms true official name) fact;
349 fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
350 fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
352 fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap
353 | enter_thms pre_name post_name app_att (bname, thms) thy = CRITICAL (fn () =>
355 val name = Sign.full_name thy bname;
356 val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms));
357 val r as ref {theorems = (space, theorems), index} = get_theorems_ref thy';
358 val space' = Sign.declare_name thy' name space;
359 val theorems' = Symtab.update (name, thms') theorems;
360 val index' = FactIndex.add_global (name, thms') index;
362 (case Symtab.lookup theorems name of
365 if Thm.eq_thms (thms', thms'') then warn_same name
366 else warn_overwrite name);
367 r := {theorems = (space', theorems'), index = index'};
374 fun add_thms_atts pre_name ((bname, thms), atts) =
375 enter_thms pre_name (name_thms false true)
376 (foldl_map (Thm.theory_attributes atts)) (bname, thms);
378 fun gen_add_thmss pre_name =
379 fold_map (add_thms_atts pre_name);
381 fun gen_add_thms pre_name args =
382 apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
384 val add_thmss = gen_add_thmss (name_thms true true);
385 val add_thms = gen_add_thms (name_thms true true);
392 fun gen_note_thmss get k = fold_map (fn ((bname, more_atts), ths_atts) => fn thy =>
394 fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
395 val (thms, thy') = thy |> enter_thms
396 (name_thmss true) (name_thms false true) (apsnd flat o foldl_map app)
397 (bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind k])) ths_atts);
398 in ((bname, thms), thy') end);
402 val note_thmss = gen_note_thmss get_thms;
403 val note_thmss_i = gen_note_thmss (K I);
407 fun note_thmss_qualified k path facts thy =
409 |> Sign.add_path path
410 |> Sign.no_base_names
411 |> note_thmss_i k facts
412 ||> Sign.restore_naming thy;
417 fun store_thm ((bname, thm), atts) thy =
418 let val ([th'], thy') = add_thms_atts (name_thms true true) ((bname, [thm]), atts) thy
422 (* smart_store_thms(_open) *)
426 fun smart_store _ (name, []) =
427 error ("Cannot store empty list of theorems: " ^ quote name)
428 | smart_store official (name, [thm]) =
429 fst (enter_thms (name_thms true official) (name_thms false official) I (name, [thm])
430 (Thm.theory_of_thm thm))
431 | smart_store official (name, thms) =
432 let val thy = Theory.merge_list (map Thm.theory_of_thm thms) in
433 fst (enter_thms (name_thms true official) (name_thms false official) I (name, thms) thy)
438 val smart_store_thms = smart_store true;
439 val smart_store_thms_open = smart_store false;
444 (* forall_elim_var(s) -- belongs to drule.ML *)
446 fun forall_elim_vars_aux strip_vars i th =
448 val {thy, tpairs, prop, ...} = Thm.rep_thm th;
449 val add_used = Term.fold_aterms
450 (fn Var ((x, j), _) => if i = j then insert (op =) x else I | _ => I);
451 val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []);
452 val vars = strip_vars prop;
453 val cvars = (Name.variant_list used (map #1 vars), vars)
454 |> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T)));
455 in fold Thm.forall_elim cvars th end;
457 val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars;
459 fun forall_elim_var i th = forall_elim_vars_aux
460 (fn Const ("all", _) $ Abs (a, T, _) => [(a, T)]
461 | _ => raise THM ("forall_elim_vars", i, [th])) i th;
464 (* store axioms as theorems *)
467 fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name);
468 fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs;
469 fun add_single add ((name, ax), atts) thy =
471 val named_ax = [(name, ax)];
472 val thy' = add named_ax thy;
473 val thm = hd (get_axs thy' named_ax);
474 in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end;
475 fun add_multi add ((name, axs), atts) thy =
477 val named_axs = name_multi name axs;
478 val thy' = add named_axs thy;
479 val thms = get_axs thy' named_axs;
480 in apfst hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end;
481 fun add_singles add = fold_map (add_single add);
482 fun add_multis add = fold_map (add_multi add);
484 val add_axioms = add_singles Theory.add_axioms;
485 val add_axioms_i = add_singles Theory.add_axioms_i;
486 val add_axiomss = add_multis Theory.add_axioms;
487 val add_axiomss_i = add_multis Theory.add_axioms_i;
488 val add_defs = add_singles o Theory.add_defs false;
489 val add_defs_i = add_singles o Theory.add_defs_i false;
490 val add_defs_unchecked = add_singles o Theory.add_defs true;
491 val add_defs_unchecked_i = add_singles o Theory.add_defs_i true;
492 val add_defss = add_multis o Theory.add_defs false;
493 val add_defss_i = add_multis o Theory.add_defs_i false;
497 (* simple interface for simple definitions *)
499 fun simple_def (raw_name, atts) (((raw_c, ty, syn), ts), t) thy =
501 val c = Sign.full_name thy raw_c;
502 val name = if raw_name = "" then Thm.def_name raw_c else raw_name;
503 val def = Logic.mk_equals (list_comb (Const (c, ty), ts), t);
506 |> Sign.add_consts_authentic [] [(raw_c, ty, syn)]
507 |> add_defs_i false [((name, def), atts)]
508 |-> (fn [thm] => pair (c, thm))
513 (*** the ProtoPure theory ***)
515 val typ = SimpleSyntax.read_typ;
516 val term = SimpleSyntax.read_term;
517 val prop = SimpleSyntax.read_prop;
520 [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
521 ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
524 [("", typ "'a => cargs", Delimfix "_"),
525 ("_cargs", typ "'a => cargs => cargs", Mixfix ("_/ _", [1000, 1000], 1000)),
526 ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
527 ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
531 |> Compress.init_data
536 ("itself", 1, NoSyn),
538 |> Sign.add_nonterminals Syntax.basic_nonterms
540 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)),
541 ("_abs", typ "'a", NoSyn),
542 ("", typ "'a => args", Delimfix "_"),
543 ("_args", typ "'a => args => args", Delimfix "_,/ _"),
544 ("", typ "id => idt", Delimfix "_"),
545 ("_idtdummy", typ "idt", Delimfix "'_"),
546 ("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)),
547 ("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)),
548 ("", typ "idt => idt", Delimfix "'(_')"),
549 ("", typ "idt => idts", Delimfix "_"),
550 ("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)),
551 ("", typ "idt => pttrn", Delimfix "_"),
552 ("", typ "pttrn => pttrns", Delimfix "_"),
553 ("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)),
554 ("", typ "id => aprop", Delimfix "_"),
555 ("", typ "longid => aprop", Delimfix "_"),
556 ("", typ "var => aprop", Delimfix "_"),
557 ("_DDDOT", typ "aprop", Delimfix "..."),
558 ("_aprop", typ "aprop => prop", Delimfix "PROP _"),
559 ("_asm", typ "prop => asms", Delimfix "_"),
560 ("_asms", typ "prop => asms => asms", Delimfix "_;/ _"),
561 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
562 ("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"),
563 ("_mk_ofclass", typ "dummy", NoSyn),
564 ("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"),
565 ("", typ "id => logic", Delimfix "_"),
566 ("", typ "longid => logic", Delimfix "_"),
567 ("", typ "var => logic", Delimfix "_"),
568 ("_DDDOT", typ "logic", Delimfix "..."),
569 ("_constify", typ "num => num_const", Delimfix "_"),
570 ("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"),
571 ("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"),
572 ("_indexdefault", typ "index", Delimfix ""),
573 ("_indexvar", typ "index", Delimfix "'\\<index>"),
574 ("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)),
575 ("==>", typ "prop => prop => prop", Delimfix "op ==>"),
576 (Term.dummy_patternN, typ "aprop", Delimfix "'_")]
577 |> Sign.add_syntax_i appl_syntax
578 |> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
579 [("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
580 ("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
581 ("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
582 ("_constrain", typ "'a => type => 'a", Mixfix ("_\\<Colon>_", [4, 0], 3)),
583 ("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)),
584 ("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)),
585 ("_type_constraint_", typ "'a", NoSyn),
586 ("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
587 ("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)),
588 ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
589 ("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)),
590 ("_DDDOT", typ "aprop", Delimfix "\\<dots>"),
591 ("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
592 ("_DDDOT", typ "logic", Delimfix "\\<dots>")]
593 |> Sign.add_modesyntax_i ("", false)
594 [("prop", typ "prop => prop", Mixfix ("_", [0], 0)),
595 ("ProtoPure.term", typ "'a => prop", Delimfix "TERM _"),
596 ("ProtoPure.conjunction", typ "prop => prop => prop", InfixrName ("&&", 2))]
597 |> Sign.add_modesyntax_i ("HTML", false)
598 [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
600 [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
601 ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
602 ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
603 ("prop", typ "prop => prop", NoSyn),
604 ("TYPE", typ "'a itself", NoSyn),
605 (Term.dummy_patternN, typ "'a", Delimfix "'_")]
606 |> Theory.add_finals_i false
607 [Const ("==", typ "'a => 'a => prop"),
608 Const ("==>", typ "prop => prop => prop"),
609 Const ("all", typ "('a => prop) => prop"),
610 Const ("TYPE", typ "'a itself"),
611 Const (Term.dummy_patternN, typ "'a")]
612 |> Sign.add_trfuns Syntax.pure_trfuns
613 |> Sign.add_trfunsT Syntax.pure_trfunsT
616 [("term", typ "'a => prop", NoSyn),
617 ("conjunction", typ "prop => prop => prop", NoSyn)]
618 |> (add_defs_i false o map Thm.no_attributes)
619 [("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
620 ("term_def", prop "(CONST ProtoPure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
621 ("conjunction_def", prop "(A && B) == (!!C::prop. (A ==> B ==> C) ==> C)")] |> snd
622 |> Sign.hide_consts false ["conjunction", "term"]
623 |> add_thmss [(("nothing", []), [])] |> snd
624 |> Theory.add_axioms_i Proofterm.equality_axms
625 |> Theory.end_theory;
627 structure ProtoPure =
629 val thy = proto_pure;
630 val prop_def = get_axiom thy "prop_def";
631 val term_def = get_axiom thy "term_def";
632 val conjunction_def = get_axiom thy "conjunction_def";
637 structure BasicPureThy: BASIC_PURE_THY = PureThy;