author | berghofe |
Mon, 14 Aug 2006 11:26:10 +0200 | |
changeset 20377 | 3baf326b2b5f |
parent 20179 | a2f3f523c84b |
child 21289 | 920b7b893d9c |
permissions | -rw-r--r-- |
19494 | 1 |
(* Title: HOL/Nominal/nominal_atoms.ML |
2 |
ID: $Id$ |
|
3 |
Author: Christian Urban and Stefan Berghofer, TU Muenchen |
|
4 |
||
5 |
Declaration of atom types to be used in nominal datatypes. |
|
6 |
*) |
|
18068 | 7 |
|
8 |
signature NOMINAL_ATOMS = |
|
9 |
sig |
|
10 |
val create_nom_typedecls : string list -> theory -> theory |
|
11 |
val atoms_of : theory -> string list |
|
12 |
val mk_permT : typ -> typ |
|
18746
a4ece70964ae
made the change for setup-functions not returning functions
urbanc
parents:
18707
diff
changeset
|
13 |
val setup : theory -> theory |
18068 | 14 |
end |
15 |
||
16 |
structure NominalAtoms : NOMINAL_ATOMS = |
|
17 |
struct |
|
18 |
||
19 |
(* data kind 'HOL/nominal' *) |
|
20 |
||
21 |
structure NominalArgs = |
|
22 |
struct |
|
23 |
val name = "HOL/nominal"; |
|
24 |
type T = unit Symtab.table; |
|
25 |
||
26 |
val empty = Symtab.empty; |
|
27 |
val copy = I; |
|
28 |
val extend = I; |
|
29 |
fun merge _ x = Symtab.merge (K true) x; |
|
30 |
||
31 |
fun print sg tab = (); |
|
32 |
end; |
|
33 |
||
34 |
structure NominalData = TheoryDataFun(NominalArgs); |
|
35 |
||
36 |
fun atoms_of thy = map fst (Symtab.dest (NominalData.get thy)); |
|
37 |
||
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
38 |
fun mk_permT T = HOLogic.listT (HOLogic.mk_prodT (T, T)); |
18068 | 39 |
|
40 |
fun mk_Cons x xs = |
|
41 |
let val T = fastype_of x |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
42 |
in Const ("List.list.Cons", T --> HOLogic.listT T --> HOLogic.listT T) $ x $ xs end; |
18068 | 43 |
|
44 |
||
45 |
(* this function sets up all matters related to atom- *) |
|
46 |
(* kinds; the user specifies a list of atom-kind names *) |
|
47 |
(* atom_decl <ak1> ... <akn> *) |
|
48 |
fun create_nom_typedecls ak_names thy = |
|
49 |
let |
|
50 |
(* declares a type-decl for every atom-kind: *) |
|
51 |
(* that is typedecl <ak> *) |
|
52 |
val thy1 = TypedefPackage.add_typedecls (map (fn x => (x,[],NoSyn)) ak_names) thy; |
|
53 |
||
54 |
(* produces a list consisting of pairs: *) |
|
55 |
(* fst component is the atom-kind name *) |
|
56 |
(* snd component is its type *) |
|
57 |
val full_ak_names = map (Sign.intern_type (sign_of thy1)) ak_names; |
|
58 |
val ak_names_types = ak_names ~~ map (Type o rpair []) full_ak_names; |
|
59 |
||
60 |
(* adds for every atom-kind an axiom *) |
|
61 |
(* <ak>_infinite: infinite (UNIV::<ak_type> set) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
62 |
val (inf_axs,thy2) = PureThy.add_axioms_i (map (fn (ak_name, T) => |
18068 | 63 |
let |
20179 | 64 |
val name = ak_name ^ "_infinite" |
18068 | 65 |
val axiom = HOLogic.mk_Trueprop (HOLogic.mk_not |
66 |
(HOLogic.mk_mem (HOLogic.mk_UNIV T, |
|
67 |
Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT T))))) |
|
68 |
in |
|
20179 | 69 |
((name, axiom), []) |
18068 | 70 |
end) ak_names_types) thy1; |
71 |
||
72 |
(* declares a swapping function for every atom-kind, it is *) |
|
73 |
(* const swap_<ak> :: <akT> * <akT> => <akT> => <akT> *) |
|
74 |
(* swap_<ak> (a,b) c = (if a=c then b (else if b=c then a else c)) *) |
|
75 |
(* overloades then the general swap-function *) |
|
20179 | 76 |
val (swap_eqs, thy3) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 77 |
let |
78 |
val swapT = HOLogic.mk_prodT (T, T) --> T --> T; |
|
79 |
val swap_name = Sign.full_name (sign_of thy) ("swap_" ^ ak_name); |
|
80 |
val a = Free ("a", T); |
|
81 |
val b = Free ("b", T); |
|
82 |
val c = Free ("c", T); |
|
83 |
val ab = Free ("ab", HOLogic.mk_prodT (T, T)) |
|
84 |
val cif = Const ("HOL.If", HOLogic.boolT --> T --> T --> T); |
|
85 |
val cswap_akname = Const (swap_name, swapT); |
|
19494 | 86 |
val cswap = Const ("Nominal.swap", swapT) |
18068 | 87 |
|
88 |
val name = "swap_"^ak_name^"_def"; |
|
89 |
val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
20179 | 90 |
(cswap_akname $ HOLogic.mk_prod (a,b) $ c, |
18068 | 91 |
cif $ HOLogic.mk_eq (a,c) $ b $ (cif $ HOLogic.mk_eq (b,c) $ a $ c))) |
92 |
val def2 = Logic.mk_equals (cswap $ ab $ c, cswap_akname $ ab $ c) |
|
93 |
in |
|
94 |
thy |> Theory.add_consts_i [("swap_" ^ ak_name, swapT, NoSyn)] |
|
20179 | 95 |
|> PureThy.add_defs_unchecked_i true [((name, def2),[])] |
96 |
|> snd |
|
97 |
|> PrimrecPackage.add_primrec_unchecked_i "" [(("", def1),[])] |
|
98 |
end) ak_names_types thy2; |
|
18068 | 99 |
|
100 |
(* declares a permutation function for every atom-kind acting *) |
|
101 |
(* on such atoms *) |
|
102 |
(* const <ak>_prm_<ak> :: (<akT> * <akT>)list => akT => akT *) |
|
103 |
(* <ak>_prm_<ak> [] a = a *) |
|
104 |
(* <ak>_prm_<ak> (x#xs) a = swap_<ak> x (perm xs a) *) |
|
20179 | 105 |
val (prm_eqs, thy4) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 106 |
let |
107 |
val swapT = HOLogic.mk_prodT (T, T) --> T --> T; |
|
108 |
val swap_name = Sign.full_name (sign_of thy) ("swap_" ^ ak_name) |
|
109 |
val prmT = mk_permT T --> T --> T; |
|
110 |
val prm_name = ak_name ^ "_prm_" ^ ak_name; |
|
111 |
val qu_prm_name = Sign.full_name (sign_of thy) prm_name; |
|
112 |
val x = Free ("x", HOLogic.mk_prodT (T, T)); |
|
113 |
val xs = Free ("xs", mk_permT T); |
|
114 |
val a = Free ("a", T) ; |
|
115 |
||
116 |
val cnil = Const ("List.list.Nil", mk_permT T); |
|
117 |
||
118 |
val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq (Const (qu_prm_name, prmT) $ cnil $ a, a)); |
|
119 |
||
120 |
val def2 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
121 |
(Const (qu_prm_name, prmT) $ mk_Cons x xs $ a, |
|
122 |
Const (swap_name, swapT) $ x $ (Const (qu_prm_name, prmT) $ xs $ a))); |
|
123 |
in |
|
124 |
thy |> Theory.add_consts_i [(prm_name, mk_permT T --> T --> T, NoSyn)] |
|
19635 | 125 |
|> PrimrecPackage.add_primrec_unchecked_i "" [(("", def1), []),(("", def2), [])] |
20179 | 126 |
end) ak_names_types thy3; |
18068 | 127 |
|
128 |
(* defines permutation functions for all combinations of atom-kinds; *) |
|
129 |
(* there are a trivial cases and non-trivial cases *) |
|
130 |
(* non-trivial case: *) |
|
131 |
(* <ak>_prm_<ak>_def: perm pi a == <ak>_prm_<ak> pi a *) |
|
132 |
(* trivial case with <ak> != <ak'> *) |
|
133 |
(* <ak>_prm<ak'>_def[simp]: perm pi a == a *) |
|
134 |
(* *) |
|
135 |
(* the trivial cases are added to the simplifier, while the non- *) |
|
136 |
(* have their own rules proved below *) |
|
18366 | 137 |
val (perm_defs, thy5) = fold_map (fn (ak_name, T) => fn thy => |
138 |
fold_map (fn (ak_name', T') => fn thy' => |
|
18068 | 139 |
let |
140 |
val perm_def_name = ak_name ^ "_prm_" ^ ak_name'; |
|
141 |
val pi = Free ("pi", mk_permT T); |
|
142 |
val a = Free ("a", T'); |
|
19494 | 143 |
val cperm = Const ("Nominal.perm", mk_permT T --> T' --> T'); |
18068 | 144 |
val cperm_def = Const (Sign.full_name (sign_of thy') perm_def_name, mk_permT T --> T' --> T'); |
145 |
||
146 |
val name = ak_name ^ "_prm_" ^ ak_name' ^ "_def"; |
|
147 |
val def = Logic.mk_equals |
|
148 |
(cperm $ pi $ a, if ak_name = ak_name' then cperm_def $ pi $ a else a) |
|
149 |
in |
|
19635 | 150 |
PureThy.add_defs_unchecked_i true [((name, def),[])] thy' |
18366 | 151 |
end) ak_names_types thy) ak_names_types thy4; |
18068 | 152 |
|
153 |
(* proves that every atom-kind is an instance of at *) |
|
154 |
(* lemma at_<ak>_inst: *) |
|
155 |
(* at TYPE(<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
156 |
val (prm_cons_thms,thy6) = |
18068 | 157 |
thy5 |> PureThy.add_thms (map (fn (ak_name, T) => |
158 |
let |
|
159 |
val ak_name_qu = Sign.full_name (sign_of thy5) (ak_name); |
|
160 |
val i_type = Type(ak_name_qu,[]); |
|
19494 | 161 |
val cat = Const ("Nominal.at",(Term.itselfT i_type) --> HOLogic.boolT); |
18068 | 162 |
val at_type = Logic.mk_type i_type; |
163 |
val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy5 |
|
164 |
[Name "at_def", |
|
165 |
Name (ak_name ^ "_prm_" ^ ak_name ^ "_def"), |
|
166 |
Name (ak_name ^ "_prm_" ^ ak_name ^ ".simps"), |
|
167 |
Name ("swap_" ^ ak_name ^ "_def"), |
|
168 |
Name ("swap_" ^ ak_name ^ ".simps"), |
|
169 |
Name (ak_name ^ "_infinite")] |
|
170 |
||
171 |
val name = "at_"^ak_name^ "_inst"; |
|
172 |
val statement = HOLogic.mk_Trueprop (cat $ at_type); |
|
173 |
||
174 |
val proof = fn _ => auto_tac (claset(),simp_s); |
|
175 |
||
176 |
in |
|
20046 | 177 |
((name, Goal.prove_global thy5 [] [] statement proof), []) |
18068 | 178 |
end) ak_names_types); |
179 |
||
180 |
(* declares a perm-axclass for every atom-kind *) |
|
181 |
(* axclass pt_<ak> *) |
|
182 |
(* pt_<ak>1[simp]: perm [] x = x *) |
|
183 |
(* pt_<ak>2: perm (pi1@pi2) x = perm pi1 (perm pi2 x) *) |
|
184 |
(* pt_<ak>3: pi1 ~ pi2 ==> perm pi1 x = perm pi2 x *) |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
185 |
val (pt_ax_classes,thy7) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 186 |
let |
187 |
val cl_name = "pt_"^ak_name; |
|
188 |
val ty = TFree("'a",["HOL.type"]); |
|
189 |
val x = Free ("x", ty); |
|
190 |
val pi1 = Free ("pi1", mk_permT T); |
|
191 |
val pi2 = Free ("pi2", mk_permT T); |
|
19494 | 192 |
val cperm = Const ("Nominal.perm", mk_permT T --> ty --> ty); |
18068 | 193 |
val cnil = Const ("List.list.Nil", mk_permT T); |
194 |
val cappend = Const ("List.op @",mk_permT T --> mk_permT T --> mk_permT T); |
|
19494 | 195 |
val cprm_eq = Const ("Nominal.prm_eq",mk_permT T --> mk_permT T --> HOLogic.boolT); |
18068 | 196 |
(* nil axiom *) |
197 |
val axiom1 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
198 |
(cperm $ cnil $ x, x)); |
|
199 |
(* append axiom *) |
|
200 |
val axiom2 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
201 |
(cperm $ (cappend $ pi1 $ pi2) $ x, cperm $ pi1 $ (cperm $ pi2 $ x))); |
|
202 |
(* perm-eq axiom *) |
|
203 |
val axiom3 = Logic.mk_implies |
|
204 |
(HOLogic.mk_Trueprop (cprm_eq $ pi1 $ pi2), |
|
205 |
HOLogic.mk_Trueprop (HOLogic.mk_eq (cperm $ pi1 $ x, cperm $ pi2 $ x))); |
|
206 |
in |
|
19509 | 207 |
AxClass.define_class_i (cl_name, ["HOL.type"]) [] |
19488 | 208 |
[((cl_name ^ "1", [Simplifier.simp_add]), [axiom1]), |
209 |
((cl_name ^ "2", []), [axiom2]), |
|
210 |
((cl_name ^ "3", []), [axiom3])] thy |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
211 |
end) ak_names_types thy6; |
18068 | 212 |
|
213 |
(* proves that every pt_<ak>-type together with <ak>-type *) |
|
214 |
(* instance of pt *) |
|
215 |
(* lemma pt_<ak>_inst: *) |
|
216 |
(* pt TYPE('x::pt_<ak>) TYPE(<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
217 |
val (prm_inst_thms,thy8) = |
18068 | 218 |
thy7 |> PureThy.add_thms (map (fn (ak_name, T) => |
219 |
let |
|
220 |
val ak_name_qu = Sign.full_name (sign_of thy7) (ak_name); |
|
221 |
val pt_name_qu = Sign.full_name (sign_of thy7) ("pt_"^ak_name); |
|
222 |
val i_type1 = TFree("'x",[pt_name_qu]); |
|
223 |
val i_type2 = Type(ak_name_qu,[]); |
|
19494 | 224 |
val cpt = Const ("Nominal.pt",(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
18068 | 225 |
val pt_type = Logic.mk_type i_type1; |
226 |
val at_type = Logic.mk_type i_type2; |
|
227 |
val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy7 |
|
228 |
[Name "pt_def", |
|
229 |
Name ("pt_" ^ ak_name ^ "1"), |
|
230 |
Name ("pt_" ^ ak_name ^ "2"), |
|
231 |
Name ("pt_" ^ ak_name ^ "3")]; |
|
232 |
||
233 |
val name = "pt_"^ak_name^ "_inst"; |
|
234 |
val statement = HOLogic.mk_Trueprop (cpt $ pt_type $ at_type); |
|
235 |
||
236 |
val proof = fn _ => auto_tac (claset(),simp_s); |
|
237 |
in |
|
20046 | 238 |
((name, Goal.prove_global thy7 [] [] statement proof), []) |
18068 | 239 |
end) ak_names_types); |
240 |
||
241 |
(* declares an fs-axclass for every atom-kind *) |
|
242 |
(* axclass fs_<ak> *) |
|
243 |
(* fs_<ak>1: finite ((supp x)::<ak> set) *) |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
244 |
val (fs_ax_classes,thy11) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 245 |
let |
246 |
val cl_name = "fs_"^ak_name; |
|
247 |
val pt_name = Sign.full_name (sign_of thy) ("pt_"^ak_name); |
|
248 |
val ty = TFree("'a",["HOL.type"]); |
|
249 |
val x = Free ("x", ty); |
|
19494 | 250 |
val csupp = Const ("Nominal.supp", ty --> HOLogic.mk_setT T); |
18068 | 251 |
val cfinites = Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT T)) |
252 |
||
253 |
val axiom1 = HOLogic.mk_Trueprop (HOLogic.mk_mem (csupp $ x, cfinites)); |
|
254 |
||
255 |
in |
|
19509 | 256 |
AxClass.define_class_i (cl_name, [pt_name]) [] [((cl_name ^ "1", []), [axiom1])] thy |
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
257 |
end) ak_names_types thy8; |
18068 | 258 |
|
259 |
(* proves that every fs_<ak>-type together with <ak>-type *) |
|
260 |
(* instance of fs-type *) |
|
261 |
(* lemma abst_<ak>_inst: *) |
|
262 |
(* fs TYPE('x::pt_<ak>) TYPE (<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
263 |
val (fs_inst_thms,thy12) = |
18068 | 264 |
thy11 |> PureThy.add_thms (map (fn (ak_name, T) => |
265 |
let |
|
266 |
val ak_name_qu = Sign.full_name (sign_of thy11) (ak_name); |
|
267 |
val fs_name_qu = Sign.full_name (sign_of thy11) ("fs_"^ak_name); |
|
268 |
val i_type1 = TFree("'x",[fs_name_qu]); |
|
269 |
val i_type2 = Type(ak_name_qu,[]); |
|
19494 | 270 |
val cfs = Const ("Nominal.fs", |
18068 | 271 |
(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
272 |
val fs_type = Logic.mk_type i_type1; |
|
273 |
val at_type = Logic.mk_type i_type2; |
|
274 |
val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy11 |
|
275 |
[Name "fs_def", |
|
276 |
Name ("fs_" ^ ak_name ^ "1")]; |
|
277 |
||
278 |
val name = "fs_"^ak_name^ "_inst"; |
|
279 |
val statement = HOLogic.mk_Trueprop (cfs $ fs_type $ at_type); |
|
280 |
||
281 |
val proof = fn _ => auto_tac (claset(),simp_s); |
|
282 |
in |
|
20046 | 283 |
((name, Goal.prove_global thy11 [] [] statement proof), []) |
18068 | 284 |
end) ak_names_types); |
285 |
||
286 |
(* declares for every atom-kind combination an axclass *) |
|
287 |
(* cp_<ak1>_<ak2> giving a composition property *) |
|
288 |
(* cp_<ak1>_<ak2>1: pi1 o pi2 o x = (pi1 o pi2) o (pi1 o x) *) |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
289 |
val (_,thy12b) = fold_map (fn (ak_name, T) => fn thy => |
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
290 |
fold_map (fn (ak_name', T') => fn thy' => |
18068 | 291 |
let |
292 |
val cl_name = "cp_"^ak_name^"_"^ak_name'; |
|
293 |
val ty = TFree("'a",["HOL.type"]); |
|
294 |
val x = Free ("x", ty); |
|
295 |
val pi1 = Free ("pi1", mk_permT T); |
|
296 |
val pi2 = Free ("pi2", mk_permT T'); |
|
19494 | 297 |
val cperm1 = Const ("Nominal.perm", mk_permT T --> ty --> ty); |
298 |
val cperm2 = Const ("Nominal.perm", mk_permT T' --> ty --> ty); |
|
299 |
val cperm3 = Const ("Nominal.perm", mk_permT T --> mk_permT T' --> mk_permT T'); |
|
18068 | 300 |
|
301 |
val ax1 = HOLogic.mk_Trueprop |
|
302 |
(HOLogic.mk_eq (cperm1 $ pi1 $ (cperm2 $ pi2 $ x), |
|
303 |
cperm2 $ (cperm3 $ pi1 $ pi2) $ (cperm1 $ pi1 $ x))); |
|
304 |
in |
|
19509 | 305 |
AxClass.define_class_i (cl_name, ["HOL.type"]) [] [((cl_name ^ "1", []), [ax1])] thy' |
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
306 |
end) ak_names_types thy) ak_names_types thy12; |
18068 | 307 |
|
308 |
(* proves for every <ak>-combination a cp_<ak1>_<ak2>_inst theorem; *) |
|
309 |
(* lemma cp_<ak1>_<ak2>_inst: *) |
|
310 |
(* cp TYPE('a::cp_<ak1>_<ak2>) TYPE(<ak1>) TYPE(<ak2>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
311 |
val (cp_thms,thy12c) = fold_map (fn (ak_name, T) => fn thy => |
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
312 |
fold_map (fn (ak_name', T') => fn thy' => |
18068 | 313 |
let |
314 |
val ak_name_qu = Sign.full_name (sign_of thy') (ak_name); |
|
315 |
val ak_name_qu' = Sign.full_name (sign_of thy') (ak_name'); |
|
316 |
val cp_name_qu = Sign.full_name (sign_of thy') ("cp_"^ak_name^"_"^ak_name'); |
|
317 |
val i_type0 = TFree("'a",[cp_name_qu]); |
|
318 |
val i_type1 = Type(ak_name_qu,[]); |
|
319 |
val i_type2 = Type(ak_name_qu',[]); |
|
19494 | 320 |
val ccp = Const ("Nominal.cp", |
18068 | 321 |
(Term.itselfT i_type0)-->(Term.itselfT i_type1)--> |
322 |
(Term.itselfT i_type2)-->HOLogic.boolT); |
|
323 |
val at_type = Logic.mk_type i_type1; |
|
324 |
val at_type' = Logic.mk_type i_type2; |
|
325 |
val cp_type = Logic.mk_type i_type0; |
|
326 |
val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy' [(Name "cp_def")]; |
|
327 |
val cp1 = PureThy.get_thm thy' (Name ("cp_"^ak_name^"_"^ak_name'^"1")); |
|
328 |
||
329 |
val name = "cp_"^ak_name^ "_"^ak_name'^"_inst"; |
|
330 |
val statement = HOLogic.mk_Trueprop (ccp $ cp_type $ at_type $ at_type'); |
|
331 |
||
332 |
val proof = fn _ => EVERY [auto_tac (claset(),simp_s), rtac cp1 1]; |
|
333 |
in |
|
20046 | 334 |
PureThy.add_thms [((name, Goal.prove_global thy' [] [] statement proof), [])] thy' |
18068 | 335 |
end) |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
336 |
ak_names_types thy) ak_names_types thy12b; |
18068 | 337 |
|
338 |
(* proves for every non-trivial <ak>-combination a disjointness *) |
|
339 |
(* theorem; i.e. <ak1> != <ak2> *) |
|
340 |
(* lemma ds_<ak1>_<ak2>: *) |
|
341 |
(* dj TYPE(<ak1>) TYPE(<ak2>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
342 |
val (dj_thms, thy12d) = fold_map (fn (ak_name,T) => fn thy => |
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
343 |
fold_map (fn (ak_name',T') => fn thy' => |
18068 | 344 |
(if not (ak_name = ak_name') |
345 |
then |
|
346 |
let |
|
347 |
val ak_name_qu = Sign.full_name (sign_of thy') (ak_name); |
|
348 |
val ak_name_qu' = Sign.full_name (sign_of thy') (ak_name'); |
|
349 |
val i_type1 = Type(ak_name_qu,[]); |
|
350 |
val i_type2 = Type(ak_name_qu',[]); |
|
19494 | 351 |
val cdj = Const ("Nominal.disjoint", |
18068 | 352 |
(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
353 |
val at_type = Logic.mk_type i_type1; |
|
354 |
val at_type' = Logic.mk_type i_type2; |
|
355 |
val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy' |
|
356 |
[Name "disjoint_def", |
|
357 |
Name (ak_name^"_prm_"^ak_name'^"_def"), |
|
358 |
Name (ak_name'^"_prm_"^ak_name^"_def")]; |
|
359 |
||
360 |
val name = "dj_"^ak_name^"_"^ak_name'; |
|
361 |
val statement = HOLogic.mk_Trueprop (cdj $ at_type $ at_type'); |
|
362 |
||
363 |
val proof = fn _ => auto_tac (claset(),simp_s); |
|
364 |
in |
|
20046 | 365 |
PureThy.add_thms [((name, Goal.prove_global thy' [] [] statement proof), [])] thy' |
18068 | 366 |
end |
367 |
else |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
368 |
([],thy'))) (* do nothing branch, if ak_name = ak_name' *) |
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
369 |
ak_names_types thy) ak_names_types thy12c; |
18068 | 370 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
371 |
(******** pt_<ak> class instances ********) |
18068 | 372 |
(*=========================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
373 |
(* some abbreviations for theorems *) |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
374 |
val pt1 = thm "pt1"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
375 |
val pt2 = thm "pt2"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
376 |
val pt3 = thm "pt3"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
377 |
val at_pt_inst = thm "at_pt_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
378 |
val pt_set_inst = thm "pt_set_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
379 |
val pt_unit_inst = thm "pt_unit_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
380 |
val pt_prod_inst = thm "pt_prod_inst"; |
18600 | 381 |
val pt_nprod_inst = thm "pt_nprod_inst"; |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
382 |
val pt_list_inst = thm "pt_list_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
383 |
val pt_optn_inst = thm "pt_option_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
384 |
val pt_noptn_inst = thm "pt_noption_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
385 |
val pt_fun_inst = thm "pt_fun_inst"; |
18068 | 386 |
|
18435 | 387 |
(* for all atom-kind combinations <ak>/<ak'> show that *) |
388 |
(* every <ak> is an instance of pt_<ak'>; the proof for *) |
|
389 |
(* ak!=ak' is by definition; the case ak=ak' uses at_pt_inst. *) |
|
18431 | 390 |
val thy13 = fold (fn ak_name => fn thy => |
391 |
fold (fn ak_name' => fn thy' => |
|
392 |
let |
|
393 |
val qu_name = Sign.full_name (sign_of thy') ak_name'; |
|
394 |
val cls_name = Sign.full_name (sign_of thy') ("pt_"^ak_name); |
|
395 |
val at_inst = PureThy.get_thm thy' (Name ("at_"^ak_name'^"_inst")); |
|
396 |
||
19133
7e84a1a3741c
Adapted to Florian's recent changes to the AxClass package.
berghofe
parents:
18759
diff
changeset
|
397 |
val proof1 = EVERY [ClassPackage.intro_classes_tac [], |
18068 | 398 |
rtac ((at_inst RS at_pt_inst) RS pt1) 1, |
399 |
rtac ((at_inst RS at_pt_inst) RS pt2) 1, |
|
400 |
rtac ((at_inst RS at_pt_inst) RS pt3) 1, |
|
401 |
atac 1]; |
|
18431 | 402 |
val simp_s = HOL_basic_ss addsimps |
403 |
PureThy.get_thmss thy' [Name (ak_name^"_prm_"^ak_name'^"_def")]; |
|
19133
7e84a1a3741c
Adapted to Florian's recent changes to the AxClass package.
berghofe
parents:
18759
diff
changeset
|
404 |
val proof2 = EVERY [ClassPackage.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)]; |
18431 | 405 |
|
406 |
in |
|
407 |
thy' |
|
19275 | 408 |
|> AxClass.prove_arity (qu_name,[],[cls_name]) |
18431 | 409 |
(if ak_name = ak_name' then proof1 else proof2) |
410 |
end) ak_names thy) ak_names thy12c; |
|
18068 | 411 |
|
18430 | 412 |
(* show that *) |
413 |
(* fun(pt_<ak>,pt_<ak>) *) |
|
18579
002d371401f5
changed the name of the type "nOption" to "noption".
urbanc
parents:
18438
diff
changeset
|
414 |
(* noption(pt_<ak>) *) |
18430 | 415 |
(* option(pt_<ak>) *) |
416 |
(* list(pt_<ak>) *) |
|
417 |
(* *(pt_<ak>,pt_<ak>) *) |
|
18600 | 418 |
(* nprod(pt_<ak>,pt_<ak>) *) |
18430 | 419 |
(* unit *) |
420 |
(* set(pt_<ak>) *) |
|
421 |
(* are instances of pt_<ak> *) |
|
18431 | 422 |
val thy18 = fold (fn ak_name => fn thy => |
18068 | 423 |
let |
18430 | 424 |
val cls_name = Sign.full_name (sign_of thy) ("pt_"^ak_name); |
18068 | 425 |
val at_thm = PureThy.get_thm thy (Name ("at_"^ak_name^"_inst")); |
426 |
val pt_inst = PureThy.get_thm thy (Name ("pt_"^ak_name^"_inst")); |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
427 |
|
18430 | 428 |
fun pt_proof thm = |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
429 |
EVERY [ClassPackage.intro_classes_tac [], |
18430 | 430 |
rtac (thm RS pt1) 1, rtac (thm RS pt2) 1, rtac (thm RS pt3) 1, atac 1]; |
431 |
||
432 |
val pt_thm_fun = at_thm RS (pt_inst RS (pt_inst RS pt_fun_inst)); |
|
433 |
val pt_thm_noptn = pt_inst RS pt_noptn_inst; |
|
434 |
val pt_thm_optn = pt_inst RS pt_optn_inst; |
|
435 |
val pt_thm_list = pt_inst RS pt_list_inst; |
|
436 |
val pt_thm_prod = pt_inst RS (pt_inst RS pt_prod_inst); |
|
18600 | 437 |
val pt_thm_nprod = pt_inst RS (pt_inst RS pt_nprod_inst); |
18430 | 438 |
val pt_thm_unit = pt_unit_inst; |
439 |
val pt_thm_set = pt_inst RS pt_set_inst |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
440 |
in |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
441 |
thy |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
442 |
|> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_fun) |
19494 | 443 |
|> AxClass.prove_arity ("Nominal.noption",[[cls_name]],[cls_name]) (pt_proof pt_thm_noptn) |
19275 | 444 |
|> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (pt_proof pt_thm_optn) |
445 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (pt_proof pt_thm_list) |
|
446 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_prod) |
|
19494 | 447 |
|> AxClass.prove_arity ("Nominal.nprod",[[cls_name],[cls_name]],[cls_name]) |
18600 | 448 |
(pt_proof pt_thm_nprod) |
19275 | 449 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (pt_proof pt_thm_unit) |
450 |
|> AxClass.prove_arity ("set",[[cls_name]],[cls_name]) (pt_proof pt_thm_set) |
|
18430 | 451 |
end) ak_names thy13; |
18068 | 452 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
453 |
(******** fs_<ak> class instances ********) |
18068 | 454 |
(*=========================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
455 |
(* abbreviations for some lemmas *) |
18431 | 456 |
val fs1 = thm "fs1"; |
457 |
val fs_at_inst = thm "fs_at_inst"; |
|
458 |
val fs_unit_inst = thm "fs_unit_inst"; |
|
459 |
val fs_prod_inst = thm "fs_prod_inst"; |
|
18600 | 460 |
val fs_nprod_inst = thm "fs_nprod_inst"; |
18431 | 461 |
val fs_list_inst = thm "fs_list_inst"; |
462 |
val fs_option_inst = thm "fs_option_inst"; |
|
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
463 |
val dj_supp = thm "dj_supp" |
18068 | 464 |
|
465 |
(* shows that <ak> is an instance of fs_<ak> *) |
|
466 |
(* uses the theorem at_<ak>_inst *) |
|
18431 | 467 |
val thy20 = fold (fn ak_name => fn thy => |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
468 |
fold (fn ak_name' => fn thy' => |
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
469 |
let |
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
470 |
val qu_name = Sign.full_name (sign_of thy') ak_name'; |
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
471 |
val qu_class = Sign.full_name (sign_of thy') ("fs_"^ak_name); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
472 |
val proof = |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
473 |
(if ak_name = ak_name' |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
474 |
then |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
475 |
let val at_thm = PureThy.get_thm thy' (Name ("at_"^ak_name^"_inst")); |
19133
7e84a1a3741c
Adapted to Florian's recent changes to the AxClass package.
berghofe
parents:
18759
diff
changeset
|
476 |
in EVERY [ClassPackage.intro_classes_tac [], |
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
477 |
rtac ((at_thm RS fs_at_inst) RS fs1) 1] end |
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
478 |
else |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
479 |
let val dj_inst = PureThy.get_thm thy' (Name ("dj_"^ak_name'^"_"^ak_name)); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
480 |
val simp_s = HOL_basic_ss addsimps [dj_inst RS dj_supp, Finites.emptyI]; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
481 |
in EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1] end) |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
482 |
in |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
483 |
AxClass.prove_arity (qu_name,[],[qu_class]) proof thy' |
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
484 |
end) ak_names thy) ak_names thy18; |
18068 | 485 |
|
18431 | 486 |
(* shows that *) |
487 |
(* unit *) |
|
488 |
(* *(fs_<ak>,fs_<ak>) *) |
|
18600 | 489 |
(* nprod(fs_<ak>,fs_<ak>) *) |
18431 | 490 |
(* list(fs_<ak>) *) |
491 |
(* option(fs_<ak>) *) |
|
492 |
(* are instances of fs_<ak> *) |
|
18068 | 493 |
|
18431 | 494 |
val thy24 = fold (fn ak_name => fn thy => |
495 |
let |
|
496 |
val cls_name = Sign.full_name (sign_of thy) ("fs_"^ak_name); |
|
18068 | 497 |
val fs_inst = PureThy.get_thm thy (Name ("fs_"^ak_name^"_inst")); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
498 |
fun fs_proof thm = EVERY [ClassPackage.intro_classes_tac [], rtac (thm RS fs1) 1]; |
18068 | 499 |
|
18600 | 500 |
val fs_thm_unit = fs_unit_inst; |
501 |
val fs_thm_prod = fs_inst RS (fs_inst RS fs_prod_inst); |
|
502 |
val fs_thm_nprod = fs_inst RS (fs_inst RS fs_nprod_inst); |
|
503 |
val fs_thm_list = fs_inst RS fs_list_inst; |
|
504 |
val fs_thm_optn = fs_inst RS fs_option_inst; |
|
18431 | 505 |
in |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
506 |
thy |
19275 | 507 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (fs_proof fs_thm_unit) |
508 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (fs_proof fs_thm_prod) |
|
19494 | 509 |
|> AxClass.prove_arity ("Nominal.nprod",[[cls_name],[cls_name]],[cls_name]) |
18600 | 510 |
(fs_proof fs_thm_nprod) |
19275 | 511 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (fs_proof fs_thm_list) |
512 |
|> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (fs_proof fs_thm_optn) |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
513 |
end) ak_names thy20; |
18431 | 514 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
515 |
(******** cp_<ak>_<ai> class instances ********) |
18068 | 516 |
(*==============================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
517 |
(* abbreviations for some lemmas *) |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
518 |
val cp1 = thm "cp1"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
519 |
val cp_unit_inst = thm "cp_unit_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
520 |
val cp_bool_inst = thm "cp_bool_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
521 |
val cp_prod_inst = thm "cp_prod_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
522 |
val cp_list_inst = thm "cp_list_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
523 |
val cp_fun_inst = thm "cp_fun_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
524 |
val cp_option_inst = thm "cp_option_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
525 |
val cp_noption_inst = thm "cp_noption_inst"; |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
526 |
val pt_perm_compose = thm "pt_perm_compose"; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
527 |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
528 |
val dj_pp_forget = thm "dj_perm_perm_forget"; |
18068 | 529 |
|
530 |
(* shows that <aj> is an instance of cp_<ak>_<ai> *) |
|
18432 | 531 |
(* for every <ak>/<ai>-combination *) |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
532 |
val thy25 = fold (fn ak_name => fn thy => |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
533 |
fold (fn ak_name' => fn thy' => |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
534 |
fold (fn ak_name'' => fn thy'' => |
18068 | 535 |
let |
18432 | 536 |
val name = Sign.full_name (sign_of thy'') ak_name; |
537 |
val cls_name = Sign.full_name (sign_of thy'') ("cp_"^ak_name'^"_"^ak_name''); |
|
18068 | 538 |
val proof = |
539 |
(if (ak_name'=ak_name'') then |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
540 |
(let |
18068 | 541 |
val pt_inst = PureThy.get_thm thy'' (Name ("pt_"^ak_name''^"_inst")); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
542 |
val at_inst = PureThy.get_thm thy'' (Name ("at_"^ak_name''^"_inst")); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
543 |
in |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
544 |
EVERY [ClassPackage.intro_classes_tac [], |
18068 | 545 |
rtac (at_inst RS (pt_inst RS pt_perm_compose)) 1] |
546 |
end) |
|
547 |
else |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
548 |
(let |
18068 | 549 |
val dj_inst = PureThy.get_thm thy'' (Name ("dj_"^ak_name''^"_"^ak_name')); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
550 |
val simp_s = HOL_basic_ss addsimps |
18068 | 551 |
((dj_inst RS dj_pp_forget):: |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
552 |
(PureThy.get_thmss thy'' |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
553 |
[Name (ak_name' ^"_prm_"^ak_name^"_def"), |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
554 |
Name (ak_name''^"_prm_"^ak_name^"_def")])); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
555 |
in |
19133
7e84a1a3741c
Adapted to Florian's recent changes to the AxClass package.
berghofe
parents:
18759
diff
changeset
|
556 |
EVERY [ClassPackage.intro_classes_tac [], simp_tac simp_s 1] |
18068 | 557 |
end)) |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
558 |
in |
19275 | 559 |
AxClass.prove_arity (name,[],[cls_name]) proof thy'' |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
560 |
end) ak_names thy') ak_names thy) ak_names thy24; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
561 |
|
18432 | 562 |
(* shows that *) |
563 |
(* units *) |
|
564 |
(* products *) |
|
565 |
(* lists *) |
|
566 |
(* functions *) |
|
567 |
(* options *) |
|
568 |
(* noptions *) |
|
569 |
(* are instances of cp_<ak>_<ai> for every <ak>/<ai>-combination *) |
|
570 |
val thy26 = fold (fn ak_name => fn thy => |
|
571 |
fold (fn ak_name' => fn thy' => |
|
572 |
let |
|
573 |
val cls_name = Sign.full_name (sign_of thy') ("cp_"^ak_name^"_"^ak_name'); |
|
18068 | 574 |
val cp_inst = PureThy.get_thm thy' (Name ("cp_"^ak_name^"_"^ak_name'^"_inst")); |
575 |
val pt_inst = PureThy.get_thm thy' (Name ("pt_"^ak_name^"_inst")); |
|
576 |
val at_inst = PureThy.get_thm thy' (Name ("at_"^ak_name^"_inst")); |
|
18432 | 577 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
578 |
fun cp_proof thm = EVERY [ClassPackage.intro_classes_tac [],rtac (thm RS cp1) 1]; |
18432 | 579 |
|
580 |
val cp_thm_unit = cp_unit_inst; |
|
581 |
val cp_thm_prod = cp_inst RS (cp_inst RS cp_prod_inst); |
|
582 |
val cp_thm_list = cp_inst RS cp_list_inst; |
|
583 |
val cp_thm_fun = at_inst RS (pt_inst RS (cp_inst RS (cp_inst RS cp_fun_inst))); |
|
584 |
val cp_thm_optn = cp_inst RS cp_option_inst; |
|
585 |
val cp_thm_noptn = cp_inst RS cp_noption_inst; |
|
586 |
in |
|
587 |
thy' |
|
19275 | 588 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (cp_proof cp_thm_unit) |
589 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_prod) |
|
590 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (cp_proof cp_thm_list) |
|
591 |
|> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_fun) |
|
592 |
|> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (cp_proof cp_thm_optn) |
|
19494 | 593 |
|> AxClass.prove_arity ("Nominal.noption",[[cls_name]],[cls_name]) (cp_proof cp_thm_noptn) |
18432 | 594 |
end) ak_names thy) ak_names thy25; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
595 |
|
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
596 |
(* show that discrete nominal types are permutation types, finitely *) |
18432 | 597 |
(* supported and have the commutation property *) |
598 |
(* discrete types have a permutation operation defined as pi o x = x; *) |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
599 |
(* which renders the proofs to be simple "simp_all"-proofs. *) |
18432 | 600 |
val thy32 = |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
601 |
let |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
602 |
fun discrete_pt_inst discrete_ty defn = |
18432 | 603 |
fold (fn ak_name => fn thy => |
604 |
let |
|
605 |
val qu_class = Sign.full_name (sign_of thy) ("pt_"^ak_name); |
|
606 |
val simp_s = HOL_basic_ss addsimps [defn]; |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
607 |
val proof = EVERY [ClassPackage.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)]; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
608 |
in |
19275 | 609 |
AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy |
18432 | 610 |
end) ak_names; |
18068 | 611 |
|
18432 | 612 |
fun discrete_fs_inst discrete_ty defn = |
613 |
fold (fn ak_name => fn thy => |
|
614 |
let |
|
615 |
val qu_class = Sign.full_name (sign_of thy) ("fs_"^ak_name); |
|
19494 | 616 |
val supp_def = thm "Nominal.supp_def"; |
18432 | 617 |
val simp_s = HOL_ss addsimps [supp_def,Collect_const,Finites.emptyI,defn]; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
618 |
val proof = EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1]; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
619 |
in |
19275 | 620 |
AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
621 |
end) ak_names; |
18068 | 622 |
|
18432 | 623 |
fun discrete_cp_inst discrete_ty defn = |
624 |
fold (fn ak_name' => (fold (fn ak_name => fn thy => |
|
625 |
let |
|
626 |
val qu_class = Sign.full_name (sign_of thy) ("cp_"^ak_name^"_"^ak_name'); |
|
19494 | 627 |
val supp_def = thm "Nominal.supp_def"; |
18432 | 628 |
val simp_s = HOL_ss addsimps [defn]; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
629 |
val proof = EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1]; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
630 |
in |
19275 | 631 |
AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
632 |
end) ak_names)) ak_names; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
633 |
|
18432 | 634 |
in |
635 |
thy26 |
|
636 |
|> discrete_pt_inst "nat" (thm "perm_nat_def") |
|
637 |
|> discrete_fs_inst "nat" (thm "perm_nat_def") |
|
638 |
|> discrete_cp_inst "nat" (thm "perm_nat_def") |
|
639 |
|> discrete_pt_inst "bool" (thm "perm_bool") |
|
640 |
|> discrete_fs_inst "bool" (thm "perm_bool") |
|
641 |
|> discrete_cp_inst "bool" (thm "perm_bool") |
|
642 |
|> discrete_pt_inst "IntDef.int" (thm "perm_int_def") |
|
643 |
|> discrete_fs_inst "IntDef.int" (thm "perm_int_def") |
|
644 |
|> discrete_cp_inst "IntDef.int" (thm "perm_int_def") |
|
645 |
|> discrete_pt_inst "List.char" (thm "perm_char_def") |
|
646 |
|> discrete_fs_inst "List.char" (thm "perm_char_def") |
|
647 |
|> discrete_cp_inst "List.char" (thm "perm_char_def") |
|
648 |
end; |
|
649 |
||
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
650 |
|
18262 | 651 |
(* abbreviations for some lemmas *) |
652 |
(*===============================*) |
|
19494 | 653 |
val abs_fun_pi = thm "Nominal.abs_fun_pi"; |
654 |
val abs_fun_pi_ineq = thm "Nominal.abs_fun_pi_ineq"; |
|
655 |
val abs_fun_eq = thm "Nominal.abs_fun_eq"; |
|
19562
e56b3c967ae8
added the lemma abs_fun_eq' to the nominal theory,
urbanc
parents:
19548
diff
changeset
|
656 |
val abs_fun_eq' = thm "Nominal.abs_fun_eq'"; |
19494 | 657 |
val dj_perm_forget = thm "Nominal.dj_perm_forget"; |
658 |
val dj_pp_forget = thm "Nominal.dj_perm_perm_forget"; |
|
659 |
val fresh_iff = thm "Nominal.fresh_abs_fun_iff"; |
|
660 |
val fresh_iff_ineq = thm "Nominal.fresh_abs_fun_iff_ineq"; |
|
661 |
val abs_fun_supp = thm "Nominal.abs_fun_supp"; |
|
662 |
val abs_fun_supp_ineq = thm "Nominal.abs_fun_supp_ineq"; |
|
663 |
val pt_swap_bij = thm "Nominal.pt_swap_bij"; |
|
664 |
val pt_fresh_fresh = thm "Nominal.pt_fresh_fresh"; |
|
665 |
val pt_bij = thm "Nominal.pt_bij"; |
|
666 |
val pt_perm_compose = thm "Nominal.pt_perm_compose"; |
|
667 |
val pt_perm_compose' = thm "Nominal.pt_perm_compose'"; |
|
668 |
val perm_app = thm "Nominal.pt_fun_app_eq"; |
|
669 |
val at_fresh = thm "Nominal.at_fresh"; |
|
19972
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
670 |
val at_fresh_ineq = thm "Nominal.at_fresh_ineq"; |
19494 | 671 |
val at_calc = thms "Nominal.at_calc"; |
672 |
val at_supp = thm "Nominal.at_supp"; |
|
673 |
val dj_supp = thm "Nominal.dj_supp"; |
|
674 |
val fresh_left_ineq = thm "Nominal.pt_fresh_left_ineq"; |
|
675 |
val fresh_left = thm "Nominal.pt_fresh_left"; |
|
19548 | 676 |
val fresh_right_ineq = thm "Nominal.pt_fresh_right_ineq"; |
677 |
val fresh_right = thm "Nominal.pt_fresh_right"; |
|
19494 | 678 |
val fresh_bij_ineq = thm "Nominal.pt_fresh_bij_ineq"; |
679 |
val fresh_bij = thm "Nominal.pt_fresh_bij"; |
|
19638
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
680 |
val fresh_aux_ineq = thm "Nominal.pt_fresh_aux_ineq"; |
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
681 |
val fresh_aux = thm "Nominal.pt_fresh_aux"; |
19972
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
682 |
val fresh_eqvt = thm "Nominal.pt_fresh_eqvt"; |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
683 |
val all_eqvt = thm "Nominal.pt_all_eqvt"; |
19494 | 684 |
val pt_pi_rev = thm "Nominal.pt_pi_rev"; |
685 |
val pt_rev_pi = thm "Nominal.pt_rev_pi"; |
|
19972
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
686 |
val at_exists_fresh = thm "Nominal.at_exists_fresh"; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
687 |
|
18068 | 688 |
|
18262 | 689 |
(* Now we collect and instantiate some lemmas w.r.t. all atom *) |
690 |
(* types; this allows for example to use abs_perm (which is a *) |
|
691 |
(* collection of theorems) instead of thm abs_fun_pi with explicit *) |
|
692 |
(* instantiations. *) |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
693 |
val (_, thy33) = |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
694 |
let |
18651
0cb5a8f501aa
added the thms-collection "pt_id" (collection of all pt_<ak>1 lemmas)
urbanc
parents:
18626
diff
changeset
|
695 |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
696 |
(* takes a theorem thm and a list of theorems [t1,..,tn] *) |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
697 |
(* produces a list of theorems of the form [t1 RS thm,..,tn RS thm] *) |
18262 | 698 |
fun instR thm thms = map (fn ti => ti RS thm) thms; |
18068 | 699 |
|
18262 | 700 |
(* takes two theorem lists (hopefully of the same length ;o) *) |
701 |
(* produces a list of theorems of the form *) |
|
702 |
(* [t1 RS m1,..,tn RS mn] where [t1,..,tn] is thms1 and [m1,..,mn] is thms2 *) |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
703 |
fun inst_zip thms1 thms2 = map (fn (t1,t2) => t1 RS t2) (thms1 ~~ thms2); |
18068 | 704 |
|
18262 | 705 |
(* takes a theorem list of the form [l1,...,ln] *) |
706 |
(* and a list of theorem lists of the form *) |
|
707 |
(* [[h11,...,h1m],....,[hk1,....,hkm] *) |
|
708 |
(* produces the list of theorem lists *) |
|
709 |
(* [[l1 RS h11,...,l1 RS h1m],...,[ln RS hk1,...,ln RS hkm]] *) |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
710 |
fun inst_mult thms thmss = map (fn (t,ts) => instR t ts) (thms ~~ thmss); |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
711 |
|
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
712 |
(* FIXME: these lists do not need to be created dynamically again *) |
18262 | 713 |
|
18068 | 714 |
(* list of all at_inst-theorems *) |
18262 | 715 |
val ats = map (fn ak => PureThy.get_thm thy32 (Name ("at_"^ak^"_inst"))) ak_names |
18068 | 716 |
(* list of all pt_inst-theorems *) |
18262 | 717 |
val pts = map (fn ak => PureThy.get_thm thy32 (Name ("pt_"^ak^"_inst"))) ak_names |
718 |
(* list of all cp_inst-theorems as a collection of lists*) |
|
18068 | 719 |
val cps = |
18262 | 720 |
let fun cps_fun ak1 ak2 = PureThy.get_thm thy32 (Name ("cp_"^ak1^"_"^ak2^"_inst")) |
721 |
in map (fn aki => (map (cps_fun aki) ak_names)) ak_names end; |
|
722 |
(* list of all cp_inst-theorems that have different atom types *) |
|
723 |
val cps' = |
|
724 |
let fun cps'_fun ak1 ak2 = |
|
725 |
if ak1=ak2 then NONE else SOME(PureThy.get_thm thy32 (Name ("cp_"^ak1^"_"^ak2^"_inst"))) |
|
726 |
in map (fn aki => (List.mapPartial I (map (cps'_fun aki) ak_names))) ak_names end; |
|
18068 | 727 |
(* list of all dj_inst-theorems *) |
728 |
val djs = |
|
729 |
let fun djs_fun (ak1,ak2) = |
|
18262 | 730 |
if ak1=ak2 then NONE else SOME(PureThy.get_thm thy32 (Name ("dj_"^ak2^"_"^ak1))) |
731 |
in List.mapPartial I (map djs_fun (Library.product ak_names ak_names)) end; |
|
732 |
(* list of all fs_inst-theorems *) |
|
733 |
val fss = map (fn ak => PureThy.get_thm thy32 (Name ("fs_"^ak^"_inst"))) ak_names |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
734 |
|
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
735 |
fun inst_pt thms = Library.flat (map (fn ti => instR ti pts) thms); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
736 |
fun inst_at thms = Library.flat (map (fn ti => instR ti ats) thms); |
18262 | 737 |
fun inst_fs thms = Library.flat (map (fn ti => instR ti fss) thms); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
738 |
fun inst_cp thms cps = Library.flat (inst_mult thms cps); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
739 |
fun inst_pt_at thms = inst_zip ats (inst_pt thms); |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
740 |
fun inst_dj thms = Library.flat (map (fn ti => instR ti djs) thms); |
18436
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
741 |
fun inst_pt_pt_at_cp thms = inst_cp (inst_zip ats (inst_zip pts (inst_pt thms))) cps; |
18262 | 742 |
fun inst_pt_at_fs thms = inst_zip (inst_fs [fs1]) (inst_zip ats (inst_pt thms)); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
743 |
fun inst_pt_pt_at_cp thms = |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
744 |
let val i_pt_pt_at = inst_zip ats (inst_zip pts (inst_pt thms)); |
18436
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
745 |
val i_pt_pt_at_cp = inst_cp i_pt_pt_at cps'; |
18396
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
746 |
in i_pt_pt_at_cp end; |
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
747 |
fun inst_pt_pt_at_cp_dj thms = inst_zip djs (inst_pt_pt_at_cp thms); |
18068 | 748 |
in |
18262 | 749 |
thy32 |
18652
3930a060d71b
rolled back the last addition since these lemmas were already
urbanc
parents:
18651
diff
changeset
|
750 |
|> PureThy.add_thmss [(("alpha", inst_pt_at [abs_fun_eq]),[])] |
19562
e56b3c967ae8
added the lemma abs_fun_eq' to the nominal theory,
urbanc
parents:
19548
diff
changeset
|
751 |
||>> PureThy.add_thmss [(("alpha'", inst_pt_at [abs_fun_eq']),[])] |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
752 |
||>> PureThy.add_thmss [(("perm_swap", inst_pt_at [pt_swap_bij]),[])] |
19139 | 753 |
||>> PureThy.add_thmss |
754 |
let val thms1 = inst_pt_at [pt_pi_rev]; |
|
755 |
val thms2 = inst_pt_at [pt_rev_pi]; |
|
756 |
in [(("perm_pi_simp",thms1 @ thms2),[])] end |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
757 |
||>> PureThy.add_thmss [(("perm_fresh_fresh", inst_pt_at [pt_fresh_fresh]),[])] |
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
758 |
||>> PureThy.add_thmss [(("perm_bij", inst_pt_at [pt_bij]),[])] |
18436
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
759 |
||>> PureThy.add_thmss |
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
760 |
let val thms1 = inst_pt_at [pt_perm_compose]; |
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
761 |
val thms2 = instR cp1 (Library.flat cps'); |
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
762 |
in [(("perm_compose",thms1 @ thms2),[])] end |
19139 | 763 |
||>> PureThy.add_thmss [(("perm_compose'",inst_pt_at [pt_perm_compose']),[])] |
764 |
||>> PureThy.add_thmss [(("perm_app", inst_pt_at [perm_app]),[])] |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
765 |
||>> PureThy.add_thmss [(("supp_atm", (inst_at [at_supp]) @ (inst_dj [dj_supp])),[])] |
19972
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
766 |
||>> PureThy.add_thmss [(("exists_fresh", inst_at [at_exists_fresh]),[])] |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
767 |
||>> PureThy.add_thmss [(("all_eqvt", inst_pt_at [all_eqvt]),[])] |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
768 |
||>> PureThy.add_thmss |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
769 |
let val thms1 = inst_at [at_fresh] |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
770 |
val thms2 = inst_dj [at_fresh_ineq] |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
771 |
in [(("fresh_atm", thms1 @ thms2),[])] end |
19992 | 772 |
||>> PureThy.add_thmss |
20377
3baf326b2b5f
Removed non-trivial definitions from calc_atm theorem list.
berghofe
parents:
20179
diff
changeset
|
773 |
let val thms1 = filter |
3baf326b2b5f
Removed non-trivial definitions from calc_atm theorem list.
berghofe
parents:
20179
diff
changeset
|
774 |
(fn th => case prop_of th of _ $ _ $ Var _ => true | _ => false) |
3baf326b2b5f
Removed non-trivial definitions from calc_atm theorem list.
berghofe
parents:
20179
diff
changeset
|
775 |
(List.concat (List.concat perm_defs)) |
19993
e0a5783d708f
added simplification rules to the fresh_guess tactic
urbanc
parents:
19992
diff
changeset
|
776 |
in [(("calc_atm", (inst_at at_calc) @ thms1),[])] end |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
777 |
||>> PureThy.add_thmss |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
778 |
let val thms1 = inst_pt_at [abs_fun_pi] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
779 |
and thms2 = inst_pt_pt_at_cp [abs_fun_pi_ineq] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
780 |
in [(("abs_perm", thms1 @ thms2),[])] end |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
781 |
||>> PureThy.add_thmss |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
782 |
let val thms1 = inst_dj [dj_perm_forget] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
783 |
and thms2 = inst_dj [dj_pp_forget] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
784 |
in [(("perm_dj", thms1 @ thms2),[])] end |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
785 |
||>> PureThy.add_thmss |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
786 |
let val thms1 = inst_pt_at_fs [fresh_iff] |
18626 | 787 |
and thms2 = inst_pt_at [fresh_iff] |
788 |
and thms3 = inst_pt_pt_at_cp_dj [fresh_iff_ineq] |
|
789 |
in [(("abs_fresh", thms1 @ thms2 @ thms3),[])] end |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
790 |
||>> PureThy.add_thmss |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
791 |
let val thms1 = inst_pt_at [abs_fun_supp] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
792 |
and thms2 = inst_pt_at_fs [abs_fun_supp] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
793 |
and thms3 = inst_pt_pt_at_cp_dj [abs_fun_supp_ineq] |
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
794 |
in [(("abs_supp", thms1 @ thms2 @ thms3),[])] end |
18396
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
795 |
||>> PureThy.add_thmss |
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
796 |
let val thms1 = inst_pt_at [fresh_left] |
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
797 |
and thms2 = inst_pt_pt_at_cp [fresh_left_ineq] |
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
798 |
in [(("fresh_left", thms1 @ thms2),[])] end |
18426 | 799 |
||>> PureThy.add_thmss |
19548 | 800 |
let val thms1 = inst_pt_at [fresh_right] |
801 |
and thms2 = inst_pt_pt_at_cp [fresh_right_ineq] |
|
802 |
in [(("fresh_right", thms1 @ thms2),[])] end |
|
803 |
||>> PureThy.add_thmss |
|
18426 | 804 |
let val thms1 = inst_pt_at [fresh_bij] |
805 |
and thms2 = inst_pt_pt_at_cp [fresh_bij_ineq] |
|
19972
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
806 |
in [(("fresh_bij", thms1 @ thms2),[])] end |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
807 |
||>> PureThy.add_thmss |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
808 |
let val thms1 = inst_pt_at [fresh_eqvt] |
89c5afe4139a
added more infrastructure for the recursion combinator
urbanc
parents:
19638
diff
changeset
|
809 |
in [(("fresh_eqvt", thms1),[])] end |
19638
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
810 |
||>> PureThy.add_thmss |
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
811 |
let val thms1 = inst_pt_at [fresh_aux] |
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
812 |
and thms2 = inst_pt_pt_at_cp_dj [fresh_aux_ineq] |
4358b88a9d12
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc
parents:
19635
diff
changeset
|
813 |
in [(("fresh_aux", thms1 @ thms2),[])] end |
18068 | 814 |
end; |
815 |
||
816 |
in NominalData.put (fold Symtab.update (map (rpair ()) full_ak_names) |
|
18262 | 817 |
(NominalData.get thy11)) thy33 |
18068 | 818 |
end; |
819 |
||
820 |
||
821 |
(* syntax und parsing *) |
|
822 |
structure P = OuterParse and K = OuterKeyword; |
|
823 |
||
824 |
val atom_declP = |
|
825 |
OuterSyntax.command "atom_decl" "Declare new kinds of atoms" K.thy_decl |
|
826 |
(Scan.repeat1 P.name >> (Toplevel.theory o create_nom_typedecls)); |
|
827 |
||
828 |
val _ = OuterSyntax.add_parsers [atom_declP]; |
|
829 |
||
18746
a4ece70964ae
made the change for setup-functions not returning functions
urbanc
parents:
18707
diff
changeset
|
830 |
val setup = NominalData.init; |
18068 | 831 |
|
832 |
end; |