1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: Fset.v,v 1.5.2.1 2004/07/16 19:31:04 herbelin Exp $ i*)
(*s Sets operations on maps *)
Require Import Bool.
Require Import Sumbool.
Require Import ZArith.
Require Import Addr.
Require Import Adist.
Require Import Addec.
Require Import Map.
Section Dom.
Variables A B : Set.
Fixpoint MapDomRestrTo (m:Map A) : Map B -> Map A :=
match m with
| M0 => fun _:Map B => M0 A
| M1 a y =>
fun m':Map B => match MapGet B m' a with
| NONE => M0 A
| _ => m
end
| M2 m1 m2 =>
fun m':Map B =>
match m' with
| M0 => M0 A
| M1 a' y' =>
match MapGet A m a' with
| NONE => M0 A
| SOME y => M1 A a' y
end
| M2 m'1 m'2 =>
makeM2 A (MapDomRestrTo m1 m'1) (MapDomRestrTo m2 m'2)
end
end.
Lemma MapDomRestrTo_semantics :
forall (m:Map A) (m':Map B),
eqm A (MapGet A (MapDomRestrTo m m'))
(fun a0:ad =>
match MapGet B m' a0 with
| NONE => NONE A
| _ => MapGet A m a0
end).
Proof.
unfold eqm in |- *. simple induction m. simpl in |- *. intros. case (MapGet B m' a); trivial.
intros. simpl in |- *. elim (sumbool_of_bool (ad_eq a a1)). intro H. rewrite H.
rewrite <- (ad_eq_complete _ _ H). case (MapGet B m' a). reflexivity.
intro. apply M1_semantics_1.
intro H. rewrite H. case (MapGet B m' a).
case (MapGet B m' a1); reflexivity.
case (MapGet B m' a1); intros; exact (M1_semantics_2 A a a1 a0 H).
simple induction m'. trivial.
unfold MapDomRestrTo in |- *. intros. elim (sumbool_of_bool (ad_eq a a1)).
intro H1.
rewrite (ad_eq_complete _ _ H1). rewrite (M1_semantics_1 B a1 a0).
case (MapGet A (M2 A m0 m1) a1). reflexivity.
intro. apply M1_semantics_1.
intro H1. rewrite (M1_semantics_2 B a a1 a0 H1). case (MapGet A (M2 A m0 m1) a). reflexivity.
intro. exact (M1_semantics_2 A a a1 a2 H1).
intros. change
(MapGet A (makeM2 A (MapDomRestrTo m0 m2) (MapDomRestrTo m1 m3)) a =
match MapGet B (M2 B m2 m3) a with
| NONE => NONE A
| SOME _ => MapGet A (M2 A m0 m1) a
end) in |- *.
rewrite (makeM2_M2 A (MapDomRestrTo m0 m2) (MapDomRestrTo m1 m3) a).
rewrite MapGet_M2_bit_0_if. rewrite (H0 m3 (ad_div_2 a)). rewrite (H m2 (ad_div_2 a)).
rewrite (MapGet_M2_bit_0_if B m2 m3 a). rewrite (MapGet_M2_bit_0_if A m0 m1 a).
case (ad_bit_0 a); reflexivity.
Qed.
Fixpoint MapDomRestrBy (m:Map A) : Map B -> Map A :=
match m with
| M0 => fun _:Map B => M0 A
| M1 a y =>
fun m':Map B => match MapGet B m' a with
| NONE => m
| _ => M0 A
end
| M2 m1 m2 =>
fun m':Map B =>
match m' with
| M0 => m
| M1 a' y' => MapRemove A m a'
| M2 m'1 m'2 =>
makeM2 A (MapDomRestrBy m1 m'1) (MapDomRestrBy m2 m'2)
end
end.
Lemma MapDomRestrBy_semantics :
forall (m:Map A) (m':Map B),
eqm A (MapGet A (MapDomRestrBy m m'))
(fun a0:ad =>
match MapGet B m' a0 with
| NONE => MapGet A m a0
| _ => NONE A
end).
Proof.
unfold eqm in |- *. simple induction m. simpl in |- *. intros. case (MapGet B m' a); trivial.
intros. simpl in |- *. elim (sumbool_of_bool (ad_eq a a1)). intro H. rewrite H.
rewrite (ad_eq_complete _ _ H). case (MapGet B m' a1). apply M1_semantics_1.
trivial.
intro H. rewrite H. case (MapGet B m' a). rewrite (M1_semantics_2 A a a1 a0 H).
case (MapGet B m' a1); trivial.
case (MapGet B m' a1); trivial.
simple induction m'. trivial.
unfold MapDomRestrBy in |- *. intros. rewrite (MapRemove_semantics A (M2 A m0 m1) a a1).
elim (sumbool_of_bool (ad_eq a a1)). intro H1. rewrite H1. rewrite (ad_eq_complete _ _ H1).
rewrite (M1_semantics_1 B a1 a0). reflexivity.
intro H1. rewrite H1. rewrite (M1_semantics_2 B a a1 a0 H1). reflexivity.
intros. change
(MapGet A (makeM2 A (MapDomRestrBy m0 m2) (MapDomRestrBy m1 m3)) a =
match MapGet B (M2 B m2 m3) a with
| NONE => MapGet A (M2 A m0 m1) a
| SOME _ => NONE A
end) in |- *.
rewrite (makeM2_M2 A (MapDomRestrBy m0 m2) (MapDomRestrBy m1 m3) a).
rewrite MapGet_M2_bit_0_if. rewrite (H0 m3 (ad_div_2 a)). rewrite (H m2 (ad_div_2 a)).
rewrite (MapGet_M2_bit_0_if B m2 m3 a). rewrite (MapGet_M2_bit_0_if A m0 m1 a).
case (ad_bit_0 a); reflexivity.
Qed.
Definition in_dom (a:ad) (m:Map A) :=
match MapGet A m a with
| NONE => false
| _ => true
end.
Lemma in_dom_M0 : forall a:ad, in_dom a (M0 A) = false.
Proof.
trivial.
Qed.
Lemma in_dom_M1 : forall (a a0:ad) (y:A), in_dom a0 (M1 A a y) = ad_eq a a0.
Proof.
unfold in_dom in |- *. intros. simpl in |- *. case (ad_eq a a0); reflexivity.
Qed.
Lemma in_dom_M1_1 : forall (a:ad) (y:A), in_dom a (M1 A a y) = true.
Proof.
intros. rewrite in_dom_M1. apply ad_eq_correct.
Qed.
Lemma in_dom_M1_2 :
forall (a a0:ad) (y:A), in_dom a0 (M1 A a y) = true -> a = a0.
Proof.
intros. apply (ad_eq_complete a a0). rewrite (in_dom_M1 a a0 y) in H. assumption.
Qed.
Lemma in_dom_some :
forall (m:Map A) (a:ad),
in_dom a m = true -> {y : A | MapGet A m a = SOME A y}.
Proof.
unfold in_dom in |- *. intros. elim (option_sum _ (MapGet A m a)). trivial.
intro H0. rewrite H0 in H. discriminate H.
Qed.
Lemma in_dom_none :
forall (m:Map A) (a:ad), in_dom a m = false -> MapGet A m a = NONE A.
Proof.
unfold in_dom in |- *. intros. elim (option_sum _ (MapGet A m a)). intro H0. elim H0.
intros y H1. rewrite H1 in H. discriminate H.
trivial.
Qed.
Lemma in_dom_put :
forall (m:Map A) (a0:ad) (y0:A) (a:ad),
in_dom a (MapPut A m a0 y0) = orb (ad_eq a a0) (in_dom a m).
Proof.
unfold in_dom in |- *. intros. rewrite (MapPut_semantics A m a0 y0 a).
elim (sumbool_of_bool (ad_eq a a0)). intro H. rewrite H. rewrite (ad_eq_comm a a0) in H.
rewrite H. rewrite orb_true_b. reflexivity.
intro H. rewrite H. rewrite (ad_eq_comm a a0) in H. rewrite H. rewrite orb_false_b.
reflexivity.
Qed.
Lemma in_dom_put_behind :
forall (m:Map A) (a0:ad) (y0:A) (a:ad),
in_dom a (MapPut_behind A m a0 y0) = orb (ad_eq a a0) (in_dom a m).
Proof.
unfold in_dom in |- *. intros. rewrite (MapPut_behind_semantics A m a0 y0 a).
elim (sumbool_of_bool (ad_eq a a0)). intro H. rewrite H. rewrite (ad_eq_comm a a0) in H.
rewrite H. case (MapGet A m a); reflexivity.
intro H. rewrite H. rewrite (ad_eq_comm a a0) in H. rewrite H. case (MapGet A m a); trivial.
Qed.
Lemma in_dom_remove :
forall (m:Map A) (a0 a:ad),
in_dom a (MapRemove A m a0) = andb (negb (ad_eq a a0)) (in_dom a m).
Proof.
unfold in_dom in |- *. intros. rewrite (MapRemove_semantics A m a0 a).
elim (sumbool_of_bool (ad_eq a a0)). intro H. rewrite H. rewrite (ad_eq_comm a a0) in H.
rewrite H. reflexivity.
intro H. rewrite H. rewrite (ad_eq_comm a a0) in H. rewrite H.
case (MapGet A m a); reflexivity.
Qed.
Lemma in_dom_merge :
forall (m m':Map A) (a:ad),
in_dom a (MapMerge A m m') = orb (in_dom a m) (in_dom a m').
Proof.
unfold in_dom in |- *. intros. rewrite (MapMerge_semantics A m m' a).
elim (option_sum A (MapGet A m' a)). intro H. elim H. intros y H0. rewrite H0.
case (MapGet A m a); reflexivity.
intro H. rewrite H. rewrite orb_b_false. reflexivity.
Qed.
Lemma in_dom_delta :
forall (m m':Map A) (a:ad),
in_dom a (MapDelta A m m') = xorb (in_dom a m) (in_dom a m').
Proof.
unfold in_dom in |- *. intros. rewrite (MapDelta_semantics A m m' a).
elim (option_sum A (MapGet A m' a)). intro H. elim H. intros y H0. rewrite H0.
case (MapGet A m a); reflexivity.
intro H. rewrite H. case (MapGet A m a); reflexivity.
Qed.
End Dom.
Section InDom.
Variables A B : Set.
Lemma in_dom_restrto :
forall (m:Map A) (m':Map B) (a:ad),
in_dom A a (MapDomRestrTo A B m m') =
andb (in_dom A a m) (in_dom B a m').
Proof.
unfold in_dom in |- *. intros. rewrite (MapDomRestrTo_semantics A B m m' a).
elim (option_sum B (MapGet B m' a)). intro H. elim H. intros y H0. rewrite H0.
rewrite andb_b_true. reflexivity.
intro H. rewrite H. rewrite andb_b_false. reflexivity.
Qed.
Lemma in_dom_restrby :
forall (m:Map A) (m':Map B) (a:ad),
in_dom A a (MapDomRestrBy A B m m') =
andb (in_dom A a m) (negb (in_dom B a m')).
Proof.
unfold in_dom in |- *. intros. rewrite (MapDomRestrBy_semantics A B m m' a).
elim (option_sum B (MapGet B m' a)). intro H. elim H. intros y H0. rewrite H0.
unfold negb in |- *. rewrite andb_b_false. reflexivity.
intro H. rewrite H. unfold negb in |- *. rewrite andb_b_true. reflexivity.
Qed.
End InDom.
Definition FSet := Map unit.
Section FSetDefs.
Variable A : Set.
Definition in_FSet : ad -> FSet -> bool := in_dom unit.
Fixpoint MapDom (m:Map A) : FSet :=
match m with
| M0 => M0 unit
| M1 a _ => M1 unit a tt
| M2 m m' => M2 unit (MapDom m) (MapDom m')
end.
Lemma MapDom_semantics_1 :
forall (m:Map A) (a:ad) (y:A),
MapGet A m a = SOME A y -> in_FSet a (MapDom m) = true.
Proof.
simple induction m. intros. discriminate H.
unfold MapDom in |- *. unfold in_FSet in |- *. unfold in_dom in |- *. unfold MapGet in |- *. intros a y a0 y0.
case (ad_eq a a0). trivial.
intro. discriminate H.
intros m0 H m1 H0 a y. rewrite (MapGet_M2_bit_0_if A m0 m1 a). simpl in |- *. unfold in_FSet in |- *.
unfold in_dom in |- *. rewrite (MapGet_M2_bit_0_if unit (MapDom m0) (MapDom m1) a).
case (ad_bit_0 a). unfold in_FSet, in_dom in H0. intro. apply H0 with (y := y). assumption.
unfold in_FSet, in_dom in H. intro. apply H with (y := y). assumption.
Qed.
Lemma MapDom_semantics_2 :
forall (m:Map A) (a:ad),
in_FSet a (MapDom m) = true -> {y : A | MapGet A m a = SOME A y}.
Proof.
simple induction m. intros. discriminate H.
unfold MapDom in |- *. unfold in_FSet in |- *. unfold in_dom in |- *. unfold MapGet in |- *. intros a y a0. case (ad_eq a a0).
intro. split with y. reflexivity.
intro. discriminate H.
intros m0 H m1 H0 a. rewrite (MapGet_M2_bit_0_if A m0 m1 a). simpl in |- *. unfold in_FSet in |- *.
unfold in_dom in |- *. rewrite (MapGet_M2_bit_0_if unit (MapDom m0) (MapDom m1) a).
case (ad_bit_0 a). unfold in_FSet, in_dom in H0. intro. apply H0. assumption.
unfold in_FSet, in_dom in H. intro. apply H. assumption.
Qed.
Lemma MapDom_semantics_3 :
forall (m:Map A) (a:ad),
MapGet A m a = NONE A -> in_FSet a (MapDom m) = false.
Proof.
intros. elim (sumbool_of_bool (in_FSet a (MapDom m))). intro H0.
elim (MapDom_semantics_2 m a H0). intros y H1. rewrite H in H1. discriminate H1.
trivial.
Qed.
Lemma MapDom_semantics_4 :
forall (m:Map A) (a:ad),
in_FSet a (MapDom m) = false -> MapGet A m a = NONE A.
Proof.
intros. elim (option_sum A (MapGet A m a)). intro H0. elim H0. intros y H1.
rewrite (MapDom_semantics_1 m a y H1) in H. discriminate H.
trivial.
Qed.
Lemma MapDom_Dom :
forall (m:Map A) (a:ad), in_dom A a m = in_FSet a (MapDom m).
Proof.
intros. elim (sumbool_of_bool (in_FSet a (MapDom m))). intro H.
elim (MapDom_semantics_2 m a H). intros y H0. rewrite H. unfold in_dom in |- *. rewrite H0.
reflexivity.
intro H. rewrite H. unfold in_dom in |- *. rewrite (MapDom_semantics_4 m a H). reflexivity.
Qed.
Definition FSetUnion (s s':FSet) : FSet := MapMerge unit s s'.
Lemma in_FSet_union :
forall (s s':FSet) (a:ad),
in_FSet a (FSetUnion s s') = orb (in_FSet a s) (in_FSet a s').
Proof.
exact (in_dom_merge unit).
Qed.
Definition FSetInter (s s':FSet) : FSet := MapDomRestrTo unit unit s s'.
Lemma in_FSet_inter :
forall (s s':FSet) (a:ad),
in_FSet a (FSetInter s s') = andb (in_FSet a s) (in_FSet a s').
Proof.
exact (in_dom_restrto unit unit).
Qed.
Definition FSetDiff (s s':FSet) : FSet := MapDomRestrBy unit unit s s'.
Lemma in_FSet_diff :
forall (s s':FSet) (a:ad),
in_FSet a (FSetDiff s s') = andb (in_FSet a s) (negb (in_FSet a s')).
Proof.
exact (in_dom_restrby unit unit).
Qed.
Definition FSetDelta (s s':FSet) : FSet := MapDelta unit s s'.
Lemma in_FSet_delta :
forall (s s':FSet) (a:ad),
in_FSet a (FSetDelta s s') = xorb (in_FSet a s) (in_FSet a s').
Proof.
exact (in_dom_delta unit).
Qed.
End FSetDefs.
Lemma FSet_Dom : forall s:FSet, MapDom unit s = s.
Proof.
simple induction s. trivial.
simpl in |- *. intros a t. elim t. reflexivity.
intros. simpl in |- *. rewrite H. rewrite H0. reflexivity.
Qed.
|
