You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
47 lines
1.5 KiB
47 lines
1.5 KiB
9 months ago
|
From stdpp Require Import countable numbers gmap.
|
||
|
|
||
|
Record loc := Loc { loc_car : Z }.
|
||
|
|
||
|
Add Printing Constructor loc.
|
||
|
|
||
|
Global Instance loc_eq_decision : EqDecision loc.
|
||
|
Proof. solve_decision. Defined.
|
||
|
|
||
|
Global Instance loc_inhabited : Inhabited loc := populate {|loc_car := 0 |}.
|
||
|
|
||
|
Global Instance loc_countable : Countable loc.
|
||
|
Proof. by apply (inj_countable' loc_car Loc); intros []. Defined.
|
||
|
|
||
|
Global Program Instance loc_infinite : Infinite loc :=
|
||
|
inj_infinite (λ p, {| loc_car := p |}) (λ l, Some (loc_car l)) _.
|
||
|
Next Obligation. done. Qed.
|
||
|
|
||
|
Definition loc_add (l : loc) (off : Z) : loc :=
|
||
|
{| loc_car := loc_car l + off|}.
|
||
|
|
||
|
Notation "l +ₗ off" :=
|
||
|
(loc_add l off) (at level 50, left associativity) : stdpp_scope.
|
||
|
|
||
|
Lemma loc_add_assoc l i j : l +ₗ i +ₗ j = l +ₗ (i + j).
|
||
|
Proof. destruct l; unfold loc_add; simpl; f_equal; lia. Qed.
|
||
|
|
||
|
Lemma loc_add_0 l : l +ₗ 0 = l.
|
||
|
Proof. destruct l; unfold loc_add; simpl; f_equal; lia. Qed.
|
||
|
|
||
|
Global Instance loc_add_inj l : Inj eq eq (loc_add l).
|
||
|
Proof. destruct l; unfold Inj, loc_add; simpl; intros; simplify_eq; lia. Qed.
|
||
|
|
||
|
Definition fresh_locs (ls : gset loc) : loc :=
|
||
|
{| loc_car := set_fold (λ k r, (1 + loc_car k) `max` r)%Z 1%Z ls |}.
|
||
|
|
||
|
Lemma fresh_locs_fresh ls i :
|
||
|
(0 ≤ i)%Z → fresh_locs ls +ₗ i ∉ ls.
|
||
|
Proof.
|
||
|
intros Hi. cut (∀ l, l ∈ ls → loc_car l < loc_car (fresh_locs ls) + i)%Z.
|
||
|
{ intros help Hf%help. simpl in *. lia. }
|
||
|
apply (set_fold_ind_L (λ r ls, ∀ l, l ∈ ls → (loc_car l < r + i)%Z));
|
||
|
set_solver by eauto with lia.
|
||
|
Qed.
|
||
|
|
||
|
Global Opaque fresh_locs.
|