author | wenzelm |
Thu, 03 Apr 2008 23:38:59 +0200 | |
changeset 26553 | 748631e95425 |
parent 26488 | b497e3187ec7 |
child 26626 | c6231d64d264 |
permissions | -rw-r--r-- |
3987 | 1 |
(* Title: Pure/pure_thy.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
26430 | 5 |
Theorem storage. Pure theory syntax and logical content. |
3987 | 6 |
*) |
7 |
||
8 |
signature PURE_THY = |
|
9 |
sig |
|
23657 | 10 |
val tag_rule: Markup.property -> thm -> thm |
18801 | 11 |
val untag_rule: string -> thm -> thm |
23657 | 12 |
val tag: Markup.property -> attribute |
18801 | 13 |
val untag: string -> attribute |
21964 | 14 |
val has_name_hint: thm -> bool |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
15 |
val get_name_hint: thm -> string |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
16 |
val put_name_hint: string -> thm -> thm |
25981 | 17 |
val get_group: thm -> string option |
18 |
val put_group: string -> thm -> thm |
|
19 |
val group: string -> attribute |
|
22251 | 20 |
val has_kind: thm -> bool |
18801 | 21 |
val get_kind: thm -> string |
22 |
val kind_rule: string -> thm -> thm |
|
23 |
val kind: string -> attribute |
|
24 |
val kind_internal: attribute |
|
23657 | 25 |
val has_internal: Markup.property list -> bool |
18801 | 26 |
val is_internal: thm -> bool |
26344
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
27 |
val get_fact: theory -> Facts.ref -> thm list |
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
28 |
val get_fact_silent: theory -> Facts.ref -> thm list |
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
29 |
val get_thms: theory -> xstring -> thm list |
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
30 |
val get_thm: theory -> xstring -> thm |
17162 | 31 |
val theorems_of: theory -> thm list NameSpace.table |
26282
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
32 |
val all_facts_of: theory -> Facts.T |
16336 | 33 |
val thms_of: theory -> (string * thm) list |
34 |
val all_thms_of: theory -> (string * thm) list |
|
12695 | 35 |
val hide_thms: bool -> string list -> theory -> theory |
21580 | 36 |
val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list |
21567 | 37 |
val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list |
21580 | 38 |
val burrow_facts: ('a list -> 'b list) -> |
39 |
('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list |
|
40 |
val name_multi: string -> 'a list -> (string * 'a) list |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
41 |
val name_thm: bool -> bool -> string -> thm -> thm |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
42 |
val name_thms: bool -> bool -> string -> thm list -> thm list |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
43 |
val name_thmss: bool -> string -> (thm list * 'a) list -> (thm list * 'a) list |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
44 |
val store_thms: bstring * thm list -> theory -> thm list * theory |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
45 |
val store_thm: bstring * thm -> theory -> thm * theory |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
46 |
val store_thm_open: bstring * thm -> theory -> thm * theory |
18728 | 47 |
val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory |
24965 | 48 |
val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
49 |
val add_thms_dynamic: bstring * (Context.generic -> thm list) -> theory -> theory |
25598 | 50 |
val note: string -> string * thm -> theory -> thm * theory |
18801 | 51 |
val note_thmss: string -> ((bstring * attribute list) * |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26320
diff
changeset
|
52 |
(Facts.ref * attribute list) list) list -> theory -> (bstring * thm list) list * theory |
18801 | 53 |
val note_thmss_i: string -> ((bstring * attribute list) * |
54 |
(thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory |
|
25981 | 55 |
val note_thmss_grouped: string -> string -> ((bstring * attribute list) * |
56 |
(thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory |
|
18801 | 57 |
val note_thmss_qualified: string -> string -> ((bstring * attribute list) * |
18728 | 58 |
(thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
59 |
val forall_elim_var: int -> thm -> thm |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
60 |
val forall_elim_vars: int -> thm -> thm |
18728 | 61 |
val add_axioms: ((bstring * string) * attribute list) list -> theory -> thm list * theory |
62 |
val add_axioms_i: ((bstring * term) * attribute list) list -> theory -> thm list * theory |
|
63 |
val add_defs: bool -> ((bstring * string) * attribute list) list -> |
|
18377 | 64 |
theory -> thm list * theory |
18728 | 65 |
val add_defs_i: bool -> ((bstring * term) * attribute list) list -> |
18377 | 66 |
theory -> thm list * theory |
19629 | 67 |
val add_defs_unchecked: bool -> ((bstring * string) * attribute list) list -> |
68 |
theory -> thm list * theory |
|
69 |
val add_defs_unchecked_i: bool -> ((bstring * term) * attribute list) list -> |
|
70 |
theory -> thm list * theory |
|
3987 | 71 |
end; |
72 |
||
73 |
structure PureThy: PURE_THY = |
|
74 |
struct |
|
75 |
||
76 |
||
18801 | 77 |
(*** theorem tags ***) |
78 |
||
79 |
(* add / delete tags *) |
|
80 |
||
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
81 |
fun tag_rule tg = Thm.map_tags (insert (op =) tg); |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
82 |
fun untag_rule s = Thm.map_tags (filter_out (fn (s', _) => s = s')); |
18801 | 83 |
|
84 |
fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x; |
|
85 |
fun untag s x = Thm.rule_attribute (K (untag_rule s)) x; |
|
86 |
||
87 |
||
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
88 |
(* unofficial theorem names *) |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
89 |
|
23657 | 90 |
fun the_name_hint thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.nameN); |
22251 | 91 |
|
92 |
val has_name_hint = can the_name_hint; |
|
93 |
val get_name_hint = the_default "??.unknown" o try the_name_hint; |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
94 |
|
23657 | 95 |
fun put_name_hint name = untag_rule Markup.nameN #> tag_rule (Markup.nameN, name); |
21964 | 96 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
97 |
|
25981 | 98 |
(* theorem groups *) |
99 |
||
100 |
fun get_group thm = AList.lookup (op =) (Thm.get_tags thm) Markup.groupN; |
|
101 |
||
102 |
fun put_group name = |
|
103 |
if name = "" then I else Thm.map_tags (AList.update (op =) (Markup.groupN, name)); |
|
104 |
||
105 |
fun group name = Thm.rule_attribute (K (put_group name)); |
|
106 |
||
107 |
||
18801 | 108 |
(* theorem kinds *) |
109 |
||
23657 | 110 |
fun the_kind thm = the (AList.lookup (op =) (Thm.get_tags thm) Markup.kindN); |
22251 | 111 |
|
112 |
val has_kind = can the_kind; |
|
25981 | 113 |
val get_kind = the_default "" o try the_kind; |
18801 | 114 |
|
23657 | 115 |
fun kind_rule k = tag_rule (Markup.kindN, k) o untag_rule Markup.kindN; |
18801 | 116 |
fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x; |
22363 | 117 |
fun kind_internal x = kind Thm.internalK x; |
23657 | 118 |
fun has_internal tags = exists (fn tg => tg = (Markup.kindN, Thm.internalK)) tags; |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
119 |
val is_internal = has_internal o Thm.get_tags; |
18801 | 120 |
|
121 |
||
122 |
||
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
123 |
(*** theorem database ***) |
3987 | 124 |
|
16441 | 125 |
(** dataype theorems **) |
3987 | 126 |
|
26282
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
127 |
datatype thms = Thms of |
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
128 |
{theorems: thm list NameSpace.table, (* FIXME legacy *) |
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
129 |
all_facts: Facts.T}; |
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
130 |
|
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
131 |
fun make_thms (theorems, all_facts) = Thms {theorems = theorems, all_facts = all_facts}; |
26282
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
132 |
|
16441 | 133 |
structure TheoremsData = TheoryDataFun |
24713 | 134 |
( |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
135 |
type T = thms; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
136 |
val empty = make_thms (NameSpace.empty_table, Facts.empty); |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
137 |
val copy = I; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
138 |
fun extend (Thms {theorems = _, all_facts}) = make_thms (NameSpace.empty_table, all_facts); |
26282
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
139 |
fun merge _ |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
140 |
(Thms {theorems = _, all_facts = all_facts1}, |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
141 |
Thms {theorems = _, all_facts = all_facts2}) = |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
142 |
make_thms (NameSpace.empty_table, Facts.merge (all_facts1, all_facts2)); |
24713 | 143 |
); |
3987 | 144 |
|
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
145 |
fun map_theorems f = |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
146 |
TheoremsData.map (fn Thms {theorems, all_facts} => make_thms (f (theorems, all_facts))); |
26430 | 147 |
|
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
148 |
val get_theorems = (fn Thms args => args) o TheoremsData.get; |
17162 | 149 |
val theorems_of = #theorems o get_theorems; |
26282
305d5ca4fa9d
replaced obsolete FactIndex.T by Facts.T (cumulative version, assumes that facts are only added to unfinished theories);
wenzelm
parents:
26050
diff
changeset
|
150 |
val all_facts_of = #all_facts o get_theorems; |
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset
|
151 |
|
6367 | 152 |
|
3987 | 153 |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
154 |
(** retrieve theorems **) |
3987 | 155 |
|
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
156 |
local |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
157 |
|
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
158 |
fun lookup_thms thy xname = |
9564 | 159 |
let |
16493 | 160 |
val (space, thms) = #theorems (get_theorems thy); |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
161 |
val name = NameSpace.intern space xname; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
162 |
in Option.map (pair name) (Symtab.lookup thms name) end; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
163 |
|
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
164 |
fun lookup_fact thy xname = |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
165 |
let |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
166 |
val facts = all_facts_of thy; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
167 |
val name = NameSpace.intern (Facts.space_of facts) xname; |
26393 | 168 |
in Option.map (pair name) (Facts.lookup (Context.Theory thy) facts name) end; |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
169 |
|
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
170 |
fun show_result NONE = "none" |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
171 |
| show_result (SOME (name, _)) = quote name; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
172 |
|
26344
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
173 |
fun get silent theory thmref = |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
174 |
let |
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26320
diff
changeset
|
175 |
val name = Facts.name_of_ref thmref; |
26367
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
176 |
val pos = Facts.pos_of_ref thmref; |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
177 |
val new_res = lookup_fact theory name; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
178 |
val old_res = get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory); |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
179 |
val _ = Theory.check_thy theory; |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
180 |
val is_same = |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
181 |
(case (new_res, old_res) of |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
182 |
(NONE, NONE) => true |
26395 | 183 |
| (SOME (_, ths1), SOME (_, ths2)) => Thm.eq_thms (ths1, ths2) |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
184 |
| _ => false); |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
185 |
val _ = |
26320 | 186 |
if is_same orelse silent then () |
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
187 |
else legacy_feature ("Fact lookup differs from old-style thm database:\n" ^ |
26367
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
188 |
show_result new_res ^ " vs " ^ show_result old_res ^ Position.str_of pos); |
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
189 |
in |
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
190 |
(case old_res of |
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
191 |
NONE => error ("Unknown theorem(s) " ^ quote name ^ Position.str_of pos) |
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
192 |
| SOME (_, ths) => Facts.select thmref (map (Thm.transfer theory) ths)) |
06635166d211
get_thms etc.: improved reporting of source position;
wenzelm
parents:
26361
diff
changeset
|
193 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
194 |
|
26320 | 195 |
in |
196 |
||
26344
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
197 |
val get_fact_silent = get true; |
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
198 |
val get_fact = get false; |
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
199 |
|
26361 | 200 |
fun get_thms thy = get_fact thy o Facts.named; |
26344
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
201 |
fun get_thm thy name = Facts.the_single name (get_thms thy name); |
4783 | 202 |
|
26292
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
203 |
end; |
009e56d16080
get_thm(s): check facts lookup vs. old thm database;
wenzelm
parents:
26282
diff
changeset
|
204 |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
205 |
|
16336 | 206 |
(* thms_of etc. *) |
15882
a191d2bee3e1
new thms_containing that searches for patterns instead of constants
kleing
parents:
15801
diff
changeset
|
207 |
|
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset
|
208 |
fun thms_of thy = |
17162 | 209 |
let val thms = #2 (theorems_of thy) |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
210 |
in map (`(get_name_hint)) (maps snd (Symtab.dest thms)) end; |
15703 | 211 |
|
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset
|
212 |
fun all_thms_of thy = maps thms_of (thy :: Theory.ancestors_of thy); |
16336 | 213 |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
214 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
215 |
|
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
216 |
(** store theorems **) |
3987 | 217 |
|
16441 | 218 |
(* hiding -- affects current theory node only *) |
12695 | 219 |
|
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
220 |
fun hide_thms fully names = |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
221 |
map_theorems (fn ((space, thms), all_facts) => |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
222 |
let val space' = fold (NameSpace.hide fully) names space |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
223 |
in ((space', thms), all_facts) end); |
12695 | 224 |
|
225 |
||
21580 | 226 |
(* fact specifications *) |
227 |
||
228 |
fun map_facts f = map (apsnd (map (apfst (map f)))); |
|
229 |
fun burrow_fact f = split_list #>> burrow f #> op ~~; |
|
230 |
fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~; |
|
231 |
||
232 |
||
4853 | 233 |
(* naming *) |
234 |
||
18801 | 235 |
fun name_multi name [x] = [(name, x)] |
26457 | 236 |
| name_multi "" xs = map (pair "") xs |
237 |
| name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs; |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
238 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
239 |
fun name_thm pre official name thm = thm |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
240 |
|> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name) |
26050 | 241 |
|> (if has_name_hint thm andalso pre orelse name = "" then I else put_name_hint name) |
242 |
|> Thm.map_tags (Position.default_properties (Position.thread_data ())); |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
243 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
244 |
fun name_thms pre official name xs = |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
245 |
map (uncurry (name_thm pre official)) (name_multi name xs); |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
246 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
247 |
fun name_thmss official name fact = |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
248 |
burrow_fact (name_thms true official name) fact; |
4853 | 249 |
|
250 |
||
11998 | 251 |
(* enter_thms *) |
4853 | 252 |
|
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
253 |
fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
254 |
| enter_thms pre_name post_name app_att (bname, thms) thy = |
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
255 |
let |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
256 |
val naming = Sign.naming_of thy; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
257 |
val name = NameSpace.full naming bname; |
16441 | 258 |
val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms)); |
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
259 |
val thms'' = map (Thm.transfer thy') thms'; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
260 |
val thy'' = thy' |> map_theorems (fn ((space, theorems), all_facts) => |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
261 |
let |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
262 |
val space' = NameSpace.declare naming name space; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
263 |
val theorems' = Symtab.update (name, thms'') theorems; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
264 |
val all_facts' = Facts.add_global naming (name, thms'') all_facts; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
265 |
in ((space', theorems'), all_facts') end); |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
266 |
in (thms'', thy'') end; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
267 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
268 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
269 |
(* store_thm(s) *) |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
270 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
271 |
val store_thms = enter_thms (name_thms true true) (name_thms false true) I; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
272 |
fun store_thm (name, th) = store_thms (name, [th]) #>> the_single; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
273 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
274 |
fun store_thm_open (name, th) = |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
275 |
enter_thms (name_thms true false) (name_thms false false) I (name, [th]) #>> the_single; |
3987 | 276 |
|
16023
66561f6814bd
added string_of_thmref, selections, fact_index_of, valid_thms;
wenzelm
parents:
15975
diff
changeset
|
277 |
|
6091 | 278 |
(* add_thms(s) *) |
4853 | 279 |
|
16441 | 280 |
fun add_thms_atts pre_name ((bname, thms), atts) = |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
281 |
enter_thms pre_name (name_thms false true) |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
282 |
(foldl_map (Thm.theory_attributes atts)) (bname, thms); |
4853 | 283 |
|
18377 | 284 |
fun gen_add_thmss pre_name = |
285 |
fold_map (add_thms_atts pre_name); |
|
5907 | 286 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
287 |
fun gen_add_thms pre_name args = |
18377 | 288 |
apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args); |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
289 |
|
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
290 |
val add_thmss = gen_add_thmss (name_thms true true); |
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
291 |
val add_thms = gen_add_thms (name_thms true true); |
5907 | 292 |
|
293 |
||
26488
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
294 |
(* add_thms_dynamic *) |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
295 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
296 |
fun add_thms_dynamic (bname, f) thy = |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
297 |
let |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
298 |
val name = Sign.full_name thy bname; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
299 |
val thy' = thy |> map_theorems (fn (theorems, all_facts) => |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
300 |
(theorems, Facts.add_dynamic (Sign.naming_of thy) (name, f) all_facts)); |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
301 |
in thy' end; |
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
302 |
|
b497e3187ec7
eliminated destructive/critical theorem database;
wenzelm
parents:
26471
diff
changeset
|
303 |
|
14564 | 304 |
(* note_thmss(_i) *) |
5907 | 305 |
|
9192 | 306 |
local |
12711 | 307 |
|
25981 | 308 |
fun gen_note_thmss get tag = fold_map (fn ((bname, more_atts), ths_atts) => fn thy => |
12711 | 309 |
let |
18728 | 310 |
fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths); |
18418
bf448d999b7e
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18377
diff
changeset
|
311 |
val (thms, thy') = thy |> enter_thms |
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
21606
diff
changeset
|
312 |
(name_thmss true) (name_thms false true) (apsnd flat o foldl_map app) |
25981 | 313 |
(bname, map (fn (ths, atts) => (get thy ths, surround tag (atts @ more_atts))) ths_atts); |
18801 | 314 |
in ((bname, thms), thy') end); |
12711 | 315 |
|
9192 | 316 |
in |
12711 | 317 |
|
26344
04dacc6809b6
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26336
diff
changeset
|
318 |
fun note_thmss k = gen_note_thmss get_fact (kind k); |
25981 | 319 |
fun note_thmss_i k = gen_note_thmss (K I) (kind k); |
320 |
fun note_thmss_grouped k g = gen_note_thmss (K I) (kind k #> group g); |
|
12711 | 321 |
|
21438 | 322 |
end; |
323 |
||
25598 | 324 |
fun note kind (name, thm) = |
325 |
note_thmss_i kind [((name, []), [([thm], [])])] |
|
326 |
#>> (fn [(_, [thm])] => thm); |
|
327 |
||
18801 | 328 |
fun note_thmss_qualified k path facts thy = |
329 |
thy |
|
22796 | 330 |
|> Sign.add_path path |
331 |
|> Sign.no_base_names |
|
18801 | 332 |
|> note_thmss_i k facts |
22796 | 333 |
||> Sign.restore_naming thy; |
18801 | 334 |
|
5280 | 335 |
|
16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
336 |
(* forall_elim_var(s) -- belongs to drule.ML *) |
7899 | 337 |
|
16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
338 |
fun forall_elim_vars_aux strip_vars i th = |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
339 |
let |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
340 |
val {thy, tpairs, prop, ...} = Thm.rep_thm th; |
16787 | 341 |
val add_used = Term.fold_aterms |
20853 | 342 |
(fn Var ((x, j), _) => if i = j then insert (op =) x else I | _ => I); |
16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
343 |
val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []); |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
344 |
val vars = strip_vars prop; |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20057
diff
changeset
|
345 |
val cvars = (Name.variant_list used (map #1 vars), vars) |
16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
346 |
|> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T))); |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
347 |
in fold Thm.forall_elim cvars th end; |
7899 | 348 |
|
16722
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
349 |
val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars; |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
350 |
|
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
351 |
fun forall_elim_var i th = forall_elim_vars_aux |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
352 |
(fn Const ("all", _) $ Abs (a, T, _) => [(a, T)] |
040728f6a103
tuned forall_elim_var(s): avoid expensive Term.add_vars;
wenzelm
parents:
16536
diff
changeset
|
353 |
| _ => raise THM ("forall_elim_vars", i, [th])) i th; |
7899 | 354 |
|
355 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
356 |
(* store axioms as theorems *) |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
357 |
|
4853 | 358 |
local |
17418 | 359 |
fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name); |
360 |
fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs; |
|
26553 | 361 |
fun add_axm add = fold_map (fn ((name, ax), atts) => fn thy => |
4853 | 362 |
let |
11998 | 363 |
val named_ax = [(name, ax)]; |
7753 | 364 |
val thy' = add named_ax thy; |
365 |
val thm = hd (get_axs thy' named_ax); |
|
26553 | 366 |
in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end); |
4853 | 367 |
in |
26553 | 368 |
val add_axioms = add_axm Theory.add_axioms; |
369 |
val add_axioms_i = add_axm Theory.add_axioms_i; |
|
370 |
val add_defs = add_axm o Theory.add_defs false; |
|
371 |
val add_defs_i = add_axm o Theory.add_defs_i false; |
|
372 |
val add_defs_unchecked = add_axm o Theory.add_defs true; |
|
373 |
val add_defs_unchecked_i = add_axm o Theory.add_defs_i true; |
|
4853 | 374 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
375 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
376 |
|
3987 | 377 |
|
26430 | 378 |
(*** Pure theory syntax and logical content ***) |
3987 | 379 |
|
24243 | 380 |
val typ = SimpleSyntax.read_typ; |
381 |
val term = SimpleSyntax.read_term; |
|
382 |
val prop = SimpleSyntax.read_prop; |
|
383 |
||
26463 | 384 |
val _ = Context.>> (Context.map_theory |
26430 | 385 |
(Sign.add_types |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
386 |
[("fun", 2, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
387 |
("prop", 0, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
388 |
("itself", 1, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
389 |
("dummy", 0, NoSyn)] |
26430 | 390 |
#> Sign.add_nonterminals Syntax.basic_nonterms |
391 |
#> Sign.add_syntax_i |
|
26436 | 392 |
[("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3%_./ _)", [0, 3], 3)), |
393 |
("_abs", typ "'a", NoSyn), |
|
394 |
("", typ "'a => args", Delimfix "_"), |
|
395 |
("_args", typ "'a => args => args", Delimfix "_,/ _"), |
|
396 |
("", typ "id => idt", Delimfix "_"), |
|
397 |
("_idtdummy", typ "idt", Delimfix "'_"), |
|
398 |
("_idtyp", typ "id => type => idt", Mixfix ("_::_", [], 0)), |
|
399 |
("_idtypdummy", typ "type => idt", Mixfix ("'_()::_", [], 0)), |
|
400 |
("", typ "idt => idt", Delimfix "'(_')"), |
|
401 |
("", typ "idt => idts", Delimfix "_"), |
|
402 |
("_idts", typ "idt => idts => idts", Mixfix ("_/ _", [1, 0], 0)), |
|
403 |
("", typ "idt => pttrn", Delimfix "_"), |
|
404 |
("", typ "pttrn => pttrns", Delimfix "_"), |
|
405 |
("_pttrns", typ "pttrn => pttrns => pttrns", Mixfix ("_/ _", [1, 0], 0)), |
|
406 |
("", typ "id => aprop", Delimfix "_"), |
|
407 |
("", typ "longid => aprop", Delimfix "_"), |
|
408 |
("", typ "var => aprop", Delimfix "_"), |
|
409 |
("_DDDOT", typ "aprop", Delimfix "..."), |
|
410 |
("_aprop", typ "aprop => prop", Delimfix "PROP _"), |
|
411 |
("_asm", typ "prop => asms", Delimfix "_"), |
|
412 |
("_asms", typ "prop => asms => asms", Delimfix "_;/ _"), |
|
413 |
("_bigimpl", typ "asms => prop => prop", Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)), |
|
414 |
("_ofclass", typ "type => logic => prop", Delimfix "(1OFCLASS/(1'(_,/ _')))"), |
|
415 |
("_mk_ofclass", typ "dummy", NoSyn), |
|
416 |
("_TYPE", typ "type => logic", Delimfix "(1TYPE/(1'(_')))"), |
|
417 |
("", typ "id => logic", Delimfix "_"), |
|
418 |
("", typ "longid => logic", Delimfix "_"), |
|
419 |
("", typ "var => logic", Delimfix "_"), |
|
420 |
("_DDDOT", typ "logic", Delimfix "..."), |
|
421 |
("_constify", typ "num => num_const", Delimfix "_"), |
|
422 |
("_indexnum", typ "num_const => index", Delimfix "\\<^sub>_"), |
|
423 |
("_index", typ "logic => index", Delimfix "(00\\<^bsub>_\\<^esub>)"), |
|
424 |
("_indexdefault", typ "index", Delimfix ""), |
|
425 |
("_indexvar", typ "index", Delimfix "'\\<index>"), |
|
426 |
("_struct", typ "index => logic", Mixfix ("\\<struct>_", [1000], 1000)), |
|
427 |
("==>", typ "prop => prop => prop", Delimfix "op ==>"), |
|
428 |
(Term.dummy_patternN, typ "aprop", Delimfix "'_"), |
|
429 |
("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)), |
|
430 |
("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))] |
|
26430 | 431 |
#> Sign.add_modesyntax_i (Symbol.xsymbolsN, true) |
24243 | 432 |
[("fun", typ "type => type => type", Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)), |
433 |
("_bracket", typ "types => type => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)), |
|
434 |
("_ofsort", typ "tid => sort => type", Mixfix ("_\\<Colon>_", [1000, 0], 1000)), |
|
435 |
("_constrain", typ "'a => type => 'a", Mixfix ("_\\<Colon>_", [4, 0], 3)), |
|
436 |
("_idtyp", typ "id => type => idt", Mixfix ("_\\<Colon>_", [], 0)), |
|
437 |
("_idtypdummy", typ "type => idt", Mixfix ("'_()\\<Colon>_", [], 0)), |
|
438 |
("_type_constraint_", typ "'a", NoSyn), |
|
439 |
("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)), |
|
440 |
("==", typ "'a => 'a => prop", InfixrName ("\\<equiv>", 2)), |
|
441 |
("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)), |
|
442 |
("==>", typ "prop => prop => prop", InfixrName ("\\<Longrightarrow>", 1)), |
|
443 |
("_DDDOT", typ "aprop", Delimfix "\\<dots>"), |
|
444 |
("_bigimpl", typ "asms => prop => prop", Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)), |
|
445 |
("_DDDOT", typ "logic", Delimfix "\\<dots>")] |
|
26430 | 446 |
#> Sign.add_modesyntax_i ("", false) |
24243 | 447 |
[("prop", typ "prop => prop", Mixfix ("_", [0], 0)), |
26430 | 448 |
("Pure.term", typ "'a => prop", Delimfix "TERM _"), |
449 |
("Pure.conjunction", typ "prop => prop => prop", InfixrName ("&&", 2))] |
|
450 |
#> Sign.add_modesyntax_i ("HTML", false) |
|
24243 | 451 |
[("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))] |
26430 | 452 |
#> Sign.add_consts_i |
24243 | 453 |
[("==", typ "'a => 'a => prop", InfixrName ("==", 2)), |
454 |
("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), |
|
455 |
("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)), |
|
456 |
("prop", typ "prop => prop", NoSyn), |
|
457 |
("TYPE", typ "'a itself", NoSyn), |
|
458 |
(Term.dummy_patternN, typ "'a", Delimfix "'_")] |
|
26430 | 459 |
#> Theory.add_deps "==" ("==", typ "'a => 'a => prop") [] |
460 |
#> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") [] |
|
461 |
#> Theory.add_deps "all" ("all", typ "('a => prop) => prop") [] |
|
462 |
#> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") [] |
|
463 |
#> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") [] |
|
464 |
#> Sign.add_trfuns Syntax.pure_trfuns |
|
465 |
#> Sign.add_trfunsT Syntax.pure_trfunsT |
|
466 |
#> Sign.local_path |
|
467 |
#> Sign.add_consts_i |
|
24243 | 468 |
[("term", typ "'a => prop", NoSyn), |
469 |
("conjunction", typ "prop => prop => prop", NoSyn)] |
|
26430 | 470 |
#> (add_defs_i false o map Thm.no_attributes) |
24243 | 471 |
[("prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"), |
26430 | 472 |
("term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"), |
473 |
("conjunction_def", prop "(A && B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd |
|
474 |
#> Sign.hide_consts false ["conjunction", "term"] |
|
475 |
#> add_thmss [(("nothing", []), [])] #> snd |
|
26463 | 476 |
#> Theory.add_axioms_i Proofterm.equality_axms)); |
3987 | 477 |
|
478 |
end; |
|
479 |