author | wenzelm |
Sat, 07 Mar 2009 22:17:25 +0100 | |
changeset 30345 | 76fd85bbf139 |
parent 30235 | 58d147683393 |
child 30595 | c87a3350f5a9 |
permissions | -rw-r--r-- |
26337 | 1 |
(* title: HOL/Nominal/nominal_atoms.ML |
19494 | 2 |
Author: Christian Urban and Stefan Berghofer, TU Muenchen |
3 |
||
4 |
Declaration of atom types to be used in nominal datatypes. |
|
5 |
*) |
|
18068 | 6 |
|
7 |
signature NOMINAL_ATOMS = |
|
8 |
sig |
|
9 |
val create_nom_typedecls : string list -> theory -> theory |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
10 |
type atom_info |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
11 |
val get_atom_infos : theory -> atom_info Symtab.table |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
12 |
val get_atom_info : theory -> string -> atom_info option |
28372 | 13 |
val the_atom_info : theory -> string -> atom_info |
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
14 |
val fs_class_of : theory -> string -> string |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
15 |
val pt_class_of : theory -> string -> string |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
16 |
val cp_class_of : theory -> string -> string -> string |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
17 |
val at_inst_of : theory -> string -> thm |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
18 |
val pt_inst_of : theory -> string -> thm |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
19 |
val cp_inst_of : theory -> string -> string -> thm |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
20 |
val dj_thm_of : theory -> string -> string -> thm |
18068 | 21 |
val atoms_of : theory -> string list |
22 |
val mk_permT : typ -> typ |
|
23 |
end |
|
24 |
||
25 |
structure NominalAtoms : NOMINAL_ATOMS = |
|
26 |
struct |
|
27 |
||
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
28 |
val finite_emptyI = @{thm "finite.emptyI"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
29 |
val Collect_const = @{thm "Collect_const"}; |
21669 | 30 |
|
24569 | 31 |
val inductive_forall_def = @{thm "induct_forall_def"}; |
32 |
||
21669 | 33 |
|
22846 | 34 |
(* theory data *) |
18068 | 35 |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
36 |
type atom_info = |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
37 |
{pt_class : string, |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
38 |
fs_class : string, |
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
39 |
cp_classes : string Symtab.table, |
28372 | 40 |
at_inst : thm, |
41 |
pt_inst : thm, |
|
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
42 |
cp_inst : thm Symtab.table, |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
43 |
dj_thms : thm Symtab.table}; |
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
44 |
|
22846 | 45 |
structure NominalData = TheoryDataFun |
46 |
( |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
47 |
type T = atom_info Symtab.table; |
18068 | 48 |
val empty = Symtab.empty; |
49 |
val copy = I; |
|
50 |
val extend = I; |
|
51 |
fun merge _ x = Symtab.merge (K true) x; |
|
22846 | 52 |
); |
18068 | 53 |
|
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
54 |
fun make_atom_info ((((((pt_class, fs_class), cp_classes), at_inst), pt_inst), cp_inst), dj_thms) = |
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
55 |
{pt_class = pt_class, |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
56 |
fs_class = fs_class, |
28372 | 57 |
cp_classes = cp_classes, |
58 |
at_inst = at_inst, |
|
59 |
pt_inst = pt_inst, |
|
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
60 |
cp_inst = cp_inst, |
28372 | 61 |
dj_thms = dj_thms}; |
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
62 |
|
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
63 |
val get_atom_infos = NominalData.get; |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
64 |
val get_atom_info = Symtab.lookup o NominalData.get; |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
65 |
|
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
66 |
fun gen_lookup lookup name = case lookup name of |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
67 |
SOME info => info |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
68 |
| NONE => error ("Unknown atom type " ^ quote name); |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
69 |
|
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
70 |
fun the_atom_info thy = gen_lookup (get_atom_info thy); |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
71 |
|
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
72 |
fun gen_lookup' f thy = the_atom_info thy #> f; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
73 |
fun gen_lookup'' f thy = |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
74 |
gen_lookup' (f #> Symtab.lookup #> gen_lookup) thy; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
75 |
|
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
76 |
val fs_class_of = gen_lookup' #fs_class; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
77 |
val pt_class_of = gen_lookup' #pt_class; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
78 |
val at_inst_of = gen_lookup' #at_inst; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
79 |
val pt_inst_of = gen_lookup' #pt_inst; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
80 |
val cp_class_of = gen_lookup'' #cp_classes; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
81 |
val cp_inst_of = gen_lookup'' #cp_inst; |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
82 |
val dj_thm_of = gen_lookup'' #dj_thms; |
28372 | 83 |
|
18068 | 84 |
fun atoms_of thy = map fst (Symtab.dest (NominalData.get thy)); |
85 |
||
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
86 |
fun mk_permT T = HOLogic.listT (HOLogic.mk_prodT (T, T)); |
18068 | 87 |
|
88 |
fun mk_Cons x xs = |
|
89 |
let val T = fastype_of x |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
90 |
in Const ("List.list.Cons", T --> HOLogic.listT T --> HOLogic.listT T) $ x $ xs end; |
18068 | 91 |
|
29585 | 92 |
fun add_thms_string args = PureThy.add_thms ((map o apfst o apfst) Binding.name args); |
93 |
fun add_thmss_string args = PureThy.add_thmss ((map o apfst o apfst) Binding.name args); |
|
94 |
||
18068 | 95 |
(* this function sets up all matters related to atom- *) |
96 |
(* kinds; the user specifies a list of atom-kind names *) |
|
97 |
(* atom_decl <ak1> ... <akn> *) |
|
98 |
fun create_nom_typedecls ak_names thy = |
|
99 |
let |
|
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
100 |
|
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
101 |
val (_,thy1) = |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
102 |
fold_map (fn ak => fn thy => |
30345 | 103 |
let val dt = ([], Binding.name ak, NoSyn, [(Binding.name ak, [@{typ nat}], NoSyn)]) |
27112 | 104 |
val ({inject,case_thms,...},thy1) = DatatypePackage.add_datatype true false [ak] [dt] thy |
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
105 |
val inject_flat = Library.flat inject |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
106 |
val ak_type = Type (Sign.intern_type thy1 ak,[]) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
107 |
val ak_sign = Sign.intern_const thy1 ak |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
108 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
109 |
val inj_type = @{typ nat}-->ak_type |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
110 |
val inj_on_type = inj_type-->(@{typ "nat set"})-->@{typ bool} |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
111 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
112 |
(* first statement *) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
113 |
val stmnt1 = HOLogic.mk_Trueprop |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
114 |
(Const (@{const_name "inj_on"},inj_on_type) $ |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
115 |
Const (ak_sign,inj_type) $ HOLogic.mk_UNIV @{typ nat}) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
116 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
117 |
val simp1 = @{thm inj_on_def}::inject_flat |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
118 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
119 |
val proof1 = fn _ => EVERY [simp_tac (HOL_basic_ss addsimps simp1) 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
120 |
rtac @{thm ballI} 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
121 |
rtac @{thm ballI} 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
122 |
rtac @{thm impI} 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
123 |
atac 1] |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
124 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
125 |
val (inj_thm,thy2) = |
29585 | 126 |
add_thms_string [((ak^"_inj",Goal.prove_global thy1 [] [] stmnt1 proof1), [])] thy1 |
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
127 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
128 |
(* second statement *) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
129 |
val y = Free ("y",ak_type) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
130 |
val stmnt2 = HOLogic.mk_Trueprop |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
131 |
(HOLogic.mk_exists ("x",@{typ nat},HOLogic.mk_eq (y,Const (ak_sign,inj_type) $ Bound 0))) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
132 |
|
27128
d2374ba6c02e
InductTacs.case_tac with proper context and proper declaration of local variable;
wenzelm
parents:
27112
diff
changeset
|
133 |
val proof2 = fn {prems, context} => |
27216
dc1455f96f56
InductTacs.case_tac: removed obsolete declare, which is now part of Goal.prove;
wenzelm
parents:
27128
diff
changeset
|
134 |
InductTacs.case_tac context "y" 1 THEN |
27128
d2374ba6c02e
InductTacs.case_tac with proper context and proper declaration of local variable;
wenzelm
parents:
27112
diff
changeset
|
135 |
asm_simp_tac (HOL_basic_ss addsimps simp1) 1 THEN |
d2374ba6c02e
InductTacs.case_tac with proper context and proper declaration of local variable;
wenzelm
parents:
27112
diff
changeset
|
136 |
rtac @{thm exI} 1 THEN |
d2374ba6c02e
InductTacs.case_tac with proper context and proper declaration of local variable;
wenzelm
parents:
27112
diff
changeset
|
137 |
rtac @{thm refl} 1 |
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
138 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
139 |
(* third statement *) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
140 |
val (inject_thm,thy3) = |
29585 | 141 |
add_thms_string [((ak^"_injection",Goal.prove_global thy2 [] [] stmnt2 proof2), [])] thy2 |
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
142 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
143 |
val stmnt3 = HOLogic.mk_Trueprop |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
144 |
(HOLogic.mk_not |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
145 |
(Const ("Finite_Set.finite", HOLogic.mk_setT ak_type --> HOLogic.boolT) $ |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
146 |
HOLogic.mk_UNIV ak_type)) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
147 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
148 |
val simp2 = [@{thm image_def},@{thm bex_UNIV}]@inject_thm |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
149 |
val simp3 = [@{thm UNIV_def}] |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
150 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
151 |
val proof3 = fn _ => EVERY [cut_facts_tac inj_thm 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
152 |
dtac @{thm range_inj_infinite} 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
153 |
asm_full_simp_tac (HOL_basic_ss addsimps simp2) 1, |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
154 |
simp_tac (HOL_basic_ss addsimps simp3) 1] |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
155 |
|
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
156 |
val (inf_thm,thy4) = |
29585 | 157 |
add_thms_string [((ak^"_infinite",Goal.prove_global thy3 [] [] stmnt3 proof3), [])] thy3 |
24677
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
158 |
in |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
159 |
((inj_thm,inject_thm,inf_thm),thy4) |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
160 |
end) ak_names thy |
c6295d2dce48
changed the representation of atoms to datatypes over nats
urbanc
parents:
24569
diff
changeset
|
161 |
|
18068 | 162 |
(* produces a list consisting of pairs: *) |
163 |
(* fst component is the atom-kind name *) |
|
164 |
(* snd component is its type *) |
|
21289
920b7b893d9c
deleted all uses of sign_of as it's now the identity function
urbanc
parents:
20377
diff
changeset
|
165 |
val full_ak_names = map (Sign.intern_type thy1) ak_names; |
18068 | 166 |
val ak_names_types = ak_names ~~ map (Type o rpair []) full_ak_names; |
167 |
||
168 |
(* declares a swapping function for every atom-kind, it is *) |
|
169 |
(* const swap_<ak> :: <akT> * <akT> => <akT> => <akT> *) |
|
170 |
(* swap_<ak> (a,b) c = (if a=c then b (else if b=c then a else c)) *) |
|
171 |
(* overloades then the general swap-function *) |
|
20179 | 172 |
val (swap_eqs, thy3) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 173 |
let |
174 |
val swapT = HOLogic.mk_prodT (T, T) --> T --> T; |
|
28965 | 175 |
val swap_name = Sign.full_bname thy ("swap_" ^ ak_name); |
18068 | 176 |
val a = Free ("a", T); |
177 |
val b = Free ("b", T); |
|
178 |
val c = Free ("c", T); |
|
179 |
val ab = Free ("ab", HOLogic.mk_prodT (T, T)) |
|
180 |
val cif = Const ("HOL.If", HOLogic.boolT --> T --> T --> T); |
|
181 |
val cswap_akname = Const (swap_name, swapT); |
|
19494 | 182 |
val cswap = Const ("Nominal.swap", swapT) |
18068 | 183 |
|
184 |
val name = "swap_"^ak_name^"_def"; |
|
185 |
val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
20179 | 186 |
(cswap_akname $ HOLogic.mk_prod (a,b) $ c, |
18068 | 187 |
cif $ HOLogic.mk_eq (a,c) $ b $ (cif $ HOLogic.mk_eq (b,c) $ a $ c))) |
188 |
val def2 = Logic.mk_equals (cswap $ ab $ c, cswap_akname $ ab $ c) |
|
189 |
in |
|
30345 | 190 |
thy |> Sign.add_consts_i [(Binding.name ("swap_" ^ ak_name), swapT, NoSyn)] |
29585 | 191 |
|> PureThy.add_defs_unchecked true [((Binding.name name, def2),[])] |
20179 | 192 |
|> snd |
25557 | 193 |
|> OldPrimrecPackage.add_primrec_unchecked_i "" [(("", def1),[])] |
26398
fccb74555d9e
removed redundant axiomatizations of XXX_infinite (fact already proven);
wenzelm
parents:
26343
diff
changeset
|
194 |
end) ak_names_types thy1; |
18068 | 195 |
|
196 |
(* declares a permutation function for every atom-kind acting *) |
|
197 |
(* on such atoms *) |
|
198 |
(* const <ak>_prm_<ak> :: (<akT> * <akT>)list => akT => akT *) |
|
199 |
(* <ak>_prm_<ak> [] a = a *) |
|
200 |
(* <ak>_prm_<ak> (x#xs) a = swap_<ak> x (perm xs a) *) |
|
20179 | 201 |
val (prm_eqs, thy4) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 202 |
let |
203 |
val swapT = HOLogic.mk_prodT (T, T) --> T --> T; |
|
28965 | 204 |
val swap_name = Sign.full_bname thy ("swap_" ^ ak_name) |
18068 | 205 |
val prmT = mk_permT T --> T --> T; |
206 |
val prm_name = ak_name ^ "_prm_" ^ ak_name; |
|
28965 | 207 |
val qu_prm_name = Sign.full_bname thy prm_name; |
18068 | 208 |
val x = Free ("x", HOLogic.mk_prodT (T, T)); |
209 |
val xs = Free ("xs", mk_permT T); |
|
210 |
val a = Free ("a", T) ; |
|
211 |
||
212 |
val cnil = Const ("List.list.Nil", mk_permT T); |
|
213 |
||
214 |
val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq (Const (qu_prm_name, prmT) $ cnil $ a, a)); |
|
215 |
||
216 |
val def2 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
217 |
(Const (qu_prm_name, prmT) $ mk_Cons x xs $ a, |
|
218 |
Const (swap_name, swapT) $ x $ (Const (qu_prm_name, prmT) $ xs $ a))); |
|
219 |
in |
|
30345 | 220 |
thy |> Sign.add_consts_i [(Binding.name prm_name, mk_permT T --> T --> T, NoSyn)] |
25557 | 221 |
|> OldPrimrecPackage.add_primrec_unchecked_i "" [(("", def1), []),(("", def2), [])] |
20179 | 222 |
end) ak_names_types thy3; |
18068 | 223 |
|
224 |
(* defines permutation functions for all combinations of atom-kinds; *) |
|
225 |
(* there are a trivial cases and non-trivial cases *) |
|
226 |
(* non-trivial case: *) |
|
227 |
(* <ak>_prm_<ak>_def: perm pi a == <ak>_prm_<ak> pi a *) |
|
228 |
(* trivial case with <ak> != <ak'> *) |
|
229 |
(* <ak>_prm<ak'>_def[simp]: perm pi a == a *) |
|
230 |
(* *) |
|
231 |
(* the trivial cases are added to the simplifier, while the non- *) |
|
232 |
(* have their own rules proved below *) |
|
18366 | 233 |
val (perm_defs, thy5) = fold_map (fn (ak_name, T) => fn thy => |
234 |
fold_map (fn (ak_name', T') => fn thy' => |
|
18068 | 235 |
let |
236 |
val perm_def_name = ak_name ^ "_prm_" ^ ak_name'; |
|
237 |
val pi = Free ("pi", mk_permT T); |
|
238 |
val a = Free ("a", T'); |
|
19494 | 239 |
val cperm = Const ("Nominal.perm", mk_permT T --> T' --> T'); |
28965 | 240 |
val cperm_def = Const (Sign.full_bname thy' perm_def_name, mk_permT T --> T' --> T'); |
18068 | 241 |
|
242 |
val name = ak_name ^ "_prm_" ^ ak_name' ^ "_def"; |
|
243 |
val def = Logic.mk_equals |
|
244 |
(cperm $ pi $ a, if ak_name = ak_name' then cperm_def $ pi $ a else a) |
|
245 |
in |
|
29585 | 246 |
PureThy.add_defs_unchecked true [((Binding.name name, def),[])] thy' |
18366 | 247 |
end) ak_names_types thy) ak_names_types thy4; |
18068 | 248 |
|
249 |
(* proves that every atom-kind is an instance of at *) |
|
250 |
(* lemma at_<ak>_inst: *) |
|
251 |
(* at TYPE(<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
252 |
val (prm_cons_thms,thy6) = |
29585 | 253 |
thy5 |> add_thms_string (map (fn (ak_name, T) => |
18068 | 254 |
let |
28965 | 255 |
val ak_name_qu = Sign.full_bname thy5 (ak_name); |
18068 | 256 |
val i_type = Type(ak_name_qu,[]); |
26337 | 257 |
val cat = Const ("Nominal.at",(Term.itselfT i_type) --> HOLogic.boolT); |
18068 | 258 |
val at_type = Logic.mk_type i_type; |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
259 |
val simp_s = HOL_ss addsimps maps (PureThy.get_thms thy5) |
26337 | 260 |
["at_def", |
261 |
ak_name ^ "_prm_" ^ ak_name ^ "_def", |
|
262 |
ak_name ^ "_prm_" ^ ak_name ^ ".simps", |
|
263 |
"swap_" ^ ak_name ^ "_def", |
|
264 |
"swap_" ^ ak_name ^ ".simps", |
|
265 |
ak_name ^ "_infinite"] |
|
266 |
||
267 |
val name = "at_"^ak_name^ "_inst"; |
|
18068 | 268 |
val statement = HOLogic.mk_Trueprop (cat $ at_type); |
269 |
||
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
270 |
val proof = fn _ => simp_tac simp_s 1 |
18068 | 271 |
|
272 |
in |
|
20046 | 273 |
((name, Goal.prove_global thy5 [] [] statement proof), []) |
18068 | 274 |
end) ak_names_types); |
275 |
||
276 |
(* declares a perm-axclass for every atom-kind *) |
|
277 |
(* axclass pt_<ak> *) |
|
278 |
(* pt_<ak>1[simp]: perm [] x = x *) |
|
279 |
(* pt_<ak>2: perm (pi1@pi2) x = perm pi1 (perm pi2 x) *) |
|
280 |
(* 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
|
281 |
val (pt_ax_classes,thy7) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 282 |
let |
26337 | 283 |
val cl_name = "pt_"^ak_name; |
18068 | 284 |
val ty = TFree("'a",["HOL.type"]); |
285 |
val x = Free ("x", ty); |
|
286 |
val pi1 = Free ("pi1", mk_permT T); |
|
287 |
val pi2 = Free ("pi2", mk_permT T); |
|
19494 | 288 |
val cperm = Const ("Nominal.perm", mk_permT T --> ty --> ty); |
18068 | 289 |
val cnil = Const ("List.list.Nil", mk_permT T); |
23029 | 290 |
val cappend = Const ("List.append",mk_permT T --> mk_permT T --> mk_permT T); |
19494 | 291 |
val cprm_eq = Const ("Nominal.prm_eq",mk_permT T --> mk_permT T --> HOLogic.boolT); |
18068 | 292 |
(* nil axiom *) |
293 |
val axiom1 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
294 |
(cperm $ cnil $ x, x)); |
|
295 |
(* append axiom *) |
|
296 |
val axiom2 = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
297 |
(cperm $ (cappend $ pi1 $ pi2) $ x, cperm $ pi1 $ (cperm $ pi2 $ x))); |
|
298 |
(* perm-eq axiom *) |
|
299 |
val axiom3 = Logic.mk_implies |
|
300 |
(HOLogic.mk_Trueprop (cprm_eq $ pi1 $ pi2), |
|
301 |
HOLogic.mk_Trueprop (HOLogic.mk_eq (cperm $ pi1 $ x, cperm $ pi2 $ x))); |
|
302 |
in |
|
30345 | 303 |
AxClass.define_class (Binding.name cl_name, ["HOL.type"]) [] |
28965 | 304 |
[((Binding.name (cl_name ^ "1"), [Simplifier.simp_add]), [axiom1]), |
305 |
((Binding.name (cl_name ^ "2"), []), [axiom2]), |
|
306 |
((Binding.name (cl_name ^ "3"), []), [axiom3])] thy |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
307 |
end) ak_names_types thy6; |
18068 | 308 |
|
309 |
(* proves that every pt_<ak>-type together with <ak>-type *) |
|
310 |
(* instance of pt *) |
|
311 |
(* lemma pt_<ak>_inst: *) |
|
312 |
(* pt TYPE('x::pt_<ak>) TYPE(<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
313 |
val (prm_inst_thms,thy8) = |
29585 | 314 |
thy7 |> add_thms_string (map (fn (ak_name, T) => |
18068 | 315 |
let |
28965 | 316 |
val ak_name_qu = Sign.full_bname thy7 ak_name; |
317 |
val pt_name_qu = Sign.full_bname thy7 ("pt_"^ak_name); |
|
18068 | 318 |
val i_type1 = TFree("'x",[pt_name_qu]); |
319 |
val i_type2 = Type(ak_name_qu,[]); |
|
26337 | 320 |
val cpt = Const ("Nominal.pt",(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
18068 | 321 |
val pt_type = Logic.mk_type i_type1; |
322 |
val at_type = Logic.mk_type i_type2; |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
323 |
val simp_s = HOL_ss addsimps maps (PureThy.get_thms thy7) |
26337 | 324 |
["pt_def", |
325 |
"pt_" ^ ak_name ^ "1", |
|
326 |
"pt_" ^ ak_name ^ "2", |
|
327 |
"pt_" ^ ak_name ^ "3"]; |
|
18068 | 328 |
|
26337 | 329 |
val name = "pt_"^ak_name^ "_inst"; |
18068 | 330 |
val statement = HOLogic.mk_Trueprop (cpt $ pt_type $ at_type); |
331 |
||
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
332 |
val proof = fn _ => simp_tac simp_s 1; |
18068 | 333 |
in |
20046 | 334 |
((name, Goal.prove_global thy7 [] [] statement proof), []) |
18068 | 335 |
end) ak_names_types); |
336 |
||
337 |
(* declares an fs-axclass for every atom-kind *) |
|
338 |
(* axclass fs_<ak> *) |
|
339 |
(* 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
|
340 |
val (fs_ax_classes,thy11) = fold_map (fn (ak_name, T) => fn thy => |
18068 | 341 |
let |
26337 | 342 |
val cl_name = "fs_"^ak_name; |
28965 | 343 |
val pt_name = Sign.full_bname thy ("pt_"^ak_name); |
18068 | 344 |
val ty = TFree("'a",["HOL.type"]); |
345 |
val x = Free ("x", ty); |
|
19494 | 346 |
val csupp = Const ("Nominal.supp", ty --> HOLogic.mk_setT T); |
22274 | 347 |
val cfinite = Const ("Finite_Set.finite", HOLogic.mk_setT T --> HOLogic.boolT) |
18068 | 348 |
|
22274 | 349 |
val axiom1 = HOLogic.mk_Trueprop (cfinite $ (csupp $ x)); |
18068 | 350 |
|
351 |
in |
|
30345 | 352 |
AxClass.define_class (Binding.name cl_name, [pt_name]) [] |
353 |
[((Binding.name (cl_name ^ "1"), []), [axiom1])] thy |
|
18438
b8d867177916
made the changes according to Florian's re-arranging of
urbanc
parents:
18437
diff
changeset
|
354 |
end) ak_names_types thy8; |
26337 | 355 |
|
18068 | 356 |
(* proves that every fs_<ak>-type together with <ak>-type *) |
357 |
(* instance of fs-type *) |
|
358 |
(* lemma abst_<ak>_inst: *) |
|
359 |
(* fs TYPE('x::pt_<ak>) TYPE (<ak>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
360 |
val (fs_inst_thms,thy12) = |
29585 | 361 |
thy11 |> add_thms_string (map (fn (ak_name, T) => |
18068 | 362 |
let |
28965 | 363 |
val ak_name_qu = Sign.full_bname thy11 ak_name; |
364 |
val fs_name_qu = Sign.full_bname thy11 ("fs_"^ak_name); |
|
18068 | 365 |
val i_type1 = TFree("'x",[fs_name_qu]); |
366 |
val i_type2 = Type(ak_name_qu,[]); |
|
26337 | 367 |
val cfs = Const ("Nominal.fs", |
18068 | 368 |
(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
369 |
val fs_type = Logic.mk_type i_type1; |
|
370 |
val at_type = Logic.mk_type i_type2; |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
371 |
val simp_s = HOL_ss addsimps maps (PureThy.get_thms thy11) |
26337 | 372 |
["fs_def", |
373 |
"fs_" ^ ak_name ^ "1"]; |
|
18068 | 374 |
|
26337 | 375 |
val name = "fs_"^ak_name^ "_inst"; |
18068 | 376 |
val statement = HOLogic.mk_Trueprop (cfs $ fs_type $ at_type); |
377 |
||
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
378 |
val proof = fn _ => simp_tac simp_s 1; |
18068 | 379 |
in |
20046 | 380 |
((name, Goal.prove_global thy11 [] [] statement proof), []) |
18068 | 381 |
end) ak_names_types); |
382 |
||
383 |
(* declares for every atom-kind combination an axclass *) |
|
384 |
(* cp_<ak1>_<ak2> giving a composition property *) |
|
385 |
(* cp_<ak1>_<ak2>1: pi1 o pi2 o x = (pi1 o pi2) o (pi1 o x) *) |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
386 |
val (cp_ax_classes,thy12b) = fold_map (fn (ak_name, T) => fn thy => |
26337 | 387 |
fold_map (fn (ak_name', T') => fn thy' => |
388 |
let |
|
389 |
val cl_name = "cp_"^ak_name^"_"^ak_name'; |
|
390 |
val ty = TFree("'a",["HOL.type"]); |
|
18068 | 391 |
val x = Free ("x", ty); |
392 |
val pi1 = Free ("pi1", mk_permT T); |
|
26337 | 393 |
val pi2 = Free ("pi2", mk_permT T'); |
394 |
val cperm1 = Const ("Nominal.perm", mk_permT T --> ty --> ty); |
|
19494 | 395 |
val cperm2 = Const ("Nominal.perm", mk_permT T' --> ty --> ty); |
396 |
val cperm3 = Const ("Nominal.perm", mk_permT T --> mk_permT T' --> mk_permT T'); |
|
18068 | 397 |
|
398 |
val ax1 = HOLogic.mk_Trueprop |
|
26337 | 399 |
(HOLogic.mk_eq (cperm1 $ pi1 $ (cperm2 $ pi2 $ x), |
18068 | 400 |
cperm2 $ (cperm3 $ pi1 $ pi2) $ (cperm1 $ pi1 $ x))); |
26337 | 401 |
in |
30345 | 402 |
AxClass.define_class (Binding.name cl_name, ["HOL.type"]) [] |
28965 | 403 |
[((Binding.name (cl_name ^ "1"), []), [ax1])] thy' |
26337 | 404 |
end) ak_names_types thy) ak_names_types thy12; |
18068 | 405 |
|
406 |
(* proves for every <ak>-combination a cp_<ak1>_<ak2>_inst theorem; *) |
|
407 |
(* lemma cp_<ak1>_<ak2>_inst: *) |
|
408 |
(* 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
|
409 |
val (cp_thms,thy12c) = fold_map (fn (ak_name, T) => fn thy => |
26337 | 410 |
fold_map (fn (ak_name', T') => fn thy' => |
18068 | 411 |
let |
28965 | 412 |
val ak_name_qu = Sign.full_bname thy' (ak_name); |
413 |
val ak_name_qu' = Sign.full_bname thy' (ak_name'); |
|
414 |
val cp_name_qu = Sign.full_bname thy' ("cp_"^ak_name^"_"^ak_name'); |
|
18068 | 415 |
val i_type0 = TFree("'a",[cp_name_qu]); |
416 |
val i_type1 = Type(ak_name_qu,[]); |
|
417 |
val i_type2 = Type(ak_name_qu',[]); |
|
26337 | 418 |
val ccp = Const ("Nominal.cp", |
18068 | 419 |
(Term.itselfT i_type0)-->(Term.itselfT i_type1)--> |
420 |
(Term.itselfT i_type2)-->HOLogic.boolT); |
|
421 |
val at_type = Logic.mk_type i_type1; |
|
422 |
val at_type' = Logic.mk_type i_type2; |
|
26337 | 423 |
val cp_type = Logic.mk_type i_type0; |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
424 |
val simp_s = HOL_basic_ss addsimps maps (PureThy.get_thms thy') ["cp_def"]; |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
425 |
val cp1 = PureThy.get_thm thy' ("cp_" ^ ak_name ^ "_" ^ ak_name' ^ "1"); |
18068 | 426 |
|
26337 | 427 |
val name = "cp_"^ak_name^ "_"^ak_name'^"_inst"; |
18068 | 428 |
val statement = HOLogic.mk_Trueprop (ccp $ cp_type $ at_type $ at_type'); |
429 |
||
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
430 |
val proof = fn _ => EVERY [simp_tac simp_s 1, |
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
431 |
rtac allI 1, rtac allI 1, rtac allI 1, |
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
432 |
rtac cp1 1]; |
26337 | 433 |
in |
29585 | 434 |
yield_singleton add_thms_string ((name, |
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
435 |
Goal.prove_global thy' [] [] statement proof), []) thy' |
26337 | 436 |
end) |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
437 |
ak_names_types thy) ak_names_types thy12b; |
18068 | 438 |
|
439 |
(* proves for every non-trivial <ak>-combination a disjointness *) |
|
440 |
(* theorem; i.e. <ak1> != <ak2> *) |
|
441 |
(* lemma ds_<ak1>_<ak2>: *) |
|
442 |
(* dj TYPE(<ak1>) TYPE(<ak2>) *) |
|
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
443 |
val (dj_thms, thy12d) = fold_map (fn (ak_name,T) => fn thy => |
26337 | 444 |
fold_map (fn (ak_name',T') => fn thy' => |
18068 | 445 |
(if not (ak_name = ak_name') |
446 |
then |
|
26337 | 447 |
let |
28965 | 448 |
val ak_name_qu = Sign.full_bname thy' ak_name; |
449 |
val ak_name_qu' = Sign.full_bname thy' ak_name'; |
|
18068 | 450 |
val i_type1 = Type(ak_name_qu,[]); |
451 |
val i_type2 = Type(ak_name_qu',[]); |
|
26337 | 452 |
val cdj = Const ("Nominal.disjoint", |
18068 | 453 |
(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT); |
454 |
val at_type = Logic.mk_type i_type1; |
|
455 |
val at_type' = Logic.mk_type i_type2; |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
456 |
val simp_s = HOL_ss addsimps maps (PureThy.get_thms thy') |
26337 | 457 |
["disjoint_def", |
458 |
ak_name ^ "_prm_" ^ ak_name' ^ "_def", |
|
459 |
ak_name' ^ "_prm_" ^ ak_name ^ "_def"]; |
|
18068 | 460 |
|
26337 | 461 |
val name = "dj_"^ak_name^"_"^ak_name'; |
18068 | 462 |
val statement = HOLogic.mk_Trueprop (cdj $ at_type $ at_type'); |
463 |
||
24527
888d56a8d9d3
modified proofs so that they are not using claset()
urbanc
parents:
24218
diff
changeset
|
464 |
val proof = fn _ => simp_tac simp_s 1; |
26337 | 465 |
in |
29585 | 466 |
add_thms_string [((name, Goal.prove_global thy' [] [] statement proof), [])] thy' |
26337 | 467 |
end |
18068 | 468 |
else |
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
469 |
([],thy'))) (* do nothing branch, if ak_name = ak_name' *) |
26337 | 470 |
ak_names_types thy) ak_names_types thy12c; |
18068 | 471 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
472 |
(******** pt_<ak> class instances ********) |
18068 | 473 |
(*=========================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
474 |
(* some abbreviations for theorems *) |
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
475 |
val pt1 = @{thm "pt1"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
476 |
val pt2 = @{thm "pt2"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
477 |
val pt3 = @{thm "pt3"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
478 |
val at_pt_inst = @{thm "at_pt_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
479 |
val pt_unit_inst = @{thm "pt_unit_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
480 |
val pt_prod_inst = @{thm "pt_prod_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
481 |
val pt_nprod_inst = @{thm "pt_nprod_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
482 |
val pt_list_inst = @{thm "pt_list_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
483 |
val pt_optn_inst = @{thm "pt_option_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
484 |
val pt_noptn_inst = @{thm "pt_noption_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
485 |
val pt_fun_inst = @{thm "pt_fun_inst"}; |
18068 | 486 |
|
18435 | 487 |
(* for all atom-kind combinations <ak>/<ak'> show that *) |
488 |
(* every <ak> is an instance of pt_<ak'>; the proof for *) |
|
489 |
(* ak!=ak' is by definition; the case ak=ak' uses at_pt_inst. *) |
|
18431 | 490 |
val thy13 = fold (fn ak_name => fn thy => |
26337 | 491 |
fold (fn ak_name' => fn thy' => |
18431 | 492 |
let |
28965 | 493 |
val qu_name = Sign.full_bname thy' ak_name'; |
494 |
val cls_name = Sign.full_bname thy' ("pt_"^ak_name); |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
495 |
val at_inst = PureThy.get_thm thy' ("at_" ^ ak_name' ^ "_inst"); |
18431 | 496 |
|
24218 | 497 |
val proof1 = EVERY [Class.intro_classes_tac [], |
18068 | 498 |
rtac ((at_inst RS at_pt_inst) RS pt1) 1, |
499 |
rtac ((at_inst RS at_pt_inst) RS pt2) 1, |
|
500 |
rtac ((at_inst RS at_pt_inst) RS pt3) 1, |
|
501 |
atac 1]; |
|
18431 | 502 |
val simp_s = HOL_basic_ss addsimps |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
503 |
maps (PureThy.get_thms thy') [ak_name ^ "_prm_" ^ ak_name' ^ "_def"]; |
24218 | 504 |
val proof2 = EVERY [Class.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)]; |
18431 | 505 |
|
506 |
in |
|
507 |
thy' |
|
19275 | 508 |
|> AxClass.prove_arity (qu_name,[],[cls_name]) |
18431 | 509 |
(if ak_name = ak_name' then proof1 else proof2) |
26484 | 510 |
end) ak_names thy) ak_names thy12d; |
18068 | 511 |
|
18430 | 512 |
(* show that *) |
513 |
(* fun(pt_<ak>,pt_<ak>) *) |
|
18579
002d371401f5
changed the name of the type "nOption" to "noption".
urbanc
parents:
18438
diff
changeset
|
514 |
(* noption(pt_<ak>) *) |
18430 | 515 |
(* option(pt_<ak>) *) |
516 |
(* list(pt_<ak>) *) |
|
517 |
(* *(pt_<ak>,pt_<ak>) *) |
|
18600 | 518 |
(* nprod(pt_<ak>,pt_<ak>) *) |
18430 | 519 |
(* unit *) |
520 |
(* set(pt_<ak>) *) |
|
521 |
(* are instances of pt_<ak> *) |
|
18431 | 522 |
val thy18 = fold (fn ak_name => fn thy => |
18068 | 523 |
let |
28965 | 524 |
val cls_name = Sign.full_bname thy ("pt_"^ak_name); |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
525 |
val at_thm = PureThy.get_thm thy ("at_"^ak_name^"_inst"); |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
526 |
val pt_inst = PureThy.get_thm thy ("pt_"^ak_name^"_inst"); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
527 |
|
18430 | 528 |
fun pt_proof thm = |
24218 | 529 |
EVERY [Class.intro_classes_tac [], |
18430 | 530 |
rtac (thm RS pt1) 1, rtac (thm RS pt2) 1, rtac (thm RS pt3) 1, atac 1]; |
531 |
||
532 |
val pt_thm_fun = at_thm RS (pt_inst RS (pt_inst RS pt_fun_inst)); |
|
533 |
val pt_thm_noptn = pt_inst RS pt_noptn_inst; |
|
534 |
val pt_thm_optn = pt_inst RS pt_optn_inst; |
|
535 |
val pt_thm_list = pt_inst RS pt_list_inst; |
|
536 |
val pt_thm_prod = pt_inst RS (pt_inst RS pt_prod_inst); |
|
18600 | 537 |
val pt_thm_nprod = pt_inst RS (pt_inst RS pt_nprod_inst); |
18430 | 538 |
val pt_thm_unit = pt_unit_inst; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
539 |
in |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
540 |
thy |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
541 |
|> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_fun) |
19494 | 542 |
|> AxClass.prove_arity ("Nominal.noption",[[cls_name]],[cls_name]) (pt_proof pt_thm_noptn) |
30235
58d147683393
Made Option a separate theory and renamed option_map to Option.map
nipkow
parents:
30086
diff
changeset
|
543 |
|> AxClass.prove_arity ("Option.option",[[cls_name]],[cls_name]) (pt_proof pt_thm_optn) |
19275 | 544 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (pt_proof pt_thm_list) |
545 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_prod) |
|
19494 | 546 |
|> AxClass.prove_arity ("Nominal.nprod",[[cls_name],[cls_name]],[cls_name]) |
18600 | 547 |
(pt_proof pt_thm_nprod) |
19275 | 548 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (pt_proof pt_thm_unit) |
18430 | 549 |
end) ak_names thy13; |
18068 | 550 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
551 |
(******** fs_<ak> class instances ********) |
18068 | 552 |
(*=========================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
553 |
(* abbreviations for some lemmas *) |
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
554 |
val fs1 = @{thm "fs1"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
555 |
val fs_at_inst = @{thm "fs_at_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
556 |
val fs_unit_inst = @{thm "fs_unit_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
557 |
val fs_prod_inst = @{thm "fs_prod_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
558 |
val fs_nprod_inst = @{thm "fs_nprod_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
559 |
val fs_list_inst = @{thm "fs_list_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
560 |
val fs_option_inst = @{thm "fs_option_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
561 |
val dj_supp = @{thm "dj_supp"}; |
18068 | 562 |
|
563 |
(* shows that <ak> is an instance of fs_<ak> *) |
|
564 |
(* uses the theorem at_<ak>_inst *) |
|
18431 | 565 |
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
|
566 |
fold (fn ak_name' => fn thy' => |
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
567 |
let |
28965 | 568 |
val qu_name = Sign.full_bname thy' ak_name'; |
569 |
val qu_class = Sign.full_bname thy' ("fs_"^ak_name); |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
570 |
val proof = |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
571 |
(if ak_name = ak_name' |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
572 |
then |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
573 |
let val at_thm = PureThy.get_thm thy' ("at_"^ak_name^"_inst"); |
24218 | 574 |
in EVERY [Class.intro_classes_tac [], |
18437
ee0283e5dfe3
added proofs to show that every atom-kind combination
urbanc
parents:
18436
diff
changeset
|
575 |
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
|
576 |
else |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
577 |
let val dj_inst = PureThy.get_thm thy' ("dj_"^ak_name'^"_"^ak_name); |
22274 | 578 |
val simp_s = HOL_basic_ss addsimps [dj_inst RS dj_supp, finite_emptyI]; |
24218 | 579 |
in EVERY [Class.intro_classes_tac [], asm_simp_tac simp_s 1] end) |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
580 |
in |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
581 |
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
|
582 |
end) ak_names thy) ak_names thy18; |
18068 | 583 |
|
18431 | 584 |
(* shows that *) |
585 |
(* unit *) |
|
586 |
(* *(fs_<ak>,fs_<ak>) *) |
|
18600 | 587 |
(* nprod(fs_<ak>,fs_<ak>) *) |
18431 | 588 |
(* list(fs_<ak>) *) |
589 |
(* option(fs_<ak>) *) |
|
590 |
(* are instances of fs_<ak> *) |
|
18068 | 591 |
|
18431 | 592 |
val thy24 = fold (fn ak_name => fn thy => |
593 |
let |
|
28965 | 594 |
val cls_name = Sign.full_bname thy ("fs_"^ak_name); |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
595 |
val fs_inst = PureThy.get_thm thy ("fs_"^ak_name^"_inst"); |
24218 | 596 |
fun fs_proof thm = EVERY [Class.intro_classes_tac [], rtac (thm RS fs1) 1]; |
18068 | 597 |
|
18600 | 598 |
val fs_thm_unit = fs_unit_inst; |
599 |
val fs_thm_prod = fs_inst RS (fs_inst RS fs_prod_inst); |
|
600 |
val fs_thm_nprod = fs_inst RS (fs_inst RS fs_nprod_inst); |
|
601 |
val fs_thm_list = fs_inst RS fs_list_inst; |
|
602 |
val fs_thm_optn = fs_inst RS fs_option_inst; |
|
18431 | 603 |
in |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
604 |
thy |
19275 | 605 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (fs_proof fs_thm_unit) |
606 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (fs_proof fs_thm_prod) |
|
19494 | 607 |
|> AxClass.prove_arity ("Nominal.nprod",[[cls_name],[cls_name]],[cls_name]) |
18600 | 608 |
(fs_proof fs_thm_nprod) |
19275 | 609 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (fs_proof fs_thm_list) |
30235
58d147683393
Made Option a separate theory and renamed option_map to Option.map
nipkow
parents:
30086
diff
changeset
|
610 |
|> AxClass.prove_arity ("Option.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
|
611 |
end) ak_names thy20; |
18431 | 612 |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
613 |
(******** cp_<ak>_<ai> class instances ********) |
18068 | 614 |
(*==============================================*) |
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
615 |
(* abbreviations for some lemmas *) |
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
616 |
val cp1 = @{thm "cp1"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
617 |
val cp_unit_inst = @{thm "cp_unit_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
618 |
val cp_bool_inst = @{thm "cp_bool_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
619 |
val cp_prod_inst = @{thm "cp_prod_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
620 |
val cp_list_inst = @{thm "cp_list_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
621 |
val cp_fun_inst = @{thm "cp_fun_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
622 |
val cp_option_inst = @{thm "cp_option_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
623 |
val cp_noption_inst = @{thm "cp_noption_inst"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
624 |
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
|
625 |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
626 |
val dj_pp_forget = @{thm "dj_perm_perm_forget"}; |
18068 | 627 |
|
628 |
(* shows that <aj> is an instance of cp_<ak>_<ai> *) |
|
18432 | 629 |
(* for every <ak>/<ai>-combination *) |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
630 |
val thy25 = fold (fn ak_name => fn thy => |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
631 |
fold (fn ak_name' => fn thy' => |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
632 |
fold (fn ak_name'' => fn thy'' => |
18068 | 633 |
let |
28965 | 634 |
val name = Sign.full_bname thy'' ak_name; |
635 |
val cls_name = Sign.full_bname thy'' ("cp_"^ak_name'^"_"^ak_name''); |
|
18068 | 636 |
val proof = |
637 |
(if (ak_name'=ak_name'') then |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
638 |
(let |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
639 |
val pt_inst = PureThy.get_thm thy'' ("pt_"^ak_name''^"_inst"); |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
640 |
val at_inst = PureThy.get_thm thy'' ("at_"^ak_name''^"_inst"); |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
641 |
in |
26337 | 642 |
EVERY [Class.intro_classes_tac [], |
18068 | 643 |
rtac (at_inst RS (pt_inst RS pt_perm_compose)) 1] |
644 |
end) |
|
26337 | 645 |
else |
646 |
(let |
|
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
647 |
val dj_inst = PureThy.get_thm thy'' ("dj_"^ak_name''^"_"^ak_name'); |
26337 | 648 |
val simp_s = HOL_basic_ss addsimps |
18068 | 649 |
((dj_inst RS dj_pp_forget):: |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
650 |
(maps (PureThy.get_thms thy'') |
26337 | 651 |
[ak_name' ^"_prm_"^ak_name^"_def", |
652 |
ak_name''^"_prm_"^ak_name^"_def"])); |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
653 |
in |
24218 | 654 |
EVERY [Class.intro_classes_tac [], simp_tac simp_s 1] |
18068 | 655 |
end)) |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
656 |
in |
19275 | 657 |
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
|
658 |
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
|
659 |
|
18432 | 660 |
(* shows that *) |
661 |
(* units *) |
|
662 |
(* products *) |
|
663 |
(* lists *) |
|
664 |
(* functions *) |
|
665 |
(* options *) |
|
666 |
(* noptions *) |
|
22536
35debf264656
made the type sets instance of the "cp" type-class
urbanc
parents:
22535
diff
changeset
|
667 |
(* sets *) |
18432 | 668 |
(* are instances of cp_<ak>_<ai> for every <ak>/<ai>-combination *) |
669 |
val thy26 = fold (fn ak_name => fn thy => |
|
26337 | 670 |
fold (fn ak_name' => fn thy' => |
18432 | 671 |
let |
28965 | 672 |
val cls_name = Sign.full_bname thy' ("cp_"^ak_name^"_"^ak_name'); |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
673 |
val cp_inst = PureThy.get_thm thy' ("cp_"^ak_name^"_"^ak_name'^"_inst"); |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
674 |
val pt_inst = PureThy.get_thm thy' ("pt_"^ak_name^"_inst"); |
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
675 |
val at_inst = PureThy.get_thm thy' ("at_"^ak_name^"_inst"); |
18432 | 676 |
|
24218 | 677 |
fun cp_proof thm = EVERY [Class.intro_classes_tac [],rtac (thm RS cp1) 1]; |
26337 | 678 |
|
18432 | 679 |
val cp_thm_unit = cp_unit_inst; |
680 |
val cp_thm_prod = cp_inst RS (cp_inst RS cp_prod_inst); |
|
681 |
val cp_thm_list = cp_inst RS cp_list_inst; |
|
682 |
val cp_thm_fun = at_inst RS (pt_inst RS (cp_inst RS (cp_inst RS cp_fun_inst))); |
|
683 |
val cp_thm_optn = cp_inst RS cp_option_inst; |
|
684 |
val cp_thm_noptn = cp_inst RS cp_noption_inst; |
|
685 |
in |
|
686 |
thy' |
|
19275 | 687 |
|> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (cp_proof cp_thm_unit) |
26337 | 688 |
|> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_prod) |
19275 | 689 |
|> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (cp_proof cp_thm_list) |
690 |
|> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_fun) |
|
30235
58d147683393
Made Option a separate theory and renamed option_map to Option.map
nipkow
parents:
30086
diff
changeset
|
691 |
|> AxClass.prove_arity ("Option.option",[[cls_name]],[cls_name]) (cp_proof cp_thm_optn) |
19494 | 692 |
|> AxClass.prove_arity ("Nominal.noption",[[cls_name]],[cls_name]) (cp_proof cp_thm_noptn) |
18432 | 693 |
end) ak_names thy) ak_names thy25; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
694 |
|
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
695 |
(* show that discrete nominal types are permutation types, finitely *) |
18432 | 696 |
(* supported and have the commutation property *) |
697 |
(* 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
|
698 |
(* which renders the proofs to be simple "simp_all"-proofs. *) |
18432 | 699 |
val thy32 = |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
700 |
let |
26337 | 701 |
fun discrete_pt_inst discrete_ty defn = |
702 |
fold (fn ak_name => fn thy => |
|
703 |
let |
|
28965 | 704 |
val qu_class = Sign.full_bname thy ("pt_"^ak_name); |
26337 | 705 |
val simp_s = HOL_basic_ss addsimps [defn]; |
24218 | 706 |
val proof = EVERY [Class.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)]; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
707 |
in |
26337 | 708 |
AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy |
18432 | 709 |
end) ak_names; |
18068 | 710 |
|
18432 | 711 |
fun discrete_fs_inst discrete_ty defn = |
26337 | 712 |
fold (fn ak_name => fn thy => |
713 |
let |
|
28965 | 714 |
val qu_class = Sign.full_bname thy ("fs_"^ak_name); |
26337 | 715 |
val supp_def = @{thm "Nominal.supp_def"}; |
22274 | 716 |
val simp_s = HOL_ss addsimps [supp_def,Collect_const,finite_emptyI,defn]; |
24218 | 717 |
val proof = EVERY [Class.intro_classes_tac [], asm_simp_tac simp_s 1]; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
718 |
in |
26337 | 719 |
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
|
720 |
end) ak_names; |
18068 | 721 |
|
18432 | 722 |
fun discrete_cp_inst discrete_ty defn = |
26337 | 723 |
fold (fn ak_name' => (fold (fn ak_name => fn thy => |
724 |
let |
|
28965 | 725 |
val qu_class = Sign.full_bname thy ("cp_"^ak_name^"_"^ak_name'); |
26337 | 726 |
val supp_def = @{thm "Nominal.supp_def"}; |
18432 | 727 |
val simp_s = HOL_ss addsimps [defn]; |
24218 | 728 |
val proof = EVERY [Class.intro_classes_tac [], asm_simp_tac simp_s 1]; |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
729 |
in |
26337 | 730 |
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
|
731 |
end) ak_names)) ak_names; |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
732 |
|
18432 | 733 |
in |
734 |
thy26 |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
735 |
|> discrete_pt_inst "nat" @{thm "perm_nat_def"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
736 |
|> discrete_fs_inst "nat" @{thm "perm_nat_def"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
737 |
|> discrete_cp_inst "nat" @{thm "perm_nat_def"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
738 |
|> discrete_pt_inst "bool" @{thm "perm_bool"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
739 |
|> discrete_fs_inst "bool" @{thm "perm_bool"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
740 |
|> discrete_cp_inst "bool" @{thm "perm_bool"} |
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25557
diff
changeset
|
741 |
|> discrete_pt_inst @{type_name "Int.int"} @{thm "perm_int_def"} |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25557
diff
changeset
|
742 |
|> discrete_fs_inst @{type_name "Int.int"} @{thm "perm_int_def"} |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25557
diff
changeset
|
743 |
|> discrete_cp_inst @{type_name "Int.int"} @{thm "perm_int_def"} |
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
744 |
|> discrete_pt_inst "List.char" @{thm "perm_char_def"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
745 |
|> discrete_fs_inst "List.char" @{thm "perm_char_def"} |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
746 |
|> discrete_cp_inst "List.char" @{thm "perm_char_def"} |
18432 | 747 |
end; |
748 |
||
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
749 |
|
18262 | 750 |
(* abbreviations for some lemmas *) |
751 |
(*===============================*) |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
752 |
val abs_fun_pi = @{thm "Nominal.abs_fun_pi"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
753 |
val abs_fun_pi_ineq = @{thm "Nominal.abs_fun_pi_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
754 |
val abs_fun_eq = @{thm "Nominal.abs_fun_eq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
755 |
val abs_fun_eq' = @{thm "Nominal.abs_fun_eq'"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
756 |
val abs_fun_fresh = @{thm "Nominal.abs_fun_fresh"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
757 |
val abs_fun_fresh' = @{thm "Nominal.abs_fun_fresh'"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
758 |
val dj_perm_forget = @{thm "Nominal.dj_perm_forget"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
759 |
val dj_pp_forget = @{thm "Nominal.dj_perm_perm_forget"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
760 |
val fresh_iff = @{thm "Nominal.fresh_abs_fun_iff"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
761 |
val fresh_iff_ineq = @{thm "Nominal.fresh_abs_fun_iff_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
762 |
val abs_fun_supp = @{thm "Nominal.abs_fun_supp"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
763 |
val abs_fun_supp_ineq = @{thm "Nominal.abs_fun_supp_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
764 |
val pt_swap_bij = @{thm "Nominal.pt_swap_bij"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
765 |
val pt_swap_bij' = @{thm "Nominal.pt_swap_bij'"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
766 |
val pt_fresh_fresh = @{thm "Nominal.pt_fresh_fresh"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
767 |
val pt_bij = @{thm "Nominal.pt_bij"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
768 |
val pt_perm_compose = @{thm "Nominal.pt_perm_compose"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
769 |
val pt_perm_compose' = @{thm "Nominal.pt_perm_compose'"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
770 |
val perm_app = @{thm "Nominal.pt_fun_app_eq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
771 |
val at_fresh = @{thm "Nominal.at_fresh"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
772 |
val at_fresh_ineq = @{thm "Nominal.at_fresh_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
773 |
val at_calc = @{thms "Nominal.at_calc"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
774 |
val at_swap_simps = @{thms "Nominal.at_swap_simps"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
775 |
val at_supp = @{thm "Nominal.at_supp"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
776 |
val dj_supp = @{thm "Nominal.dj_supp"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
777 |
val fresh_left_ineq = @{thm "Nominal.pt_fresh_left_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
778 |
val fresh_left = @{thm "Nominal.pt_fresh_left"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
779 |
val fresh_right_ineq = @{thm "Nominal.pt_fresh_right_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
780 |
val fresh_right = @{thm "Nominal.pt_fresh_right"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
781 |
val fresh_bij_ineq = @{thm "Nominal.pt_fresh_bij_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
782 |
val fresh_bij = @{thm "Nominal.pt_fresh_bij"}; |
26773 | 783 |
val fresh_star_bij_ineq = @{thms "Nominal.pt_fresh_star_bij_ineq"}; |
784 |
val fresh_star_bij = @{thms "Nominal.pt_fresh_star_bij"}; |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
785 |
val fresh_eqvt = @{thm "Nominal.pt_fresh_eqvt"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
786 |
val fresh_eqvt_ineq = @{thm "Nominal.pt_fresh_eqvt_ineq"}; |
30086 | 787 |
val fresh_star_eqvt = @{thms "Nominal.pt_fresh_star_eqvt"}; |
788 |
val fresh_star_eqvt_ineq= @{thms "Nominal.pt_fresh_star_eqvt_ineq"}; |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
789 |
val set_diff_eqvt = @{thm "Nominal.pt_set_diff_eqvt"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
790 |
val in_eqvt = @{thm "Nominal.pt_in_eqvt"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
791 |
val eq_eqvt = @{thm "Nominal.pt_eq_eqvt"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
792 |
val all_eqvt = @{thm "Nominal.pt_all_eqvt"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
793 |
val ex_eqvt = @{thm "Nominal.pt_ex_eqvt"}; |
28011 | 794 |
val ex1_eqvt = @{thm "Nominal.pt_ex1_eqvt"}; |
795 |
val the_eqvt = @{thm "Nominal.pt_the_eqvt"}; |
|
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
796 |
val pt_pi_rev = @{thm "Nominal.pt_pi_rev"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
797 |
val pt_rev_pi = @{thm "Nominal.pt_rev_pi"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
798 |
val at_exists_fresh = @{thm "Nominal.at_exists_fresh"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
799 |
val at_exists_fresh' = @{thm "Nominal.at_exists_fresh'"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
800 |
val fresh_perm_app_ineq = @{thm "Nominal.pt_fresh_perm_app_ineq"}; |
26337 | 801 |
val fresh_perm_app = @{thm "Nominal.pt_fresh_perm_app"}; |
23894
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
802 |
val fresh_aux = @{thm "Nominal.pt_fresh_aux"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
803 |
val pt_perm_supp_ineq = @{thm "Nominal.pt_perm_supp_ineq"}; |
1a4167d761ac
tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
wenzelm
parents:
23158
diff
changeset
|
804 |
val pt_perm_supp = @{thm "Nominal.pt_perm_supp"}; |
26090 | 805 |
val subseteq_eqvt = @{thm "Nominal.pt_subseteq_eqvt"}; |
29128
4c243e6a71b2
changed the names of insert_eqvt and set_eqvt so that it is clear that they have preconditions
Christian Urban <urbanc@in.tum.de>
parents:
28965
diff
changeset
|
806 |
val insert_eqvt = @{thm "Nominal.pt_insert_eqvt"}; |
4c243e6a71b2
changed the names of insert_eqvt and set_eqvt so that it is clear that they have preconditions
Christian Urban <urbanc@in.tum.de>
parents:
28965
diff
changeset
|
807 |
val set_eqvt = @{thm "Nominal.pt_set_eqvt"}; |
26820 | 808 |
val perm_set_eq = @{thm "Nominal.perm_set_eq"}; |
22786 | 809 |
|
18262 | 810 |
(* Now we collect and instantiate some lemmas w.r.t. all atom *) |
811 |
(* types; this allows for example to use abs_perm (which is a *) |
|
812 |
(* collection of theorems) instead of thm abs_fun_pi with explicit *) |
|
813 |
(* instantiations. *) |
|
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
814 |
val (_, thy33) = |
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
815 |
let |
18651
0cb5a8f501aa
added the thms-collection "pt_id" (collection of all pt_<ak>1 lemmas)
urbanc
parents:
18626
diff
changeset
|
816 |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
817 |
(* 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
|
818 |
(* produces a list of theorems of the form [t1 RS thm,..,tn RS thm] *) |
18262 | 819 |
fun instR thm thms = map (fn ti => ti RS thm) thms; |
18068 | 820 |
|
26773 | 821 |
(* takes a theorem thm and a list of theorems [(t1,m1),..,(tn,mn)] *) |
822 |
(* produces a list of theorems of the form [[t1,m1] MRS thm,..,[tn,mn] MRS thm] *) |
|
823 |
fun instRR thm thms = map (fn (ti,mi) => [ti,mi] MRS thm) thms; |
|
824 |
||
18262 | 825 |
(* takes two theorem lists (hopefully of the same length ;o) *) |
826 |
(* produces a list of theorems of the form *) |
|
827 |
(* [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
|
828 |
fun inst_zip thms1 thms2 = map (fn (t1,t2) => t1 RS t2) (thms1 ~~ thms2); |
18068 | 829 |
|
18262 | 830 |
(* takes a theorem list of the form [l1,...,ln] *) |
831 |
(* and a list of theorem lists of the form *) |
|
832 |
(* [[h11,...,h1m],....,[hk1,....,hkm] *) |
|
833 |
(* produces the list of theorem lists *) |
|
834 |
(* [[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
|
835 |
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
|
836 |
|
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
837 |
(* FIXME: these lists do not need to be created dynamically again *) |
18262 | 838 |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
839 |
|
18068 | 840 |
(* list of all at_inst-theorems *) |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
841 |
val ats = map (fn ak => PureThy.get_thm thy32 ("at_"^ak^"_inst")) ak_names |
18068 | 842 |
(* list of all pt_inst-theorems *) |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
843 |
val pts = map (fn ak => PureThy.get_thm thy32 ("pt_"^ak^"_inst")) ak_names |
18262 | 844 |
(* list of all cp_inst-theorems as a collection of lists*) |
18068 | 845 |
val cps = |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
846 |
let fun cps_fun ak1 ak2 = PureThy.get_thm thy32 ("cp_"^ak1^"_"^ak2^"_inst") |
26337 | 847 |
in map (fn aki => (map (cps_fun aki) ak_names)) ak_names end; |
18262 | 848 |
(* list of all cp_inst-theorems that have different atom types *) |
849 |
val cps' = |
|
26337 | 850 |
let fun cps'_fun ak1 ak2 = |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
851 |
if ak1=ak2 then NONE else SOME (PureThy.get_thm thy32 ("cp_"^ak1^"_"^ak2^"_inst")) |
26337 | 852 |
in map (fn aki => (List.mapPartial I (map (cps'_fun aki) ak_names))) ak_names end; |
18068 | 853 |
(* list of all dj_inst-theorems *) |
854 |
val djs = |
|
26337 | 855 |
let fun djs_fun ak1 ak2 = |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
856 |
if ak1=ak2 then NONE else SOME(PureThy.get_thm thy32 ("dj_"^ak2^"_"^ak1)) |
26337 | 857 |
in map_filter I (map_product djs_fun ak_names ak_names) end; |
18262 | 858 |
(* list of all fs_inst-theorems *) |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
859 |
val fss = map (fn ak => PureThy.get_thm thy32 ("fs_"^ak^"_inst")) ak_names |
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
860 |
(* list of all at_inst-theorems *) |
26343
0dd2eab7b296
simplified get_thm(s): back to plain name argument;
wenzelm
parents:
26337
diff
changeset
|
861 |
val fs_axs = map (fn ak => PureThy.get_thm thy32 ("fs_"^ak^"1")) ak_names |
20097
be2d96bbf39c
replaced mk_listT by HOLogic.listT; trivial whitespace/comment changes
webertj
parents:
20046
diff
changeset
|
862 |
|
25538 | 863 |
fun inst_pt thms = maps (fn ti => instR ti pts) thms; |
864 |
fun inst_at thms = maps (fn ti => instR ti ats) thms; |
|
865 |
fun inst_fs thms = maps (fn ti => instR ti fss) thms; |
|
866 |
fun inst_cp thms cps = flat (inst_mult thms cps); |
|
26773 | 867 |
fun inst_pt_at thms = maps (fn ti => instRR ti (pts ~~ ats)) thms; |
25538 | 868 |
fun inst_dj thms = maps (fn ti => instR ti djs) thms; |
26337 | 869 |
fun inst_pt_pt_at_cp thms = inst_cp (inst_zip ats (inst_zip pts (inst_pt thms))) cps; |
18262 | 870 |
fun inst_pt_at_fs thms = inst_zip (inst_fs [fs1]) (inst_zip ats (inst_pt thms)); |
26337 | 871 |
fun inst_pt_pt_at_cp thms = |
872 |
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
|
873 |
val i_pt_pt_at_cp = inst_cp i_pt_pt_at cps'; |
26337 | 874 |
in i_pt_pt_at_cp end; |
18396
b3e7da94b51f
added a fresh_left lemma that contains all instantiation
urbanc
parents:
18381
diff
changeset
|
875 |
fun inst_pt_pt_at_cp_dj thms = inst_zip djs (inst_pt_pt_at_cp thms); |
18068 | 876 |
in |
18262 | 877 |
thy32 |
29585 | 878 |
|> add_thmss_string [(("alpha", inst_pt_at [abs_fun_eq]),[])] |
879 |
||>> add_thmss_string [(("alpha'", inst_pt_at [abs_fun_eq']),[])] |
|
880 |
||>> add_thmss_string [(("alpha_fresh", inst_pt_at [abs_fun_fresh]),[])] |
|
881 |
||>> add_thmss_string [(("alpha_fresh'", inst_pt_at [abs_fun_fresh']),[])] |
|
882 |
||>> add_thmss_string [(("perm_swap", inst_pt_at [pt_swap_bij] @ inst_pt_at [pt_swap_bij']),[])] |
|
883 |
||>> add_thmss_string |
|
27399
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
884 |
let val thms1 = inst_at at_swap_simps |
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
885 |
and thms2 = inst_dj [dj_perm_forget] |
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
886 |
in [(("swap_simps", thms1 @ thms2),[])] end |
29585 | 887 |
||>> add_thmss_string |
26337 | 888 |
let val thms1 = inst_pt_at [pt_pi_rev]; |
889 |
val thms2 = inst_pt_at [pt_rev_pi]; |
|
19139 | 890 |
in [(("perm_pi_simp",thms1 @ thms2),[])] end |
29585 | 891 |
||>> add_thmss_string [(("perm_fresh_fresh", inst_pt_at [pt_fresh_fresh]),[])] |
892 |
||>> add_thmss_string [(("perm_bij", inst_pt_at [pt_bij]),[])] |
|
893 |
||>> add_thmss_string |
|
26337 | 894 |
let val thms1 = inst_pt_at [pt_perm_compose]; |
895 |
val thms2 = instR cp1 (Library.flat cps'); |
|
18436
9649e24bc10e
added thms to perm_compose (so far only composition
urbanc
parents:
18435
diff
changeset
|
896 |
in [(("perm_compose",thms1 @ thms2),[])] end |
29585 | 897 |
||>> add_thmss_string [(("perm_compose'",inst_pt_at [pt_perm_compose']),[])] |
898 |
||>> add_thmss_string [(("perm_app", inst_pt_at [perm_app]),[])] |
|
899 |
||>> add_thmss_string [(("supp_atm", (inst_at [at_supp]) @ (inst_dj [dj_supp])),[])] |
|
900 |
||>> add_thmss_string [(("exists_fresh", inst_at [at_exists_fresh]),[])] |
|
901 |
||>> add_thmss_string [(("exists_fresh'", inst_at [at_exists_fresh']),[])] |
|
902 |
||>> add_thmss_string |
|
24569 | 903 |
let |
904 |
val thms1 = inst_pt_at [all_eqvt]; |
|
905 |
val thms2 = map (fold_rule [inductive_forall_def]) thms1 |
|
906 |
in |
|
907 |
[(("all_eqvt", thms1 @ thms2), [NominalThmDecls.eqvt_force_add])] |
|
908 |
end |
|
29585 | 909 |
||>> add_thmss_string [(("ex_eqvt", inst_pt_at [ex_eqvt]),[NominalThmDecls.eqvt_force_add])] |
910 |
||>> add_thmss_string [(("ex1_eqvt", inst_pt_at [ex1_eqvt]),[NominalThmDecls.eqvt_force_add])] |
|
911 |
||>> add_thmss_string [(("the_eqvt", inst_pt_at [the_eqvt]),[NominalThmDecls.eqvt_force_add])] |
|
912 |
||>> add_thmss_string |
|
26337 | 913 |
let val thms1 = inst_at [at_fresh] |
914 |
val thms2 = inst_dj [at_fresh_ineq] |
|
915 |
in [(("fresh_atm", thms1 @ thms2),[])] end |
|
29585 | 916 |
||>> add_thmss_string |
27399
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
917 |
let val thms1 = inst_at at_calc |
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
918 |
and thms2 = inst_dj [dj_perm_forget] |
1fb3d1219c12
added facts to lemma swap_simps and tuned lemma calc_atms
urbanc
parents:
27216
diff
changeset
|
919 |
in [(("calc_atm", thms1 @ thms2),[])] end |
29585 | 920 |
||>> add_thmss_string |
26337 | 921 |
let val thms1 = inst_pt_at [abs_fun_pi] |
922 |
and thms2 = inst_pt_pt_at_cp [abs_fun_pi_ineq] |
|
923 |
in [(("abs_perm", thms1 @ thms2),[NominalThmDecls.eqvt_add])] end |
|
29585 | 924 |
||>> add_thmss_string |
26337 | 925 |
let val thms1 = inst_dj [dj_perm_forget] |
926 |
and thms2 = inst_dj [dj_pp_forget] |
|
18279
f7a18e2b10fc
made some of the theorem look-ups static (by using
urbanc
parents:
18262
diff
changeset
|
927 |
in [(("perm_dj", thms1 @ thms2),[])] end |
29585 | 928 |
||>> add_thmss_string |
26337 | 929 |
let val thms1 = inst_pt_at_fs [fresh_iff] |
18626 | 930 |
and thms2 = inst_pt_at [fresh_iff] |
26337 | 931 |
and thms3 = inst_pt_pt_at_cp_dj [fresh_iff_ineq] |
932 |
in [(("abs_fresh", thms1 @ thms2 @ thms3),[])] end |
|
29585 | 933 |
||>> add_thmss_string |
26337 | 934 |
let val thms1 = inst_pt_at [abs_fun_supp] |
935 |
and thms2 = inst_pt_at_fs [abs_fun_supp] |
|
936 |
and thms3 = inst_pt_pt_at_cp_dj [abs_fun_supp_ineq] |
|
937 |
in [(("abs_supp", thms1 @ thms2 @ thms3),[])] end |
|
29585 | 938 |
||>> add_thmss_string |
26337 | 939 |
let val thms1 = inst_pt_at [fresh_left] |
940 |
and thms2 = inst_pt_pt_at_cp [fresh_left_ineq] |
|
941 |
in [(("fresh_left", thms1 @ thms2),[])] end |
|
29585 | 942 |
||>> add_thmss_string |
26337 | 943 |
let val thms1 = inst_pt_at [fresh_right] |
944 |
and thms2 = inst_pt_pt_at_cp [fresh_right_ineq] |
|
945 |
in [(("fresh_right", thms1 @ thms2),[])] end |
|
29585 | 946 |
||>> add_thmss_string |
26337 | 947 |
let val thms1 = inst_pt_at [fresh_bij] |
948 |
and thms2 = inst_pt_pt_at_cp [fresh_bij_ineq] |
|
949 |
in [(("fresh_bij", thms1 @ thms2),[])] end |
|
29585 | 950 |
||>> add_thmss_string |
26773 | 951 |
let val thms1 = inst_pt_at fresh_star_bij |
30086 | 952 |
and thms2 = maps (fn ti => inst_pt_pt_at_cp [ti]) fresh_star_bij_ineq |
26773 | 953 |
in [(("fresh_star_bij", thms1 @ thms2),[])] end |
29585 | 954 |
||>> add_thmss_string |
26337 | 955 |
let val thms1 = inst_pt_at [fresh_eqvt] |
22535
cbee450f88a6
added extended the lemma for equivariance of freshness
urbanc
parents:
22418
diff
changeset
|
956 |
and thms2 = inst_pt_pt_at_cp_dj [fresh_eqvt_ineq] |
26337 | 957 |
in [(("fresh_eqvt", thms1 @ thms2),[NominalThmDecls.eqvt_add])] end |
29585 | 958 |
||>> add_thmss_string |
30086 | 959 |
let val thms1 = inst_pt_at fresh_star_eqvt |
960 |
and thms2 = maps (fn ti => inst_pt_pt_at_cp_dj [ti]) fresh_star_eqvt_ineq |
|
961 |
in [(("fresh_star_eqvt", thms1 @ thms2),[NominalThmDecls.eqvt_add])] end |
|
962 |
||>> add_thmss_string |
|
26337 | 963 |
let val thms1 = inst_pt_at [in_eqvt] |
964 |
in [(("in_eqvt", thms1),[NominalThmDecls.eqvt_add])] end |
|
29585 | 965 |
||>> add_thmss_string |
26337 | 966 |
let val thms1 = inst_pt_at [eq_eqvt] |
967 |
in [(("eq_eqvt", thms1),[NominalThmDecls.eqvt_add])] end |
|
29585 | 968 |
||>> add_thmss_string |
26337 | 969 |
let val thms1 = inst_pt_at [set_diff_eqvt] |
970 |
in [(("set_diff_eqvt", thms1),[NominalThmDecls.eqvt_add])] end |
|
29585 | 971 |
||>> add_thmss_string |
26337 | 972 |
let val thms1 = inst_pt_at [subseteq_eqvt] |
973 |
in [(("subseteq_eqvt", thms1),[NominalThmDecls.eqvt_add])] end |
|
29585 | 974 |
||>> add_thmss_string [(("insert_eqvt", inst_pt_at [insert_eqvt]), [NominalThmDecls.eqvt_add])] |
975 |
||>> add_thmss_string [(("set_eqvt", inst_pt_at [set_eqvt]), [NominalThmDecls.eqvt_add])] |
|
976 |
||>> add_thmss_string [(("perm_set_eq", inst_pt_at [perm_set_eq]), [])] |
|
977 |
||>> add_thmss_string |
|
26337 | 978 |
let val thms1 = inst_pt_at [fresh_aux] |
979 |
and thms2 = inst_pt_pt_at_cp_dj [fresh_perm_app_ineq] |
|
980 |
in [(("fresh_aux", thms1 @ thms2),[])] end |
|
29585 | 981 |
||>> add_thmss_string |
26337 | 982 |
let val thms1 = inst_pt_at [fresh_perm_app] |
983 |
and thms2 = inst_pt_pt_at_cp_dj [fresh_perm_app_ineq] |
|
984 |
in [(("fresh_perm_app", thms1 @ thms2),[])] end |
|
29585 | 985 |
||>> add_thmss_string |
26337 | 986 |
let val thms1 = inst_pt_at [pt_perm_supp] |
987 |
and thms2 = inst_pt_pt_at_cp [pt_perm_supp_ineq] |
|
988 |
in [(("supp_eqvt", thms1 @ thms2),[NominalThmDecls.eqvt_add])] end |
|
29585 | 989 |
||>> add_thmss_string [(("fin_supp",fs_axs),[])] |
26337 | 990 |
end; |
18068 | 991 |
|
22418
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
992 |
in |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
993 |
NominalData.map (fold Symtab.update (full_ak_names ~~ map make_atom_info |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
994 |
(pt_ax_classes ~~ |
49e2d9744ae1
major update of the nominal package; there is now an infrastructure
urbanc
parents:
22274
diff
changeset
|
995 |
fs_ax_classes ~~ |
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
996 |
map (fn cls => Symtab.make (full_ak_names ~~ cls)) cp_ax_classes ~~ |
28372 | 997 |
prm_cons_thms ~~ prm_inst_thms ~~ |
28729
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
998 |
map (fn ths => Symtab.make (full_ak_names ~~ ths)) cp_thms ~~ |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
999 |
map (fn thss => Symtab.make |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
1000 |
(List.mapPartial (fn (s, [th]) => SOME (s, th) | _ => NONE) |
cfd169f1dae2
Some more functions for accessing information about atoms.
berghofe
parents:
28372
diff
changeset
|
1001 |
(full_ak_names ~~ thss))) dj_thms))) thy33 |
18068 | 1002 |
end; |
1003 |
||
1004 |
||
1005 |
(* syntax und parsing *) |
|
1006 |
structure P = OuterParse and K = OuterKeyword; |
|
1007 |
||
24867 | 1008 |
val _ = |
18068 | 1009 |
OuterSyntax.command "atom_decl" "Declare new kinds of atoms" K.thy_decl |
1010 |
(Scan.repeat1 P.name >> (Toplevel.theory o create_nom_typedecls)); |
|
1011 |
||
1012 |
end; |