author | nipkow |
Tue, 23 Feb 2016 16:25:08 +0100 | |
changeset 62390 | 842917225d56 |
parent 61585 | a9599d3d7610 |
child 63462 | c1fe30f2bc32 |
permissions | -rw-r--r-- |
46238
9ace9e5b79be
renaming theory AList_Impl back to AList (reverting 1fec5b365f9b; AList with distinct key invariant is called DAList)
bulwahn
parents:
46171
diff
changeset
|
1 |
(* Title: HOL/Library/AList.thy |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
2 |
Author: Norbert Schirmer, Tobias Nipkow, Martin Wildmoser, TU Muenchen |
19234 | 3 |
*) |
4 |
||
60500 | 5 |
section \<open>Implementation of Association Lists\<close> |
19234 | 6 |
|
46238
9ace9e5b79be
renaming theory AList_Impl back to AList (reverting 1fec5b365f9b; AList with distinct key invariant is called DAList)
bulwahn
parents:
46171
diff
changeset
|
7 |
theory AList |
45990
b7b905b23b2a
incorporated More_Set and More_List into the Main body -- to be consolidated later
haftmann
parents:
45884
diff
changeset
|
8 |
imports Main |
19234 | 9 |
begin |
10 |
||
59943
e83ecf0a0ee1
more qualified names -- eliminated hide_const (open);
wenzelm
parents:
58881
diff
changeset
|
11 |
context |
e83ecf0a0ee1
more qualified names -- eliminated hide_const (open);
wenzelm
parents:
58881
diff
changeset
|
12 |
begin |
e83ecf0a0ee1
more qualified names -- eliminated hide_const (open);
wenzelm
parents:
58881
diff
changeset
|
13 |
|
60500 | 14 |
text \<open> |
56327 | 15 |
The operations preserve distinctness of keys and |
16 |
function @{term "clearjunk"} distributes over them. Since |
|
22740 | 17 |
@{term clearjunk} enforces distinctness of keys it can be used |
18 |
to establish the invariant, e.g. for inductive proofs. |
|
60500 | 19 |
\<close> |
19234 | 20 |
|
61585 | 21 |
subsection \<open>\<open>update\<close> and \<open>updates\<close>\<close> |
19323 | 22 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
23 |
qualified primrec update :: "'key \<Rightarrow> 'val \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 24 |
where |
25 |
"update k v [] = [(k, v)]" |
|
26 |
| "update k v (p # ps) = (if fst p = k then (k, v) # ps else p # update k v ps)" |
|
19234 | 27 |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
28 |
lemma update_conv': "map_of (update k v al) = (map_of al)(k\<mapsto>v)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39198
diff
changeset
|
29 |
by (induct al) (auto simp add: fun_eq_iff) |
23373 | 30 |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
31 |
corollary update_conv: "map_of (update k v al) k' = ((map_of al)(k\<mapsto>v)) k'" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
32 |
by (simp add: update_conv') |
19234 | 33 |
|
34 |
lemma dom_update: "fst ` set (update k v al) = {k} \<union> fst ` set al" |
|
35 |
by (induct al) auto |
|
36 |
||
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
37 |
lemma update_keys: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
38 |
"map fst (update k v al) = |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
39 |
(if k \<in> set (map fst al) then map fst al else map fst al @ [k])" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
40 |
by (induct al) simp_all |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
41 |
|
19234 | 42 |
lemma distinct_update: |
56327 | 43 |
assumes "distinct (map fst al)" |
19234 | 44 |
shows "distinct (map fst (update k v al))" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
45 |
using assms by (simp add: update_keys) |
19234 | 46 |
|
56327 | 47 |
lemma update_filter: |
48 |
"a \<noteq> k \<Longrightarrow> update k v [q\<leftarrow>ps. fst q \<noteq> a] = [q\<leftarrow>update k v ps. fst q \<noteq> a]" |
|
19234 | 49 |
by (induct ps) auto |
50 |
||
51 |
lemma update_triv: "map_of al k = Some v \<Longrightarrow> update k v al = al" |
|
52 |
by (induct al) auto |
|
53 |
||
54 |
lemma update_nonempty [simp]: "update k v al \<noteq> []" |
|
55 |
by (induct al) auto |
|
56 |
||
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
57 |
lemma update_eqD: "update k v al = update k v' al' \<Longrightarrow> v = v'" |
56327 | 58 |
proof (induct al arbitrary: al') |
59 |
case Nil |
|
60 |
then show ?case |
|
62390 | 61 |
by (cases al') (auto split: if_split_asm) |
19234 | 62 |
next |
56327 | 63 |
case Cons |
64 |
then show ?case |
|
62390 | 65 |
by (cases al') (auto split: if_split_asm) |
19234 | 66 |
qed |
67 |
||
68 |
lemma update_last [simp]: "update k v (update k v' al) = update k v al" |
|
69 |
by (induct al) auto |
|
70 |
||
60500 | 71 |
text \<open>Note that the lists are not necessarily the same: |
56327 | 72 |
@{term "update k v (update k' v' []) = [(k', v'), (k, v)]"} and |
60500 | 73 |
@{term "update k' v' (update k v []) = [(k, v), (k', v')]"}.\<close> |
56327 | 74 |
|
75 |
lemma update_swap: |
|
76 |
"k \<noteq> k' \<Longrightarrow> |
|
77 |
map_of (update k v (update k' v' al)) = map_of (update k' v' (update k v al))" |
|
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39198
diff
changeset
|
78 |
by (simp add: update_conv' fun_eq_iff) |
19234 | 79 |
|
56327 | 80 |
lemma update_Some_unfold: |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
81 |
"map_of (update k v al) x = Some y \<longleftrightarrow> |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
82 |
x = k \<and> v = y \<or> x \<noteq> k \<and> map_of al x = Some y" |
19234 | 83 |
by (simp add: update_conv' map_upd_Some_unfold) |
84 |
||
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
85 |
lemma image_update [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
86 |
"x \<notin> A \<Longrightarrow> map_of (update x y al) ` A = map_of al ` A" |
46133
d9fe85d3d2cd
incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents:
45990
diff
changeset
|
87 |
by (simp add: update_conv') |
19234 | 88 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
89 |
qualified definition |
59943
e83ecf0a0ee1
more qualified names -- eliminated hide_const (open);
wenzelm
parents:
58881
diff
changeset
|
90 |
updates :: "'key list \<Rightarrow> 'val list \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 91 |
where "updates ks vs = fold (case_prod update) (zip ks vs)" |
19234 | 92 |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
93 |
lemma updates_simps [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
94 |
"updates [] vs ps = ps" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
95 |
"updates ks [] ps = ps" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
96 |
"updates (k#ks) (v#vs) ps = updates ks vs (update k v ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
97 |
by (simp_all add: updates_def) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
98 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
99 |
lemma updates_key_simp [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
100 |
"updates (k # ks) vs ps = |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
101 |
(case vs of [] \<Rightarrow> ps | v # vs \<Rightarrow> updates ks vs (update k v ps))" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
102 |
by (cases vs) simp_all |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
103 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
104 |
lemma updates_conv': "map_of (updates ks vs al) = (map_of al)(ks[\<mapsto>]vs)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
105 |
proof - |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
106 |
have "map_of \<circ> fold (case_prod update) (zip ks vs) = |
56327 | 107 |
fold (\<lambda>(k, v) f. f(k \<mapsto> v)) (zip ks vs) \<circ> map_of" |
39921 | 108 |
by (rule fold_commute) (auto simp add: fun_eq_iff update_conv') |
56327 | 109 |
then show ?thesis |
110 |
by (auto simp add: updates_def fun_eq_iff map_upds_fold_map_upd foldl_conv_fold split_def) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
111 |
qed |
19234 | 112 |
|
113 |
lemma updates_conv: "map_of (updates ks vs al) k = ((map_of al)(ks[\<mapsto>]vs)) k" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
114 |
by (simp add: updates_conv') |
19234 | 115 |
|
116 |
lemma distinct_updates: |
|
117 |
assumes "distinct (map fst al)" |
|
118 |
shows "distinct (map fst (updates ks vs al))" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
119 |
proof - |
46133
d9fe85d3d2cd
incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
haftmann
parents:
45990
diff
changeset
|
120 |
have "distinct (fold |
37458 | 121 |
(\<lambda>(k, v) al. if k \<in> set al then al else al @ [k]) |
122 |
(zip ks vs) (map fst al))" |
|
123 |
by (rule fold_invariant [of "zip ks vs" "\<lambda>_. True"]) (auto intro: assms) |
|
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
124 |
moreover have "map fst \<circ> fold (case_prod update) (zip ks vs) = |
56327 | 125 |
fold (\<lambda>(k, v) al. if k \<in> set al then al else al @ [k]) (zip ks vs) \<circ> map fst" |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
126 |
by (rule fold_commute) (simp add: update_keys split_def case_prod_beta comp_def) |
56327 | 127 |
ultimately show ?thesis |
128 |
by (simp add: updates_def fun_eq_iff) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
129 |
qed |
19234 | 130 |
|
131 |
lemma updates_append1[simp]: "size ks < size vs \<Longrightarrow> |
|
56327 | 132 |
updates (ks@[k]) vs al = update k (vs!size ks) (updates ks vs al)" |
20503 | 133 |
by (induct ks arbitrary: vs al) (auto split: list.splits) |
19234 | 134 |
|
135 |
lemma updates_list_update_drop[simp]: |
|
56327 | 136 |
"size ks \<le> i \<Longrightarrow> i < size vs \<Longrightarrow> |
137 |
updates ks (vs[i:=v]) al = updates ks vs al" |
|
138 |
by (induct ks arbitrary: al vs i) (auto split: list.splits nat.splits) |
|
19234 | 139 |
|
56327 | 140 |
lemma update_updates_conv_if: |
141 |
"map_of (updates xs ys (update x y al)) = |
|
142 |
map_of |
|
143 |
(if x \<in> set (take (length ys) xs) |
|
144 |
then updates xs ys al |
|
145 |
else (update x y (updates xs ys al)))" |
|
19234 | 146 |
by (simp add: updates_conv' update_conv' map_upd_upds_conv_if) |
147 |
||
148 |
lemma updates_twist [simp]: |
|
56327 | 149 |
"k \<notin> set ks \<Longrightarrow> |
150 |
map_of (updates ks vs (update k v al)) = map_of (update k v (updates ks vs al))" |
|
46507 | 151 |
by (simp add: updates_conv' update_conv') |
19234 | 152 |
|
56327 | 153 |
lemma updates_apply_notin [simp]: |
154 |
"k \<notin> set ks \<Longrightarrow> map_of (updates ks vs al) k = map_of al k" |
|
19234 | 155 |
by (simp add: updates_conv) |
156 |
||
56327 | 157 |
lemma updates_append_drop [simp]: |
158 |
"size xs = size ys \<Longrightarrow> updates (xs @ zs) ys al = updates xs ys al" |
|
20503 | 159 |
by (induct xs arbitrary: ys al) (auto split: list.splits) |
19234 | 160 |
|
56327 | 161 |
lemma updates_append2_drop [simp]: |
162 |
"size xs = size ys \<Longrightarrow> updates xs (ys @ zs) al = updates xs ys al" |
|
20503 | 163 |
by (induct xs arbitrary: ys al) (auto split: list.splits) |
19234 | 164 |
|
23373 | 165 |
|
61585 | 166 |
subsection \<open>\<open>delete\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
167 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
168 |
qualified definition delete :: "'key \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 169 |
where delete_eq: "delete k = filter (\<lambda>(k', _). k \<noteq> k')" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
170 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
171 |
lemma delete_simps [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
172 |
"delete k [] = []" |
56327 | 173 |
"delete k (p # ps) = (if fst p = k then delete k ps else p # delete k ps)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
174 |
by (auto simp add: delete_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
175 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
176 |
lemma delete_conv': "map_of (delete k al) = (map_of al)(k := None)" |
39302
d7728f65b353
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow
parents:
39198
diff
changeset
|
177 |
by (induct al) (auto simp add: fun_eq_iff) |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
178 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
179 |
corollary delete_conv: "map_of (delete k al) k' = ((map_of al)(k := None)) k'" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
180 |
by (simp add: delete_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
181 |
|
56327 | 182 |
lemma delete_keys: "map fst (delete k al) = removeAll k (map fst al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
183 |
by (simp add: delete_eq removeAll_filter_not_eq filter_map split_def comp_def) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
184 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
185 |
lemma distinct_delete: |
56327 | 186 |
assumes "distinct (map fst al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
187 |
shows "distinct (map fst (delete k al))" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
188 |
using assms by (simp add: delete_keys distinct_removeAll) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
189 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
190 |
lemma delete_id [simp]: "k \<notin> fst ` set al \<Longrightarrow> delete k al = al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
191 |
by (auto simp add: image_iff delete_eq filter_id_conv) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
192 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
193 |
lemma delete_idem: "delete k (delete k al) = delete k al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
194 |
by (simp add: delete_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
195 |
|
56327 | 196 |
lemma map_of_delete [simp]: "k' \<noteq> k \<Longrightarrow> map_of (delete k al) k' = map_of al k'" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
197 |
by (simp add: delete_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
198 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
199 |
lemma delete_notin_dom: "k \<notin> fst ` set (delete k al)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
200 |
by (auto simp add: delete_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
201 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
202 |
lemma dom_delete_subset: "fst ` set (delete k al) \<subseteq> fst ` set al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
203 |
by (auto simp add: delete_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
204 |
|
56327 | 205 |
lemma delete_update_same: "delete k (update k v al) = delete k al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
206 |
by (induct al) simp_all |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
207 |
|
56327 | 208 |
lemma delete_update: "k \<noteq> l \<Longrightarrow> delete l (update k v al) = update k v (delete l al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
209 |
by (induct al) simp_all |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
210 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
211 |
lemma delete_twist: "delete x (delete y al) = delete y (delete x al)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
212 |
by (simp add: delete_eq conj_commute) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
213 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
214 |
lemma length_delete_le: "length (delete k al) \<le> length al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
215 |
by (simp add: delete_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
216 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
217 |
|
61585 | 218 |
subsection \<open>\<open>update_with_aux\<close> and \<open>delete_aux\<close>\<close> |
60043
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
219 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
220 |
qualified primrec update_with_aux :: "'val \<Rightarrow> 'key \<Rightarrow> ('val \<Rightarrow> 'val) \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
221 |
where |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
222 |
"update_with_aux v k f [] = [(k, f v)]" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
223 |
| "update_with_aux v k f (p # ps) = (if (fst p = k) then (k, f (snd p)) # ps else p # update_with_aux v k f ps)" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
224 |
|
60500 | 225 |
text \<open> |
60043
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
226 |
The above @{term "delete"} traverses all the list even if it has found the key. |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
227 |
This one does not have to keep going because is assumes the invariant that keys are distinct. |
60500 | 228 |
\<close> |
60043
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
229 |
qualified fun delete_aux :: "'key \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
230 |
where |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
231 |
"delete_aux k [] = []" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
232 |
| "delete_aux k ((k', v) # xs) = (if k = k' then xs else (k', v) # delete_aux k xs)" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
233 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
234 |
lemma map_of_update_with_aux': |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
235 |
"map_of (update_with_aux v k f ps) k' = ((map_of ps)(k \<mapsto> (case map_of ps k of None \<Rightarrow> f v | Some v \<Rightarrow> f v))) k'" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
236 |
by(induct ps) auto |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
237 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
238 |
lemma map_of_update_with_aux: |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
239 |
"map_of (update_with_aux v k f ps) = (map_of ps)(k \<mapsto> (case map_of ps k of None \<Rightarrow> f v | Some v \<Rightarrow> f v))" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
240 |
by(simp add: fun_eq_iff map_of_update_with_aux') |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
241 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
242 |
lemma dom_update_with_aux: "fst ` set (update_with_aux v k f ps) = {k} \<union> fst ` set ps" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
243 |
by (induct ps) auto |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
244 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
245 |
lemma distinct_update_with_aux [simp]: |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
246 |
"distinct (map fst (update_with_aux v k f ps)) = distinct (map fst ps)" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
247 |
by(induct ps)(auto simp add: dom_update_with_aux) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
248 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
249 |
lemma set_update_with_aux: |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
250 |
"distinct (map fst xs) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
251 |
\<Longrightarrow> set (update_with_aux v k f xs) = (set xs - {k} \<times> UNIV \<union> {(k, f (case map_of xs k of None \<Rightarrow> v | Some v \<Rightarrow> v))})" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
252 |
by(induct xs)(auto intro: rev_image_eqI) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
253 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
254 |
lemma set_delete_aux: "distinct (map fst xs) \<Longrightarrow> set (delete_aux k xs) = set xs - {k} \<times> UNIV" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
255 |
apply(induct xs) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
256 |
apply simp_all |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
257 |
apply clarsimp |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
258 |
apply(fastforce intro: rev_image_eqI) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
259 |
done |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
260 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
261 |
lemma dom_delete_aux: "distinct (map fst ps) \<Longrightarrow> fst ` set (delete_aux k ps) = fst ` set ps - {k}" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
262 |
by(auto simp add: set_delete_aux) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
263 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
264 |
lemma distinct_delete_aux [simp]: |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
265 |
"distinct (map fst ps) \<Longrightarrow> distinct (map fst (delete_aux k ps))" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
266 |
proof(induct ps) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
267 |
case Nil thus ?case by simp |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
268 |
next |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
269 |
case (Cons a ps) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
270 |
obtain k' v where a: "a = (k', v)" by(cases a) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
271 |
show ?case |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
272 |
proof(cases "k' = k") |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
273 |
case True with Cons a show ?thesis by simp |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
274 |
next |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
275 |
case False |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
276 |
with Cons a have "k' \<notin> fst ` set ps" "distinct (map fst ps)" by simp_all |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
277 |
with False a have "k' \<notin> fst ` set (delete_aux k ps)" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
278 |
by(auto dest!: dom_delete_aux[where k=k]) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
279 |
with Cons a show ?thesis by simp |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
280 |
qed |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
281 |
qed |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
282 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
283 |
lemma map_of_delete_aux': |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
284 |
"distinct (map fst xs) \<Longrightarrow> map_of (delete_aux k xs) = (map_of xs)(k := None)" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
285 |
apply (induct xs) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
286 |
apply (fastforce simp add: map_of_eq_None_iff fun_upd_twist) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
287 |
apply (auto intro!: ext) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
288 |
apply (simp add: map_of_eq_None_iff) |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
289 |
done |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
290 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
291 |
lemma map_of_delete_aux: |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
292 |
"distinct (map fst xs) \<Longrightarrow> map_of (delete_aux k xs) k' = ((map_of xs)(k := None)) k'" |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
293 |
by(simp add: map_of_delete_aux') |
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
294 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
295 |
lemma delete_aux_eq_Nil_conv: "delete_aux k ts = [] \<longleftrightarrow> ts = [] \<or> (\<exists>v. ts = [(k, v)])" |
62390 | 296 |
by(cases ts)(auto split: if_split_asm) |
60043
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
297 |
|
177d740a0d48
moved _aux functions from AFP/Collections to AList
nipkow
parents:
59990
diff
changeset
|
298 |
|
61585 | 299 |
subsection \<open>\<open>restrict\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
300 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
301 |
qualified definition restrict :: "'key set \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 302 |
where restrict_eq: "restrict A = filter (\<lambda>(k, v). k \<in> A)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
303 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
304 |
lemma restr_simps [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
305 |
"restrict A [] = []" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
306 |
"restrict A (p#ps) = (if fst p \<in> A then p # restrict A ps else restrict A ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
307 |
by (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
308 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
309 |
lemma restr_conv': "map_of (restrict A al) = ((map_of al)|` A)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
310 |
proof |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
311 |
fix k |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
312 |
show "map_of (restrict A al) k = ((map_of al)|` A) k" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
313 |
by (induct al) (simp, cases "k \<in> A", auto) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
314 |
qed |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
315 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
316 |
corollary restr_conv: "map_of (restrict A al) k = ((map_of al)|` A) k" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
317 |
by (simp add: restr_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
318 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
319 |
lemma distinct_restr: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
320 |
"distinct (map fst al) \<Longrightarrow> distinct (map fst (restrict A al))" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
321 |
by (induct al) (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
322 |
|
56327 | 323 |
lemma restr_empty [simp]: |
324 |
"restrict {} al = []" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
325 |
"restrict A [] = []" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
326 |
by (induct al) (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
327 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
328 |
lemma restr_in [simp]: "x \<in> A \<Longrightarrow> map_of (restrict A al) x = map_of al x" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
329 |
by (simp add: restr_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
330 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
331 |
lemma restr_out [simp]: "x \<notin> A \<Longrightarrow> map_of (restrict A al) x = None" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
332 |
by (simp add: restr_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
333 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
334 |
lemma dom_restr [simp]: "fst ` set (restrict A al) = fst ` set al \<inter> A" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
335 |
by (induct al) (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
336 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
337 |
lemma restr_upd_same [simp]: "restrict (-{x}) (update x y al) = restrict (-{x}) al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
338 |
by (induct al) (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
339 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
340 |
lemma restr_restr [simp]: "restrict A (restrict B al) = restrict (A\<inter>B) al" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
341 |
by (induct al) (auto simp add: restrict_eq) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
342 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
343 |
lemma restr_update[simp]: |
56327 | 344 |
"map_of (restrict D (update x y al)) = |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
345 |
map_of ((if x \<in> D then (update x y (restrict (D-{x}) al)) else restrict D al))" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
346 |
by (simp add: restr_conv' update_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
347 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
348 |
lemma restr_delete [simp]: |
56327 | 349 |
"delete x (restrict D al) = (if x \<in> D then restrict (D - {x}) al else restrict D al)" |
350 |
apply (simp add: delete_eq restrict_eq) |
|
351 |
apply (auto simp add: split_def) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
352 |
proof - |
56327 | 353 |
have "\<And>y. y \<noteq> x \<longleftrightarrow> x \<noteq> y" |
354 |
by auto |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
355 |
then show "[p \<leftarrow> al. fst p \<in> D \<and> x \<noteq> fst p] = [p \<leftarrow> al. fst p \<in> D \<and> fst p \<noteq> x]" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
356 |
by simp |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
357 |
assume "x \<notin> D" |
56327 | 358 |
then have "\<And>y. y \<in> D \<longleftrightarrow> y \<in> D \<and> x \<noteq> y" |
359 |
by auto |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
360 |
then show "[p \<leftarrow> al . fst p \<in> D \<and> x \<noteq> fst p] = [p \<leftarrow> al . fst p \<in> D]" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
361 |
by simp |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
362 |
qed |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
363 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
364 |
lemma update_restr: |
56327 | 365 |
"map_of (update x y (restrict D al)) = map_of (update x y (restrict (D - {x}) al))" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
366 |
by (simp add: update_conv' restr_conv') (rule fun_upd_restrict) |
19234 | 367 |
|
45867 | 368 |
lemma update_restr_conv [simp]: |
56327 | 369 |
"x \<in> D \<Longrightarrow> |
370 |
map_of (update x y (restrict D al)) = map_of (update x y (restrict (D - {x}) al))" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
371 |
by (simp add: update_conv' restr_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
372 |
|
56327 | 373 |
lemma restr_updates [simp]: |
374 |
"length xs = length ys \<Longrightarrow> set xs \<subseteq> D \<Longrightarrow> |
|
375 |
map_of (restrict D (updates xs ys al)) = |
|
376 |
map_of (updates xs ys (restrict (D - set xs) al))" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
377 |
by (simp add: updates_conv' restr_conv') |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
378 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
379 |
lemma restr_delete_twist: "(restrict A (delete a ps)) = delete a (restrict A ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
380 |
by (induct ps) auto |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
381 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
382 |
|
61585 | 383 |
subsection \<open>\<open>clearjunk\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
384 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
385 |
qualified function clearjunk :: "('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 386 |
where |
387 |
"clearjunk [] = []" |
|
388 |
| "clearjunk (p#ps) = p # clearjunk (delete (fst p) ps)" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
389 |
by pat_completeness auto |
56327 | 390 |
termination |
391 |
by (relation "measure length") (simp_all add: less_Suc_eq_le length_delete_le) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
392 |
|
56327 | 393 |
lemma map_of_clearjunk: "map_of (clearjunk al) = map_of al" |
394 |
by (induct al rule: clearjunk.induct) (simp_all add: fun_eq_iff) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
395 |
|
56327 | 396 |
lemma clearjunk_keys_set: "set (map fst (clearjunk al)) = set (map fst al)" |
397 |
by (induct al rule: clearjunk.induct) (simp_all add: delete_keys) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
398 |
|
56327 | 399 |
lemma dom_clearjunk: "fst ` set (clearjunk al) = fst ` set al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
400 |
using clearjunk_keys_set by simp |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
401 |
|
56327 | 402 |
lemma distinct_clearjunk [simp]: "distinct (map fst (clearjunk al))" |
403 |
by (induct al rule: clearjunk.induct) (simp_all del: set_map add: clearjunk_keys_set delete_keys) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
404 |
|
56327 | 405 |
lemma ran_clearjunk: "ran (map_of (clearjunk al)) = ran (map_of al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
406 |
by (simp add: map_of_clearjunk) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
407 |
|
56327 | 408 |
lemma ran_map_of: "ran (map_of al) = snd ` set (clearjunk al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
409 |
proof - |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
410 |
have "ran (map_of al) = ran (map_of (clearjunk al))" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
411 |
by (simp add: ran_clearjunk) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
412 |
also have "\<dots> = snd ` set (clearjunk al)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
413 |
by (simp add: ran_distinct) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
414 |
finally show ?thesis . |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
415 |
qed |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
416 |
|
56327 | 417 |
lemma clearjunk_update: "clearjunk (update k v al) = update k v (clearjunk al)" |
418 |
by (induct al rule: clearjunk.induct) (simp_all add: delete_update) |
|
19234 | 419 |
|
56327 | 420 |
lemma clearjunk_updates: "clearjunk (updates ks vs al) = updates ks vs (clearjunk al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
421 |
proof - |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
422 |
have "clearjunk \<circ> fold (case_prod update) (zip ks vs) = |
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
423 |
fold (case_prod update) (zip ks vs) \<circ> clearjunk" |
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
424 |
by (rule fold_commute) (simp add: clearjunk_update case_prod_beta o_def) |
56327 | 425 |
then show ?thesis |
426 |
by (simp add: updates_def fun_eq_iff) |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
427 |
qed |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
428 |
|
56327 | 429 |
lemma clearjunk_delete: "clearjunk (delete x al) = delete x (clearjunk al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
430 |
by (induct al rule: clearjunk.induct) (auto simp add: delete_idem delete_twist) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
431 |
|
56327 | 432 |
lemma clearjunk_restrict: "clearjunk (restrict A al) = restrict A (clearjunk al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
433 |
by (induct al rule: clearjunk.induct) (auto simp add: restr_delete_twist) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
434 |
|
56327 | 435 |
lemma distinct_clearjunk_id [simp]: "distinct (map fst al) \<Longrightarrow> clearjunk al = al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
436 |
by (induct al rule: clearjunk.induct) auto |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
437 |
|
56327 | 438 |
lemma clearjunk_idem: "clearjunk (clearjunk al) = clearjunk al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
439 |
by simp |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
440 |
|
56327 | 441 |
lemma length_clearjunk: "length (clearjunk al) \<le> length al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
442 |
proof (induct al rule: clearjunk.induct [case_names Nil Cons]) |
56327 | 443 |
case Nil |
444 |
then show ?case by simp |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
445 |
next |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
446 |
case (Cons kv al) |
56327 | 447 |
moreover have "length (delete (fst kv) al) \<le> length al" |
448 |
by (fact length_delete_le) |
|
449 |
ultimately have "length (clearjunk (delete (fst kv) al)) \<le> length al" |
|
450 |
by (rule order_trans) |
|
451 |
then show ?case |
|
452 |
by simp |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
453 |
qed |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
454 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
455 |
lemma delete_map: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
456 |
assumes "\<And>kv. fst (f kv) = fst kv" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
457 |
shows "delete k (map f ps) = map f (delete k ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
458 |
by (simp add: delete_eq filter_map comp_def split_def assms) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
459 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
460 |
lemma clearjunk_map: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
461 |
assumes "\<And>kv. fst (f kv) = fst kv" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
462 |
shows "clearjunk (map f ps) = map f (clearjunk ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
463 |
by (induct ps rule: clearjunk.induct [case_names Nil Cons]) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
464 |
(simp_all add: clearjunk_delete delete_map assms) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
465 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
466 |
|
61585 | 467 |
subsection \<open>\<open>map_ran\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
468 |
|
56327 | 469 |
definition map_ran :: "('key \<Rightarrow> 'val \<Rightarrow> 'val) \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
470 |
where "map_ran f = map (\<lambda>(k, v). (k, f k v))" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
471 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
472 |
lemma map_ran_simps [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
473 |
"map_ran f [] = []" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
474 |
"map_ran f ((k, v) # ps) = (k, f k v) # map_ran f ps" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
475 |
by (simp_all add: map_ran_def) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
476 |
|
56327 | 477 |
lemma dom_map_ran: "fst ` set (map_ran f al) = fst ` set al" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
478 |
by (simp add: map_ran_def image_image split_def) |
56327 | 479 |
|
480 |
lemma map_ran_conv: "map_of (map_ran f al) k = map_option (f k) (map_of al k)" |
|
19234 | 481 |
by (induct al) auto |
482 |
||
56327 | 483 |
lemma distinct_map_ran: "distinct (map fst al) \<Longrightarrow> distinct (map fst (map_ran f al))" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
484 |
by (simp add: map_ran_def split_def comp_def) |
19234 | 485 |
|
56327 | 486 |
lemma map_ran_filter: "map_ran f [p\<leftarrow>ps. fst p \<noteq> a] = [p\<leftarrow>map_ran f ps. fst p \<noteq> a]" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
487 |
by (simp add: map_ran_def filter_map split_def comp_def) |
19234 | 488 |
|
56327 | 489 |
lemma clearjunk_map_ran: "clearjunk (map_ran f al) = map_ran f (clearjunk al)" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
490 |
by (simp add: map_ran_def split_def clearjunk_map) |
19234 | 491 |
|
23373 | 492 |
|
61585 | 493 |
subsection \<open>\<open>merge\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
494 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
495 |
qualified definition merge :: "('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
56327 | 496 |
where "merge qs ps = foldr (\<lambda>(k, v). update k v) ps qs" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
497 |
|
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
498 |
lemma merge_simps [simp]: |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
499 |
"merge qs [] = qs" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
500 |
"merge qs (p#ps) = update (fst p) (snd p) (merge qs ps)" |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
501 |
by (simp_all add: merge_def split_def) |
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
502 |
|
56327 | 503 |
lemma merge_updates: "merge qs ps = updates (rev (map fst ps)) (rev (map snd ps)) qs" |
47397
d654c73e4b12
no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents:
46507
diff
changeset
|
504 |
by (simp add: merge_def updates_def foldr_conv_fold zip_rev zip_map_fst_snd) |
19234 | 505 |
|
506 |
lemma dom_merge: "fst ` set (merge xs ys) = fst ` set xs \<union> fst ` set ys" |
|
20503 | 507 |
by (induct ys arbitrary: xs) (auto simp add: dom_update) |
19234 | 508 |
|
509 |
lemma distinct_merge: |
|
510 |
assumes "distinct (map fst xs)" |
|
511 |
shows "distinct (map fst (merge xs ys))" |
|
56327 | 512 |
using assms by (simp add: merge_updates distinct_updates) |
19234 | 513 |
|
56327 | 514 |
lemma clearjunk_merge: "clearjunk (merge xs ys) = merge (clearjunk xs) ys" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
515 |
by (simp add: merge_updates clearjunk_updates) |
19234 | 516 |
|
56327 | 517 |
lemma merge_conv': "map_of (merge xs ys) = map_of xs ++ map_of ys" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
518 |
proof - |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
519 |
have "map_of \<circ> fold (case_prod update) (rev ys) = |
56327 | 520 |
fold (\<lambda>(k, v) m. m(k \<mapsto> v)) (rev ys) \<circ> map_of" |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
47397
diff
changeset
|
521 |
by (rule fold_commute) (simp add: update_conv' case_prod_beta split_def fun_eq_iff) |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
522 |
then show ?thesis |
47397
d654c73e4b12
no preference wrt. fold(l/r); prefer fold rather than foldr for iterating over lists in generated code
haftmann
parents:
46507
diff
changeset
|
523 |
by (simp add: merge_def map_add_map_of_foldr foldr_conv_fold fun_eq_iff) |
19234 | 524 |
qed |
525 |
||
56327 | 526 |
corollary merge_conv: "map_of (merge xs ys) k = (map_of xs ++ map_of ys) k" |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
527 |
by (simp add: merge_conv') |
19234 | 528 |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
529 |
lemma merge_empty: "map_of (merge [] ys) = map_of ys" |
19234 | 530 |
by (simp add: merge_conv') |
531 |
||
56327 | 532 |
lemma merge_assoc [simp]: "map_of (merge m1 (merge m2 m3)) = map_of (merge (merge m1 m2) m3)" |
19234 | 533 |
by (simp add: merge_conv') |
534 |
||
56327 | 535 |
lemma merge_Some_iff: |
536 |
"map_of (merge m n) k = Some x \<longleftrightarrow> |
|
537 |
map_of n k = Some x \<or> map_of n k = None \<and> map_of m k = Some x" |
|
19234 | 538 |
by (simp add: merge_conv' map_add_Some_iff) |
539 |
||
45605 | 540 |
lemmas merge_SomeD [dest!] = merge_Some_iff [THEN iffD1] |
19234 | 541 |
|
56327 | 542 |
lemma merge_find_right [simp]: "map_of n k = Some v \<Longrightarrow> map_of (merge m n) k = Some v" |
19234 | 543 |
by (simp add: merge_conv') |
544 |
||
56327 | 545 |
lemma merge_None [iff]: |
19234 | 546 |
"(map_of (merge m n) k = None) = (map_of n k = None \<and> map_of m k = None)" |
547 |
by (simp add: merge_conv') |
|
548 |
||
56327 | 549 |
lemma merge_upd [simp]: |
19234 | 550 |
"map_of (merge m (update k v n)) = map_of (update k v (merge m n))" |
551 |
by (simp add: update_conv' merge_conv') |
|
552 |
||
56327 | 553 |
lemma merge_updatess [simp]: |
19234 | 554 |
"map_of (merge m (updates xs ys n)) = map_of (updates xs ys (merge m n))" |
555 |
by (simp add: updates_conv' merge_conv') |
|
556 |
||
56327 | 557 |
lemma merge_append: "map_of (xs @ ys) = map_of (merge ys xs)" |
19234 | 558 |
by (simp add: merge_conv') |
559 |
||
23373 | 560 |
|
61585 | 561 |
subsection \<open>\<open>compose\<close>\<close> |
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
562 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
563 |
qualified function compose :: "('key \<times> 'a) list \<Rightarrow> ('a \<times> 'b) list \<Rightarrow> ('key \<times> 'b) list" |
56327 | 564 |
where |
565 |
"compose [] ys = []" |
|
566 |
| "compose (x # xs) ys = |
|
567 |
(case map_of ys (snd x) of |
|
568 |
None \<Rightarrow> compose (delete (fst x) xs) ys |
|
569 |
| Some v \<Rightarrow> (fst x, v) # compose xs ys)" |
|
34975
f099b0b20646
more correspondence lemmas between related operations; tuned some proofs
haftmann
parents:
32960
diff
changeset
|
570 |
by pat_completeness auto |
56327 | 571 |
termination |
572 |
by (relation "measure (length \<circ> fst)") (simp_all add: less_Suc_eq_le length_delete_le) |
|
19234 | 573 |
|
56327 | 574 |
lemma compose_first_None [simp]: |
575 |
assumes "map_of xs k = None" |
|
19234 | 576 |
shows "map_of (compose xs ys) k = None" |
62390 | 577 |
using assms by (induct xs ys rule: compose.induct) (auto split: option.splits if_split_asm) |
19234 | 578 |
|
56327 | 579 |
lemma compose_conv: "map_of (compose xs ys) k = (map_of ys \<circ>\<^sub>m map_of xs) k" |
22916 | 580 |
proof (induct xs ys rule: compose.induct) |
56327 | 581 |
case 1 |
582 |
then show ?case by simp |
|
19234 | 583 |
next |
56327 | 584 |
case (2 x xs ys) |
585 |
show ?case |
|
19234 | 586 |
proof (cases "map_of ys (snd x)") |
56327 | 587 |
case None |
588 |
with 2 have hyp: "map_of (compose (delete (fst x) xs) ys) k = |
|
589 |
(map_of ys \<circ>\<^sub>m map_of (delete (fst x) xs)) k" |
|
19234 | 590 |
by simp |
591 |
show ?thesis |
|
592 |
proof (cases "fst x = k") |
|
593 |
case True |
|
594 |
from True delete_notin_dom [of k xs] |
|
595 |
have "map_of (delete (fst x) xs) k = None" |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
596 |
by (simp add: map_of_eq_None_iff) |
19234 | 597 |
with hyp show ?thesis |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
598 |
using True None |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
599 |
by simp |
19234 | 600 |
next |
601 |
case False |
|
602 |
from False have "map_of (delete (fst x) xs) k = map_of xs k" |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
603 |
by simp |
19234 | 604 |
with hyp show ?thesis |
56327 | 605 |
using False None by (simp add: map_comp_def) |
19234 | 606 |
qed |
607 |
next |
|
608 |
case (Some v) |
|
22916 | 609 |
with 2 |
19234 | 610 |
have "map_of (compose xs ys) k = (map_of ys \<circ>\<^sub>m map_of xs) k" |
611 |
by simp |
|
612 |
with Some show ?thesis |
|
613 |
by (auto simp add: map_comp_def) |
|
614 |
qed |
|
615 |
qed |
|
56327 | 616 |
|
617 |
lemma compose_conv': "map_of (compose xs ys) = (map_of ys \<circ>\<^sub>m map_of xs)" |
|
19234 | 618 |
by (rule ext) (rule compose_conv) |
619 |
||
620 |
lemma compose_first_Some [simp]: |
|
56327 | 621 |
assumes "map_of xs k = Some v" |
19234 | 622 |
shows "map_of (compose xs ys) k = map_of ys v" |
56327 | 623 |
using assms by (simp add: compose_conv) |
19234 | 624 |
|
625 |
lemma dom_compose: "fst ` set (compose xs ys) \<subseteq> fst ` set xs" |
|
22916 | 626 |
proof (induct xs ys rule: compose.induct) |
56327 | 627 |
case 1 |
628 |
then show ?case by simp |
|
19234 | 629 |
next |
22916 | 630 |
case (2 x xs ys) |
19234 | 631 |
show ?case |
632 |
proof (cases "map_of ys (snd x)") |
|
633 |
case None |
|
22916 | 634 |
with "2.hyps" |
19234 | 635 |
have "fst ` set (compose (delete (fst x) xs) ys) \<subseteq> fst ` set (delete (fst x) xs)" |
636 |
by simp |
|
637 |
also |
|
638 |
have "\<dots> \<subseteq> fst ` set xs" |
|
639 |
by (rule dom_delete_subset) |
|
640 |
finally show ?thesis |
|
641 |
using None |
|
642 |
by auto |
|
643 |
next |
|
644 |
case (Some v) |
|
22916 | 645 |
with "2.hyps" |
19234 | 646 |
have "fst ` set (compose xs ys) \<subseteq> fst ` set xs" |
647 |
by simp |
|
648 |
with Some show ?thesis |
|
649 |
by auto |
|
650 |
qed |
|
651 |
qed |
|
652 |
||
653 |
lemma distinct_compose: |
|
56327 | 654 |
assumes "distinct (map fst xs)" |
655 |
shows "distinct (map fst (compose xs ys))" |
|
656 |
using assms |
|
22916 | 657 |
proof (induct xs ys rule: compose.induct) |
56327 | 658 |
case 1 |
659 |
then show ?case by simp |
|
19234 | 660 |
next |
22916 | 661 |
case (2 x xs ys) |
19234 | 662 |
show ?case |
663 |
proof (cases "map_of ys (snd x)") |
|
664 |
case None |
|
22916 | 665 |
with 2 show ?thesis by simp |
19234 | 666 |
next |
667 |
case (Some v) |
|
56327 | 668 |
with 2 dom_compose [of xs ys] show ?thesis |
669 |
by auto |
|
19234 | 670 |
qed |
671 |
qed |
|
672 |
||
56327 | 673 |
lemma compose_delete_twist: "compose (delete k xs) ys = delete k (compose xs ys)" |
22916 | 674 |
proof (induct xs ys rule: compose.induct) |
56327 | 675 |
case 1 |
676 |
then show ?case by simp |
|
19234 | 677 |
next |
22916 | 678 |
case (2 x xs ys) |
19234 | 679 |
show ?case |
680 |
proof (cases "map_of ys (snd x)") |
|
681 |
case None |
|
56327 | 682 |
with 2 have hyp: "compose (delete k (delete (fst x) xs)) ys = |
683 |
delete k (compose (delete (fst x) xs) ys)" |
|
19234 | 684 |
by simp |
685 |
show ?thesis |
|
686 |
proof (cases "fst x = k") |
|
687 |
case True |
|
56327 | 688 |
with None hyp show ?thesis |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
689 |
by (simp add: delete_idem) |
19234 | 690 |
next |
691 |
case False |
|
56327 | 692 |
from None False hyp show ?thesis |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
30663
diff
changeset
|
693 |
by (simp add: delete_twist) |
19234 | 694 |
qed |
695 |
next |
|
696 |
case (Some v) |
|
56327 | 697 |
with 2 have hyp: "compose (delete k xs) ys = delete k (compose xs ys)" |
698 |
by simp |
|
19234 | 699 |
with Some show ?thesis |
700 |
by simp |
|
701 |
qed |
|
702 |
qed |
|
703 |
||
704 |
lemma compose_clearjunk: "compose xs (clearjunk ys) = compose xs ys" |
|
56327 | 705 |
by (induct xs ys rule: compose.induct) |
706 |
(auto simp add: map_of_clearjunk split: option.splits) |
|
707 |
||
19234 | 708 |
lemma clearjunk_compose: "clearjunk (compose xs ys) = compose (clearjunk xs) ys" |
709 |
by (induct xs rule: clearjunk.induct) |
|
56327 | 710 |
(auto split: option.splits simp add: clearjunk_delete delete_idem compose_delete_twist) |
711 |
||
712 |
lemma compose_empty [simp]: "compose xs [] = []" |
|
22916 | 713 |
by (induct xs) (auto simp add: compose_delete_twist) |
19234 | 714 |
|
715 |
lemma compose_Some_iff: |
|
56327 | 716 |
"(map_of (compose xs ys) k = Some v) \<longleftrightarrow> |
717 |
(\<exists>k'. map_of xs k = Some k' \<and> map_of ys k' = Some v)" |
|
19234 | 718 |
by (simp add: compose_conv map_comp_Some_iff) |
719 |
||
720 |
lemma map_comp_None_iff: |
|
56327 | 721 |
"map_of (compose xs ys) k = None \<longleftrightarrow> |
722 |
(map_of xs k = None \<or> (\<exists>k'. map_of xs k = Some k' \<and> map_of ys k' = None))" |
|
19234 | 723 |
by (simp add: compose_conv map_comp_None_iff) |
724 |
||
56327 | 725 |
|
61585 | 726 |
subsection \<open>\<open>map_entry\<close>\<close> |
45869 | 727 |
|
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59943
diff
changeset
|
728 |
qualified fun map_entry :: "'key \<Rightarrow> ('val \<Rightarrow> 'val) \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
45869 | 729 |
where |
730 |
"map_entry k f [] = []" |
|
56327 | 731 |
| "map_entry k f (p # ps) = |
732 |
(if fst p = k then (k, f (snd p)) # ps else p # map_entry k f ps)" |
|
45869 | 733 |
|
734 |
lemma map_of_map_entry: |
|
56327 | 735 |
"map_of (map_entry k f xs) = |
736 |
(map_of xs)(k := case map_of xs k of None \<Rightarrow> None | Some v' \<Rightarrow> Some (f v'))" |
|
737 |
by (induct xs) auto |
|
45869 | 738 |
|
56327 | 739 |
lemma dom_map_entry: "fst ` set (map_entry k f xs) = fst ` set xs" |
740 |
by (induct xs) auto |
|
45869 | 741 |
|
742 |
lemma distinct_map_entry: |
|
743 |
assumes "distinct (map fst xs)" |
|
744 |
shows "distinct (map fst (map_entry k f xs))" |
|
56327 | 745 |
using assms by (induct xs) (auto simp add: dom_map_entry) |
746 |
||
45869 | 747 |
|
61585 | 748 |
subsection \<open>\<open>map_default\<close>\<close> |
45868 | 749 |
|
750 |
fun map_default :: "'key \<Rightarrow> 'val \<Rightarrow> ('val \<Rightarrow> 'val) \<Rightarrow> ('key \<times> 'val) list \<Rightarrow> ('key \<times> 'val) list" |
|
751 |
where |
|
752 |
"map_default k v f [] = [(k, v)]" |
|
56327 | 753 |
| "map_default k v f (p # ps) = |
754 |
(if fst p = k then (k, f (snd p)) # ps else p # map_default k v f ps)" |
|
45868 | 755 |
|
756 |
lemma map_of_map_default: |
|
56327 | 757 |
"map_of (map_default k v f xs) = |
758 |
(map_of xs)(k := case map_of xs k of None \<Rightarrow> Some v | Some v' \<Rightarrow> Some (f v'))" |
|
759 |
by (induct xs) auto |
|
45868 | 760 |
|
56327 | 761 |
lemma dom_map_default: "fst ` set (map_default k v f xs) = insert k (fst ` set xs)" |
762 |
by (induct xs) auto |
|
45868 | 763 |
|
764 |
lemma distinct_map_default: |
|
765 |
assumes "distinct (map fst xs)" |
|
766 |
shows "distinct (map fst (map_default k v f xs))" |
|
56327 | 767 |
using assms by (induct xs) (auto simp add: dom_map_default) |
45868 | 768 |
|
59943
e83ecf0a0ee1
more qualified names -- eliminated hide_const (open);
wenzelm
parents:
58881
diff
changeset
|
769 |
end |
45884 | 770 |
|
19234 | 771 |
end |