author | haftmann |
Wed, 09 Apr 2014 14:08:18 +0200 | |
changeset 56528 | f732e6f3bf7f |
parent 55945 | e96383acecf9 |
child 56529 | aff193f53a64 |
permissions | -rw-r--r-- |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
1 |
(* Title: HOL/Library/Mapping.thy |
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
2 |
Author: Florian Haftmann and Ondrej Kuncar |
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
3 |
*) |
29708 | 4 |
|
5 |
header {* An abstract view on maps for code generation. *} |
|
6 |
||
7 |
theory Mapping |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
8 |
imports Main |
29708 | 9 |
begin |
10 |
||
51379 | 11 |
subsection {* Parametricity transfer rules *} |
12 |
||
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
13 |
context |
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
14 |
begin |
56528 | 15 |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
16 |
interpretation lifting_syntax . |
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
17 |
|
56528 | 18 |
lemma empty_transfer: |
19 |
"(A ===> rel_option B) Map.empty Map.empty" |
|
20 |
by transfer_prover |
|
51379 | 21 |
|
56528 | 22 |
lemma lookup_transfer: "((A ===> B) ===> A ===> B) (\<lambda>m k. m k) (\<lambda>m k. m k)" |
23 |
by transfer_prover |
|
51379 | 24 |
|
25 |
lemma update_transfer: |
|
26 |
assumes [transfer_rule]: "bi_unique A" |
|
56528 | 27 |
shows "(A ===> B ===> (A ===> rel_option B) ===> A ===> rel_option B) |
28 |
(\<lambda>k v m. m(k \<mapsto> v)) (\<lambda>k v m. m(k \<mapsto> v))" |
|
29 |
by transfer_prover |
|
51379 | 30 |
|
31 |
lemma delete_transfer: |
|
32 |
assumes [transfer_rule]: "bi_unique A" |
|
55525 | 33 |
shows "(A ===> (A ===> rel_option B) ===> A ===> rel_option B) |
56528 | 34 |
(\<lambda>k m. m(k := None)) (\<lambda>k m. m(k := None))" |
35 |
by transfer_prover |
|
51379 | 36 |
|
56528 | 37 |
lemma is_none_parametric [transfer_rule]: |
38 |
"(rel_option A ===> HOL.eq) Option.is_none Option.is_none" |
|
39 |
by (auto simp add: is_none_def rel_fun_def rel_option_iff split: option.split) |
|
51379 | 40 |
|
41 |
lemma dom_transfer: |
|
42 |
assumes [transfer_rule]: "bi_total A" |
|
55938 | 43 |
shows "((A ===> rel_option B) ===> rel_set A) dom dom" |
56528 | 44 |
unfolding dom_def [abs_def] is_none_def [symmetric] by transfer_prover |
51379 | 45 |
|
46 |
lemma map_of_transfer [transfer_rule]: |
|
47 |
assumes [transfer_rule]: "bi_unique R1" |
|
55944 | 48 |
shows "(list_all2 (rel_prod R1 R2) ===> R1 ===> rel_option R2) map_of map_of" |
56528 | 49 |
unfolding map_of_def by transfer_prover |
51379 | 50 |
|
51 |
lemma tabulate_transfer: |
|
52 |
assumes [transfer_rule]: "bi_unique A" |
|
55525 | 53 |
shows "(list_all2 A ===> (A ===> B) ===> A ===> rel_option B) |
56528 | 54 |
(\<lambda>ks f. (map_of (map (\<lambda>k. (k, f k)) ks))) (\<lambda>ks f. (map_of (map (\<lambda>k. (k, f k)) ks)))" |
55 |
by transfer_prover |
|
51379 | 56 |
|
57 |
lemma bulkload_transfer: |
|
56528 | 58 |
"(list_all2 A ===> HOL.eq ===> rel_option A) |
51379 | 59 |
(\<lambda>xs k. if k < length xs then Some (xs ! k) else None) (\<lambda>xs k. if k < length xs then Some (xs ! k) else None)" |
56528 | 60 |
proof |
61 |
fix xs ys |
|
62 |
assume "list_all2 A xs ys" |
|
63 |
then show "(HOL.eq ===> rel_option A) |
|
64 |
(\<lambda>k. if k < length xs then Some (xs ! k) else None) |
|
65 |
(\<lambda>k. if k < length ys then Some (ys ! k) else None)" |
|
66 |
apply induct |
|
67 |
apply auto |
|
68 |
unfolding rel_fun_def |
|
69 |
apply clarsimp |
|
70 |
apply (case_tac xa) |
|
71 |
apply (auto dest: list_all2_lengthD list_all2_nthD) |
|
72 |
done |
|
73 |
qed |
|
51379 | 74 |
|
75 |
lemma map_transfer: |
|
55525 | 76 |
"((A ===> B) ===> (C ===> D) ===> (B ===> rel_option C) ===> A ===> rel_option D) |
56528 | 77 |
(\<lambda>f g m. (map_option g \<circ> m \<circ> f)) (\<lambda>f g m. (map_option g \<circ> m \<circ> f))" |
78 |
by transfer_prover |
|
51379 | 79 |
|
80 |
lemma map_entry_transfer: |
|
81 |
assumes [transfer_rule]: "bi_unique A" |
|
55525 | 82 |
shows "(A ===> (B ===> B) ===> (A ===> rel_option B) ===> A ===> rel_option B) |
51379 | 83 |
(\<lambda>k f m. (case m k of None \<Rightarrow> m |
84 |
| Some v \<Rightarrow> m (k \<mapsto> (f v)))) (\<lambda>k f m. (case m k of None \<Rightarrow> m |
|
85 |
| Some v \<Rightarrow> m (k \<mapsto> (f v))))" |
|
56528 | 86 |
by transfer_prover |
51379 | 87 |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
88 |
end |
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
89 |
|
29708 | 90 |
subsection {* Type definition and primitive operations *} |
91 |
||
49834 | 92 |
typedef ('a, 'b) mapping = "UNIV :: ('a \<rightharpoonup> 'b) set" |
56528 | 93 |
morphisms rep Mapping |
94 |
.. |
|
37700
bd90378b8171
refrain from using datatype declaration -- opens chance for quickcheck later on
haftmann
parents:
37299
diff
changeset
|
95 |
|
56528 | 96 |
setup_lifting (no_code) type_definition_mapping |
37700
bd90378b8171
refrain from using datatype declaration -- opens chance for quickcheck later on
haftmann
parents:
37299
diff
changeset
|
97 |
|
56528 | 98 |
lift_definition empty :: "('a, 'b) mapping" |
99 |
is Map.empty parametric empty_transfer . |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
100 |
|
56528 | 101 |
lift_definition lookup :: "('a, 'b) mapping \<Rightarrow> 'a \<Rightarrow> 'b option" |
102 |
is "\<lambda>m k. m k" parametric lookup_transfer . |
|
103 |
||
104 |
lift_definition update :: "'a \<Rightarrow> 'b \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" |
|
105 |
is "\<lambda>k v m. m(k \<mapsto> v)" parametric update_transfer . |
|
37700
bd90378b8171
refrain from using datatype declaration -- opens chance for quickcheck later on
haftmann
parents:
37299
diff
changeset
|
106 |
|
56528 | 107 |
lift_definition delete :: "'a \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" |
108 |
is "\<lambda>k m. m(k := None)" parametric delete_transfer . |
|
39380
5a2662c1e44a
established emerging canonical names *_eqI and *_eq_iff
haftmann
parents:
39302
diff
changeset
|
109 |
|
56528 | 110 |
lift_definition keys :: "('a, 'b) mapping \<Rightarrow> 'a set" |
111 |
is dom parametric dom_transfer . |
|
29708 | 112 |
|
56528 | 113 |
lift_definition tabulate :: "'a list \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('a, 'b) mapping" |
114 |
is "\<lambda>ks f. (map_of (List.map (\<lambda>k. (k, f k)) ks))" parametric tabulate_transfer . |
|
29708 | 115 |
|
56528 | 116 |
lift_definition bulkload :: "'a list \<Rightarrow> (nat, 'a) mapping" |
117 |
is "\<lambda>xs k. if k < length xs then Some (xs ! k) else None" parametric bulkload_transfer . |
|
29708 | 118 |
|
56528 | 119 |
lift_definition map :: "('c \<Rightarrow> 'a) \<Rightarrow> ('b \<Rightarrow> 'd) \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('c, 'd) mapping" |
120 |
is "\<lambda>f g m. (map_option g \<circ> m \<circ> f)" parametric map_transfer . |
|
29708 | 121 |
|
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
122 |
|
40605 | 123 |
subsection {* Functorial structure *} |
124 |
||
55467
a5c9002bc54d
renamed 'enriched_type' to more informative 'functor' (following the renaming of enriched type constructors to bounded natural functors)
blanchet
parents:
55466
diff
changeset
|
125 |
functor map: map |
55466 | 126 |
by (transfer, auto simp add: fun_eq_iff option.map_comp option.map_id)+ |
40605 | 127 |
|
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
128 |
|
29708 | 129 |
subsection {* Derived operations *} |
130 |
||
56528 | 131 |
definition ordered_keys :: "('a\<Colon>linorder, 'b) mapping \<Rightarrow> 'a list" |
132 |
where |
|
37052 | 133 |
"ordered_keys m = (if finite (keys m) then sorted_list_of_set (keys m) else [])" |
35194 | 134 |
|
56528 | 135 |
definition is_empty :: "('a, 'b) mapping \<Rightarrow> bool" |
136 |
where |
|
37052 | 137 |
"is_empty m \<longleftrightarrow> keys m = {}" |
35157 | 138 |
|
56528 | 139 |
definition size :: "('a, 'b) mapping \<Rightarrow> nat" |
140 |
where |
|
37052 | 141 |
"size m = (if finite (keys m) then card (keys m) else 0)" |
35157 | 142 |
|
56528 | 143 |
definition replace :: "'a \<Rightarrow> 'b \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" |
144 |
where |
|
37052 | 145 |
"replace k v m = (if k \<in> keys m then update k v m else m)" |
29814 | 146 |
|
56528 | 147 |
definition default :: "'a \<Rightarrow> 'b \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" |
148 |
where |
|
37052 | 149 |
"default k v m = (if k \<in> keys m then m else update k v m)" |
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
150 |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
151 |
lift_definition map_entry :: "'a \<Rightarrow> ('b \<Rightarrow> 'b) \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" is |
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
152 |
"\<lambda>k f m. (case m k of None \<Rightarrow> m |
51379 | 153 |
| Some v \<Rightarrow> m (k \<mapsto> (f v)))" parametric map_entry_transfer . |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
154 |
|
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
155 |
lemma map_entry_code [code]: "map_entry k f m = (case lookup m k of None \<Rightarrow> m |
49975
faf4afed009f
transfer package: more flexible handling of equality relations using is_equality predicate
huffman
parents:
49973
diff
changeset
|
156 |
| Some v \<Rightarrow> update k (f v) m)" |
faf4afed009f
transfer package: more flexible handling of equality relations using is_equality predicate
huffman
parents:
49973
diff
changeset
|
157 |
by transfer rule |
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
158 |
|
56528 | 159 |
definition map_default :: "'a \<Rightarrow> 'b \<Rightarrow> ('b \<Rightarrow> 'b) \<Rightarrow> ('a, 'b) mapping \<Rightarrow> ('a, 'b) mapping" |
160 |
where |
|
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
161 |
"map_default k v f m = map_entry k f (default k v m)" |
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
162 |
|
54853 | 163 |
lift_definition of_alist :: "('k \<times> 'v) list \<Rightarrow> ('k, 'v) mapping" |
56528 | 164 |
is map_of parametric map_of_transfer . |
51379 | 165 |
|
54853 | 166 |
lemma of_alist_code [code]: |
167 |
"of_alist xs = foldr (\<lambda>(k, v) m. update k v m) xs empty" |
|
56528 | 168 |
by transfer (simp add: map_add_map_of_foldr [symmetric]) |
51379 | 169 |
|
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
170 |
instantiation mapping :: (type, type) equal |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
171 |
begin |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
172 |
|
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
173 |
definition |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
174 |
"HOL.equal m1 m2 \<longleftrightarrow> (\<forall>k. lookup m1 k = lookup m2 k)" |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
175 |
|
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
176 |
instance proof |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
177 |
qed (unfold equal_mapping_def, transfer, auto) |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
178 |
|
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
179 |
end |
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
180 |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
181 |
context |
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
182 |
begin |
56528 | 183 |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
184 |
interpretation lifting_syntax . |
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
185 |
|
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
186 |
lemma [transfer_rule]: |
51379 | 187 |
assumes [transfer_rule]: "bi_total A" |
188 |
assumes [transfer_rule]: "bi_unique B" |
|
56528 | 189 |
shows "(pcr_mapping A B ===> pcr_mapping A B ===> op=) HOL.eq HOL.equal" |
190 |
by (unfold equal) transfer_prover |
|
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
191 |
|
53013
3fbcfa911863
remove unnecessary dependencies on Library/Quotient_*
kuncar
parents:
51379
diff
changeset
|
192 |
end |
51161
6ed12ae3b3e1
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann
parents:
49975
diff
changeset
|
193 |
|
56528 | 194 |
|
29708 | 195 |
subsection {* Properties *} |
196 |
||
56528 | 197 |
lemma lookup_update: |
198 |
"lookup (update k v m) k = Some v" |
|
49973 | 199 |
by transfer simp |
200 |
||
56528 | 201 |
lemma lookup_update_neq: |
202 |
"k \<noteq> k' \<Longrightarrow> lookup (update k v m) k' = lookup m k'" |
|
49973 | 203 |
by transfer simp |
204 |
||
56528 | 205 |
lemma lookup_empty: |
206 |
"lookup empty k = None" |
|
49973 | 207 |
by transfer simp |
208 |
||
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
209 |
lemma keys_is_none_rep [code_unfold]: |
37052 | 210 |
"k \<in> keys m \<longleftrightarrow> \<not> (Option.is_none (lookup m k))" |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
211 |
by transfer (auto simp add: is_none_def) |
29708 | 212 |
|
213 |
lemma update_update: |
|
214 |
"update k v (update k w m) = update k v m" |
|
215 |
"k \<noteq> l \<Longrightarrow> update k v (update l w m) = update l w (update k v m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
216 |
by (transfer, simp add: fun_upd_twist)+ |
29708 | 217 |
|
35157 | 218 |
lemma update_delete [simp]: |
219 |
"update k v (delete k m) = update k v m" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
220 |
by transfer simp |
29708 | 221 |
|
222 |
lemma delete_update: |
|
223 |
"delete k (update k v m) = delete k m" |
|
224 |
"k \<noteq> l \<Longrightarrow> delete k (update l v m) = update l v (delete k m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
225 |
by (transfer, simp add: fun_upd_twist)+ |
29708 | 226 |
|
35157 | 227 |
lemma delete_empty [simp]: |
228 |
"delete k empty = empty" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
229 |
by transfer simp |
29708 | 230 |
|
35157 | 231 |
lemma replace_update: |
37052 | 232 |
"k \<notin> keys m \<Longrightarrow> replace k v m = m" |
233 |
"k \<in> keys m \<Longrightarrow> replace k v m = update k v m" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
234 |
by (transfer, auto simp add: replace_def fun_upd_twist)+ |
29708 | 235 |
|
236 |
lemma size_empty [simp]: |
|
237 |
"size empty = 0" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
238 |
unfolding size_def by transfer simp |
29708 | 239 |
|
240 |
lemma size_update: |
|
37052 | 241 |
"finite (keys m) \<Longrightarrow> size (update k v m) = |
242 |
(if k \<in> keys m then size m else Suc (size m))" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
243 |
unfolding size_def by transfer (auto simp add: insert_dom) |
29708 | 244 |
|
245 |
lemma size_delete: |
|
37052 | 246 |
"size (delete k m) = (if k \<in> keys m then size m - 1 else size m)" |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
247 |
unfolding size_def by transfer simp |
29708 | 248 |
|
37052 | 249 |
lemma size_tabulate [simp]: |
29708 | 250 |
"size (tabulate ks f) = length (remdups ks)" |
56528 | 251 |
unfolding size_def by transfer (auto simp add: map_of_map_restrict card_set comp_def) |
29708 | 252 |
|
29831 | 253 |
lemma bulkload_tabulate: |
29826 | 254 |
"bulkload xs = tabulate [0..<length xs] (nth xs)" |
56528 | 255 |
by transfer (auto simp add: map_of_map_restrict) |
29826 | 256 |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
257 |
lemma is_empty_empty [simp]: |
37052 | 258 |
"is_empty empty" |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
259 |
unfolding is_empty_def by transfer simp |
37052 | 260 |
|
261 |
lemma is_empty_update [simp]: |
|
262 |
"\<not> is_empty (update k v m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
263 |
unfolding is_empty_def by transfer simp |
37052 | 264 |
|
265 |
lemma is_empty_delete: |
|
266 |
"is_empty (delete k m) \<longleftrightarrow> is_empty m \<or> keys m = {k}" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
267 |
unfolding is_empty_def by transfer (auto simp del: dom_eq_empty_conv) |
37052 | 268 |
|
269 |
lemma is_empty_replace [simp]: |
|
270 |
"is_empty (replace k v m) \<longleftrightarrow> is_empty m" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
271 |
unfolding is_empty_def replace_def by transfer auto |
37052 | 272 |
|
273 |
lemma is_empty_default [simp]: |
|
274 |
"\<not> is_empty (default k v m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
275 |
unfolding is_empty_def default_def by transfer auto |
37052 | 276 |
|
277 |
lemma is_empty_map_entry [simp]: |
|
278 |
"is_empty (map_entry k f m) \<longleftrightarrow> is_empty m" |
|
56528 | 279 |
unfolding is_empty_def by transfer (auto split: option.split) |
37052 | 280 |
|
281 |
lemma is_empty_map_default [simp]: |
|
282 |
"\<not> is_empty (map_default k v f m)" |
|
283 |
by (simp add: map_default_def) |
|
284 |
||
285 |
lemma keys_empty [simp]: |
|
286 |
"keys empty = {}" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
287 |
by transfer simp |
37052 | 288 |
|
289 |
lemma keys_update [simp]: |
|
290 |
"keys (update k v m) = insert k (keys m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
291 |
by transfer simp |
37052 | 292 |
|
293 |
lemma keys_delete [simp]: |
|
294 |
"keys (delete k m) = keys m - {k}" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
295 |
by transfer simp |
37052 | 296 |
|
297 |
lemma keys_replace [simp]: |
|
298 |
"keys (replace k v m) = keys m" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
299 |
unfolding replace_def by transfer (simp add: insert_absorb) |
37052 | 300 |
|
301 |
lemma keys_default [simp]: |
|
302 |
"keys (default k v m) = insert k (keys m)" |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
303 |
unfolding default_def by transfer (simp add: insert_absorb) |
37052 | 304 |
|
305 |
lemma keys_map_entry [simp]: |
|
306 |
"keys (map_entry k f m) = keys m" |
|
56528 | 307 |
by transfer (auto split: option.split) |
37052 | 308 |
|
309 |
lemma keys_map_default [simp]: |
|
310 |
"keys (map_default k v f m) = insert k (keys m)" |
|
311 |
by (simp add: map_default_def) |
|
312 |
||
313 |
lemma keys_tabulate [simp]: |
|
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
314 |
"keys (tabulate ks f) = set ks" |
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
315 |
by transfer (simp add: map_of_map_restrict o_def) |
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
316 |
|
37052 | 317 |
lemma keys_bulkload [simp]: |
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
318 |
"keys (bulkload xs) = {0..<length xs}" |
56528 | 319 |
by (simp add: bulkload_tabulate) |
37026
7e8979a155ae
operations default, map_entry, map_default; more lemmas
haftmann
parents:
36176
diff
changeset
|
320 |
|
37052 | 321 |
lemma distinct_ordered_keys [simp]: |
322 |
"distinct (ordered_keys m)" |
|
323 |
by (simp add: ordered_keys_def) |
|
324 |
||
325 |
lemma ordered_keys_infinite [simp]: |
|
326 |
"\<not> finite (keys m) \<Longrightarrow> ordered_keys m = []" |
|
327 |
by (simp add: ordered_keys_def) |
|
328 |
||
329 |
lemma ordered_keys_empty [simp]: |
|
330 |
"ordered_keys empty = []" |
|
331 |
by (simp add: ordered_keys_def) |
|
332 |
||
333 |
lemma ordered_keys_update [simp]: |
|
334 |
"k \<in> keys m \<Longrightarrow> ordered_keys (update k v m) = ordered_keys m" |
|
335 |
"finite (keys m) \<Longrightarrow> k \<notin> keys m \<Longrightarrow> ordered_keys (update k v m) = insort k (ordered_keys m)" |
|
336 |
by (simp_all add: ordered_keys_def) (auto simp only: sorted_list_of_set_insert [symmetric] insert_absorb) |
|
337 |
||
338 |
lemma ordered_keys_delete [simp]: |
|
339 |
"ordered_keys (delete k m) = remove1 k (ordered_keys m)" |
|
340 |
proof (cases "finite (keys m)") |
|
341 |
case False then show ?thesis by simp |
|
342 |
next |
|
343 |
case True note fin = True |
|
344 |
show ?thesis |
|
345 |
proof (cases "k \<in> keys m") |
|
346 |
case False with fin have "k \<notin> set (sorted_list_of_set (keys m))" by simp |
|
347 |
with False show ?thesis by (simp add: ordered_keys_def remove1_idem) |
|
348 |
next |
|
349 |
case True with fin show ?thesis by (simp add: ordered_keys_def sorted_list_of_set_remove) |
|
350 |
qed |
|
351 |
qed |
|
352 |
||
353 |
lemma ordered_keys_replace [simp]: |
|
354 |
"ordered_keys (replace k v m) = ordered_keys m" |
|
355 |
by (simp add: replace_def) |
|
356 |
||
357 |
lemma ordered_keys_default [simp]: |
|
358 |
"k \<in> keys m \<Longrightarrow> ordered_keys (default k v m) = ordered_keys m" |
|
359 |
"finite (keys m) \<Longrightarrow> k \<notin> keys m \<Longrightarrow> ordered_keys (default k v m) = insort k (ordered_keys m)" |
|
360 |
by (simp_all add: default_def) |
|
361 |
||
362 |
lemma ordered_keys_map_entry [simp]: |
|
363 |
"ordered_keys (map_entry k f m) = ordered_keys m" |
|
364 |
by (simp add: ordered_keys_def) |
|
365 |
||
366 |
lemma ordered_keys_map_default [simp]: |
|
367 |
"k \<in> keys m \<Longrightarrow> ordered_keys (map_default k v f m) = ordered_keys m" |
|
368 |
"finite (keys m) \<Longrightarrow> k \<notin> keys m \<Longrightarrow> ordered_keys (map_default k v f m) = insort k (ordered_keys m)" |
|
369 |
by (simp_all add: map_default_def) |
|
370 |
||
371 |
lemma ordered_keys_tabulate [simp]: |
|
372 |
"ordered_keys (tabulate ks f) = sort (remdups ks)" |
|
373 |
by (simp add: ordered_keys_def sorted_list_of_set_sort_remdups) |
|
374 |
||
375 |
lemma ordered_keys_bulkload [simp]: |
|
376 |
"ordered_keys (bulkload ks) = [0..<length ks]" |
|
377 |
by (simp add: ordered_keys_def) |
|
36110 | 378 |
|
56528 | 379 |
lemma tabulate_fold: |
380 |
"tabulate xs f = fold (\<lambda>k m. update k (f k) m) xs empty" |
|
381 |
proof transfer |
|
382 |
fix f :: "'a \<Rightarrow> 'b" and xs |
|
383 |
from map_add_map_of_foldr |
|
384 |
have "Map.empty ++ map_of (List.map (\<lambda>k. (k, f k)) xs) = |
|
385 |
foldr (\<lambda>(k, v) m. m(k \<mapsto> v)) (List.map (\<lambda>k. (k, f k)) xs) Map.empty" |
|
386 |
. |
|
387 |
then have "map_of (List.map (\<lambda>k. (k, f k)) xs) = foldr (\<lambda>k m. m(k \<mapsto> f k)) xs Map.empty" |
|
388 |
by (simp add: foldr_map comp_def) |
|
389 |
also have "foldr (\<lambda>k m. m(k \<mapsto> f k)) xs = fold (\<lambda>k m. m(k \<mapsto> f k)) xs" |
|
390 |
by (rule foldr_fold) (simp add: fun_eq_iff) |
|
391 |
ultimately show "map_of (List.map (\<lambda>k. (k, f k)) xs) = fold (\<lambda>k m. m(k \<mapsto> f k)) xs Map.empty" |
|
392 |
by simp |
|
393 |
qed |
|
394 |
||
31459 | 395 |
|
37700
bd90378b8171
refrain from using datatype declaration -- opens chance for quickcheck later on
haftmann
parents:
37299
diff
changeset
|
396 |
subsection {* Code generator setup *} |
31459 | 397 |
|
37701
411717732710
explicit code_datatype declaration prevents multiple instantiations later on
haftmann
parents:
37700
diff
changeset
|
398 |
code_datatype empty update |
411717732710
explicit code_datatype declaration prevents multiple instantiations later on
haftmann
parents:
37700
diff
changeset
|
399 |
|
49929
70300f1b6835
update RBT_Mapping, AList_Mapping and Mapping to use lifting/transfer
kuncar
parents:
49834
diff
changeset
|
400 |
hide_const (open) empty is_empty rep lookup update delete ordered_keys keys size |
54853 | 401 |
replace default map_entry map_default tabulate bulkload map of_alist |
35157 | 402 |
|
49975
faf4afed009f
transfer package: more flexible handling of equality relations using is_equality predicate
huffman
parents:
49973
diff
changeset
|
403 |
end |