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