cofe_solver.v 10.3 KB
Newer Older
1
From algebra Require Export cofe.
Robbert Krebbers's avatar
Robbert Krebbers committed
2

3 4 5 6 7 8 9 10 11 12 13
Record solution (F : cofeT  cofeT  cofeT) := Solution {
  solution_car :> cofeT;
  solution_unfold : solution_car -n> F solution_car solution_car;
  solution_fold : F solution_car solution_car -n> solution_car;
  solution_fold_unfold X : solution_fold (solution_unfold X)  X;
  solution_unfold_fold X : solution_unfold (solution_fold X)  X
}.
Arguments solution_unfold {_} _.
Arguments solution_fold {_} _.

Module solver. Section solver.
Robbert Krebbers's avatar
Robbert Krebbers committed
14
Context (F : cofeT  cofeT  cofeT).
15
Context `{Finhab : Inhabited (F unitC unitC)}.
Robbert Krebbers's avatar
Robbert Krebbers committed
16 17 18 19 20 21 22 23 24 25 26
Context (map :  {A1 A2 B1 B2 : cofeT},
  ((A2 -n> A1) * (B1 -n> B2))  (F A1 B1 -n> F A2 B2)).
Arguments map {_ _ _ _} _.
Instance: Params (@map) 4.
Context (map_id :  {A B : cofeT} (x : F A B), map (cid, cid) x  x).
Context (map_comp :  {A1 A2 A3 B1 B2 B3 : cofeT}
    (f : A2 -n> A1) (g : A3 -n> A2) (f' : B1 -n> B2) (g' : B2 -n> B3) x,
  map (f  g, g'  f') x  map (g,g') (map (f,f') x)).
Context (map_contractive :  {A1 A2 B1 B2}, Contractive (@map A1 A2 B1 B2)).

Fixpoint A (k : nat) : cofeT :=
27
  match k with 0 => unitC | S k => F (A k) (A k) end.
28 29 30 31 32 33 34 35 36 37 38
Fixpoint f (k : nat) : A k -n> A (S k) :=
  match k with 0 => CofeMor (λ _, inhabitant) | S k => map (g k,f k) end
with g (k : nat) : A (S k) -n> A k :=
  match k with 0 => CofeMor (λ _, ()) | S k => map (f k,g k) end.
Definition f_S k (x : A (S k)) : f (S k) x = map (g k,f k) x := eq_refl.
Definition g_S k (x : A (S (S k))) : g (S k) x = map (f k,g k) x := eq_refl.
Arguments A : simpl never.
Arguments f : simpl never.
Arguments g : simpl never.

Lemma gf {k} (x : A k) : g k (f k x)  x.
Robbert Krebbers's avatar
Robbert Krebbers committed
39 40
Proof.
  induction k as [|k IH]; simpl in *; [by destruct x|].
41
  rewrite -map_comp -{2}(map_id _ _ x). by apply (contractive_proper map).
Robbert Krebbers's avatar
Robbert Krebbers committed
42
Qed.
43
Lemma fg {k} (x : A (S (S k))) : f (S k) (g (S k) x) {k} x.
Robbert Krebbers's avatar
Robbert Krebbers committed
44
Proof.
45
  induction k as [|k IH]; simpl.
46 47
  - rewrite f_S g_S -{2}(map_id _ _ x) -map_comp. apply (contractive_0 map).
  - rewrite f_S g_S -{2}(map_id _ _ x) -map_comp. by apply (contractive_S map).
Robbert Krebbers's avatar
Robbert Krebbers committed
48 49 50 51
Qed.

Record tower := {
  tower_car k :> A k;
52
  g_tower k : g k (tower_car (S k))  tower_car k
Robbert Krebbers's avatar
Robbert Krebbers committed
53 54
}.
Instance tower_equiv : Equiv tower := λ X Y,  k, X k  Y k.
55
Instance tower_dist : Dist tower := λ n X Y,  k, X k {n} Y k.
Robbert Krebbers's avatar
Robbert Krebbers committed
56 57 58 59 60 61
Program Definition tower_chain (c : chain tower) (k : nat) : chain (A k) :=
  {| chain_car i := c i k |}.
Next Obligation. intros c k n i ?; apply (chain_cauchy c n); lia. Qed.
Program Instance tower_compl : Compl tower := λ c,
  {| tower_car n := compl (tower_chain c n) |}.
Next Obligation.
62
  intros c k; apply equiv_dist=> n.
Robbert Krebbers's avatar
Robbert Krebbers committed
63 64
  by rewrite (conv_compl n (tower_chain c k))
    (conv_compl n (tower_chain c (S k))) /= (g_tower (c (S n)) k).
Robbert Krebbers's avatar
Robbert Krebbers committed
65
Qed.
66
Definition tower_cofe_mixin : CofeMixin tower.
Robbert Krebbers's avatar
Robbert Krebbers committed
67 68
Proof.
  split.
69
  - intros X Y; split; [by intros HXY n k; apply equiv_dist|].
Robbert Krebbers's avatar
Robbert Krebbers committed
70
    intros HXY k; apply equiv_dist; intros n; apply HXY.
71
  - intros k; split.
Robbert Krebbers's avatar
Robbert Krebbers committed
72 73 74
    + by intros X n.
    + by intros X Y ? n.
    + by intros X Y Z ?? n; transitivity (Y n).
75
  - intros k X Y HXY n; apply dist_S.
Robbert Krebbers's avatar
Robbert Krebbers committed
76
    by rewrite -(g_tower X) (HXY (S n)) g_tower.
Robbert Krebbers's avatar
Robbert Krebbers committed
77
  - intros n c k; rewrite /= (conv_compl n (tower_chain c k)).
Robbert Krebbers's avatar
Robbert Krebbers committed
78 79
    apply (chain_cauchy c); lia.
Qed.
80
Definition T : cofeT := CofeT tower_cofe_mixin.
Robbert Krebbers's avatar
Robbert Krebbers committed
81 82

Fixpoint ff {k} (i : nat) : A k -n> A (i + k) :=
83
  match i with 0 => cid | S i => f (i + k)  ff i end.
Robbert Krebbers's avatar
Robbert Krebbers committed
84
Fixpoint gg {k} (i : nat) : A (i + k) -n> A k :=
85
  match i with 0 => cid | S i => gg i  g (i + k) end.
Robbert Krebbers's avatar
Robbert Krebbers committed
86
Lemma ggff {k i} (x : A k) : gg i (ff i x)  x.
Robbert Krebbers's avatar
Robbert Krebbers committed
87
Proof. induction i as [|i IH]; simpl; [done|by rewrite (gf (ff i x)) IH]. Qed.
88 89 90
Lemma f_tower k (X : tower) : f (S k) (X (S k)) {k} X (S (S k)).
Proof. intros. by rewrite -(fg (X (S (S k)))) -(g_tower X). Qed.
Lemma ff_tower k i (X : tower) : ff i (X (S k)) {k} X (i + S k).
Robbert Krebbers's avatar
Robbert Krebbers committed
91 92
Proof.
  intros; induction i as [|i IH]; simpl; [done|].
93
  by rewrite IH Nat.add_succ_r (dist_le _ _ _ _ (f_tower _ X)); last omega.
Robbert Krebbers's avatar
Robbert Krebbers committed
94 95
Qed.
Lemma gg_tower k i (X : tower) : gg i (X (i + k))  X k.
Robbert Krebbers's avatar
Robbert Krebbers committed
96
Proof. by induction i as [|i IH]; simpl; [done|rewrite g_tower IH]. Qed.
Robbert Krebbers's avatar
Robbert Krebbers committed
97 98 99 100 101 102 103 104 105 106 107 108 109

Instance tower_car_ne n k : Proper (dist n ==> dist n) (λ X, tower_car X k).
Proof. by intros X Y HX. Qed.
Definition project (k : nat) : T -n> A k := CofeMor (λ X : T, tower_car X k).

Definition coerce {i j} (H : i = j) : A i -n> A j :=
  eq_rect _ (λ i', A i -n> A i') cid _ H.
Lemma coerce_id {i} (H : i = i) (x : A i) : coerce H x = x.
Proof. unfold coerce. by rewrite (proof_irrel H (eq_refl i)). Qed.
Lemma coerce_proper {i j} (x y : A i) (H1 H2 : i = j) :
  x = y  coerce H1 x = coerce H2 y.
Proof. by destruct H1; rewrite !coerce_id. Qed.
Lemma g_coerce {k j} (H : S k = S j) (x : A (S k)) :
110
  g j (coerce H x) = coerce (Nat.succ_inj _ _ H) (g k x).
Robbert Krebbers's avatar
Robbert Krebbers committed
111 112
Proof. by assert (k = j) by lia; subst; rewrite !coerce_id. Qed.
Lemma coerce_f {k j} (H : S k = S j) (x : A k) :
113
  coerce H (f k x) = f j (coerce (Nat.succ_inj _ _ H) x).
Robbert Krebbers's avatar
Robbert Krebbers committed
114 115 116 117
Proof. by assert (k = j) by lia; subst; rewrite !coerce_id. Qed.
Lemma gg_gg {k i i1 i2 j} (H1 : k = i + j) (H2 : k = i2 + (i1 + j)) (x : A k) :
  gg i (coerce H1 x) = gg i1 (gg i2 (coerce H2 x)).
Proof.
118 119
  assert (i = i2 + i1) by lia; simplify_eq/=. revert j x H1.
  induction i2 as [|i2 IH]; intros j X H1; simplify_eq/=;
Robbert Krebbers's avatar
Robbert Krebbers committed
120
    [by rewrite coerce_id|by rewrite g_coerce IH].
Robbert Krebbers's avatar
Robbert Krebbers committed
121 122 123 124
Qed.
Lemma ff_ff {k i i1 i2 j} (H1 : i + k = j) (H2 : i1 + (i2 + k) = j) (x : A k) :
  coerce H1 (ff i x) = coerce H2 (ff i1 (ff i2 x)).
Proof.
125 126
  assert (i = i1 + i2) by lia; simplify_eq/=.
  induction i1 as [|i1 IH]; simplify_eq/=;
Robbert Krebbers's avatar
Robbert Krebbers committed
127
    [by rewrite coerce_id|by rewrite coerce_f IH].
Robbert Krebbers's avatar
Robbert Krebbers committed
128 129
Qed.

130
Definition embed_coerce {k} (i : nat) : A k -n> A i :=
Robbert Krebbers's avatar
Robbert Krebbers committed
131 132 133 134
  match le_lt_dec i k with
  | left H => gg (k-i)  coerce (eq_sym (Nat.sub_add _ _ H))
  | right H => coerce (Nat.sub_add k i (Nat.lt_le_incl _ _ H))  ff (i-k)
  end.
135 136
Lemma g_embed_coerce {k i} (x : A k) :
  g i (embed_coerce (S i) x)  embed_coerce i x.
Robbert Krebbers's avatar
Robbert Krebbers committed
137
Proof.
138
  unfold embed_coerce; destruct (le_lt_dec (S i) k), (le_lt_dec i k); simpl.
139 140 141
  - symmetry; by erewrite (@gg_gg _ _ 1 (k - S i)); simpl.
  - exfalso; lia.
  - assert (i = k) by lia; subst.
Robbert Krebbers's avatar
Robbert Krebbers committed
142
    rewrite (ff_ff _ (eq_refl (1 + (0 + k)))) /= gf.
Robbert Krebbers's avatar
Robbert Krebbers committed
143
    by rewrite (gg_gg _ (eq_refl (0 + (0 + k)))).
144
  - assert (H : 1 + ((i - k) + k) = S i) by lia.
Robbert Krebbers's avatar
Robbert Krebbers committed
145
    rewrite (ff_ff _ H) /= -{2}(gf (ff (i - k) x)) g_coerce.
Robbert Krebbers's avatar
Robbert Krebbers committed
146 147
    by erewrite coerce_proper by done.
Qed.
148 149 150 151 152
Program Definition embed (k : nat) (x : A k) : T :=
  {| tower_car n := embed_coerce n x |}.
Next Obligation. intros k x i. apply g_embed_coerce. Qed.
Instance: Params (@embed) 1.
Instance embed_ne k n : Proper (dist n ==> dist n) (embed k).
153
Proof. by intros x y Hxy i; rewrite /= Hxy. Qed.
154 155
Definition embed' (k : nat) : A k -n> T := CofeMor (embed k).
Lemma embed_f k (x : A k) : embed (S k) (f k x)  embed k x.
Robbert Krebbers's avatar
Robbert Krebbers committed
156
Proof.
157
  rewrite equiv_dist=> n i; rewrite /embed /= /embed_coerce.
Robbert Krebbers's avatar
Robbert Krebbers committed
158
  destruct (le_lt_dec i (S k)), (le_lt_dec i k); simpl.
159
  - assert (H : S k = S (k - i) + (0 + i)) by lia; rewrite (gg_gg _ H) /=.
Robbert Krebbers's avatar
Robbert Krebbers committed
160
    by erewrite g_coerce, gf, coerce_proper by done.
161
  - assert (S k = 0 + (0 + i)) as H by lia.
162
    rewrite (gg_gg _ H); simplify_eq/=.
Robbert Krebbers's avatar
Robbert Krebbers committed
163
    by rewrite (ff_ff _ (eq_refl (1 + (0 + k)))).
164 165
  - exfalso; lia.
  - assert (H : (i - S k) + (1 + k) = i) by lia; rewrite (ff_ff _ H) /=.
Robbert Krebbers's avatar
Robbert Krebbers committed
166 167
    by erewrite coerce_proper by done.
Qed.
168
Lemma embed_tower k (X : T) : embed (S k) (X (S k)) {k} X.
Robbert Krebbers's avatar
Robbert Krebbers committed
169
Proof.
170 171
  intros i; rewrite /= /embed_coerce.
  destruct (le_lt_dec i (S k)) as [H|H]; simpl.
172
  - rewrite -(gg_tower i (S k - i) X).
Robbert Krebbers's avatar
Robbert Krebbers committed
173
    apply (_ : Proper (_ ==> _) (gg _)); by destruct (eq_sym _).
174
  - rewrite (ff_tower k (i - S k) X). by destruct (Nat.sub_add _ _ _).
Robbert Krebbers's avatar
Robbert Krebbers committed
175 176 177
Qed.

Program Definition unfold_chain (X : T) : chain (F T T) :=
178
  {| chain_car n := map (project n,embed' n) (X (S n)) |}.
Robbert Krebbers's avatar
Robbert Krebbers committed
179 180 181
Next Obligation.
  intros X n i Hi.
  assert ( k, i = k + n) as [k ?] by (exists (i - n); lia); subst; clear Hi.
182 183
  induction k as [|k IH]; simpl.
  { rewrite -f_tower f_S -map_comp.
184
    by apply (contractive_ne map); split=> Y /=; rewrite ?g_tower ?embed_f. }
185 186
  rewrite -IH -(dist_le _ _ _ _ (f_tower (k + n) _)); last lia.
  rewrite f_S -map_comp.
187
  by apply (contractive_ne map); split=> Y /=; rewrite ?g_tower ?embed_f.
Robbert Krebbers's avatar
Robbert Krebbers committed
188
Qed.
189 190
Definition unfold (X : T) : F T T := compl (unfold_chain X).
Instance unfold_ne : Proper (dist n ==> dist n) unfold.
191
Proof.
Robbert Krebbers's avatar
Robbert Krebbers committed
192 193
  intros n X Y HXY. by rewrite /unfold (conv_compl n (unfold_chain X))
    (conv_compl n (unfold_chain Y)) /= (HXY (S (S n))).
194
Qed.
Robbert Krebbers's avatar
Robbert Krebbers committed
195

196
Program Definition fold (X : F T T) : T :=
197
  {| tower_car n := g n (map (embed' n,project n) X) |}.
Robbert Krebbers's avatar
Robbert Krebbers committed
198
Next Obligation.
199 200
  intros X k. apply (_ : Proper (() ==> ()) (g k)).
  rewrite g_S -map_comp.
201
  apply (contractive_proper map); split=> Y; [apply embed_f|apply g_tower].
Robbert Krebbers's avatar
Robbert Krebbers committed
202
Qed.
203 204
Instance fold_ne : Proper (dist n ==> dist n) fold.
Proof. by intros n X Y HXY k; rewrite /fold /= HXY. Qed.
Robbert Krebbers's avatar
Robbert Krebbers committed
205

206
Theorem result : solution F.
Robbert Krebbers's avatar
Robbert Krebbers committed
207
Proof.
208
  apply (Solution F T (CofeMor unfold) (CofeMor fold)).
209
  - move=> X /=.
210
    rewrite equiv_dist; intros n k; unfold unfold, fold; simpl.
211
    rewrite -g_tower -(gg_tower _ n); apply (_ : Proper (_ ==> _) (g _)).
212
    transitivity (map (ff n, gg n) (X (S (n + k)))).
Robbert Krebbers's avatar
Robbert Krebbers committed
213
    { rewrite /unfold (conv_compl n (unfold_chain X)).
214 215
      rewrite -(chain_cauchy (unfold_chain X) n (S (n + k))) /=; last lia.
      rewrite -(dist_le _ _ _ _ (f_tower (n + k) _)); last lia.
216
      rewrite f_S -!map_comp; apply (contractive_ne map); split=> Y.
217 218 219 220 221 222 223 224 225 226 227 228 229
      + rewrite /embed' /= /embed_coerce.
        destruct (le_lt_dec _ _); simpl; [exfalso; lia|].
        by rewrite (ff_ff _ (eq_refl (S n + (0 + k)))) /= gf.
      + rewrite /embed' /= /embed_coerce.
        destruct (le_lt_dec _ _); simpl; [|exfalso; lia].
        by rewrite (gg_gg _ (eq_refl (0 + (S n + k)))) /= gf. }
    assert ( i k (x : A (S i + k)) (H : S i + k = i + S k),
      map (ff i, gg i) x  gg i (coerce H x)) as map_ff_gg.
    { intros i; induction i as [|i IH]; intros k' x H; simpl.
      { by rewrite coerce_id map_id. }
      rewrite map_comp g_coerce; apply IH. }
    assert (H: S n + k = n + S k) by lia.
    rewrite (map_ff_gg _ _ _ H).
230
    apply (_ : Proper (_ ==> _) (gg _)); by destruct H.
231
  - intros X; rewrite equiv_dist=> n /=.
Robbert Krebbers's avatar
Robbert Krebbers committed
232
    rewrite /unfold /= (conv_compl n (unfold_chain (fold X))) /=.
233 234
    rewrite g_S -!map_comp -{2}(map_id _ _ X).
    apply (contractive_ne map); split => Y /=.
235 236 237
    + apply dist_le with n; last omega.
      rewrite f_tower. apply dist_S. by rewrite embed_tower.
    + etransitivity; [apply embed_ne, equiv_dist, g_tower|apply embed_tower].
Robbert Krebbers's avatar
Robbert Krebbers committed
238
Qed.
239
End solver. End solver.