own.v 10.6 KB
Newer Older
1
From iris.algebra Require Import functions gmap proofmode_classes.
Robbert Krebbers's avatar
Robbert Krebbers committed
2
From iris.base_logic.lib Require Export iprop.
3
Set Default Proof Using "Type".
4 5
Import uPred.

6 7
(** The class [inG Σ A] expresses that the CMRA [A] is in the list of functors
[Σ]. This class is similar to the [subG] class, but written down in terms of
8
individual CMRAs instead of (lists of) CMRA *functors*. This additional class is
9 10 11
needed because Coq is otherwise unable to solve type class constraints due to
higher-order unification problems. *)
Class inG (Σ : gFunctors) (A : cmraT) :=
12
  InG { inG_id : gid Σ; inG_prf : A = Σ inG_id (iPreProp Σ) _ }.
13 14
Arguments inG_id {_ _} _.

15
Lemma subG_inG Σ (F : gFunctor) : subG F Σ  inG Σ (F (iPreProp Σ) _).
16 17
Proof. move=> /(_ 0%fin) /= [j ->]. by exists j. Qed.

18 19 20 21
(** This tactic solves the usual obligations "subG ? Σ → {in,?}G ? Σ" *)
Ltac solve_inG :=
  (* Get all assumptions *)
  intros;
22
  (* Unfold the top-level xΣ. We need to support this to be a function. *)
23
  lazymatch goal with
24 25 26
  | H : subG (?xΣ _ _ _ _) _ |- _ => try unfold xΣ in H
  | H : subG (?xΣ _ _ _) _ |- _ => try unfold xΣ in H
  | H : subG (?xΣ _ _) _ |- _ => try unfold xΣ in H
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47
  | H : subG (?xΣ _) _ |- _ => try unfold xΣ in H
  | H : subG ?xΣ _ |- _ => try unfold xΣ in H
  end;
  (* Take apart subG for non-"atomic" lists *)
  repeat match goal with
         | H : subG (gFunctors.app _ _) _ |- _ => apply subG_inv in H; destruct H
         end;
  (* Try to turn singleton subG into inG; but also keep the subG for typeclass
     resolution -- to keep them, we put them onto the goal. *)
  repeat match goal with
         | H : subG _ _ |- _ => move:(H); (apply subG_inG in H || clear H)
         end;
  (* Again get all assumptions *)
  intros;
  (* We support two kinds of goals: Things convertible to inG;
     and records with inG and typeclass fields. Try to solve the
     first case. *)
  try done;
  (* That didn't work, now we're in for the second case. *)
  split; (assumption || by apply _).

48
(** * Definition of the connective [own] *)
49
Definition iRes_singleton {Σ A} {i : inG Σ A} (γ : gname) (a : A) : iResUR Σ :=
50
  discrete_fun_singleton (inG_id i) {[ γ := cmra_transport inG_prf a ]}.
51
Instance: Params (@iRes_singleton) 4 := {}.
52

53
Definition own_def `{!inG Σ A} (γ : gname) (a : A) : iProp Σ :=
54
  uPred_ownM (iRes_singleton γ a).
55
Definition own_aux : seal (@own_def). by eexists. Qed.
56 57
Definition own {Σ A i} := own_aux.(unseal) Σ A i.
Definition own_eq : @own = @own_def := own_aux.(seal_eq).
58
Instance: Params (@own) 4 := {}.
59
Typeclasses Opaque own.
60

61
(** * Properties about ghost ownership *)
62
Section global.
63
Context `{Hin: !inG Σ A}.
64 65
Implicit Types a : A.

66 67 68
(** ** Properties of [iRes_singleton] *)
Global Instance iRes_singleton_ne γ :
  NonExpansive (@iRes_singleton Σ A _ γ).
69
Proof. by intros n a a' Ha; apply discrete_fun_singleton_ne; rewrite Ha. Qed.
70 71 72
Lemma iRes_singleton_op γ a1 a2 :
  iRes_singleton γ (a1  a2)  iRes_singleton γ a1  iRes_singleton γ a2.
Proof.
73
  by rewrite /iRes_singleton discrete_fun_op_singleton op_singleton cmra_transport_op.
74 75
Qed.

76
(** ** Properties of [own] *)
77
Global Instance own_ne γ : NonExpansive (@own Σ A _ γ).
78
Proof. rewrite !own_eq. solve_proper. Qed.
79
Global Instance own_proper γ :
80
  Proper (() ==> ()) (@own Σ A _ γ) := ne_proper _.
Robbert Krebbers's avatar
Robbert Krebbers committed
81

82
Lemma own_op γ a1 a2 : own γ (a1  a2)  own γ a1  own γ a2.
83
Proof. by rewrite !own_eq /own_def -ownM_op iRes_singleton_op. Qed.
Robbert Krebbers's avatar
Robbert Krebbers committed
84
Lemma own_mono γ a1 a2 : a2  a1  own γ a1  own γ a2.
Robbert Krebbers's avatar
Robbert Krebbers committed
85
Proof. move=> [c ->]. by rewrite own_op sep_elim_l. Qed.
Robbert Krebbers's avatar
Robbert Krebbers committed
86 87 88

Global Instance own_mono' γ : Proper (flip () ==> ()) (@own Σ A _ γ).
Proof. intros a1 a2. apply own_mono. Qed.
89

90
Lemma own_valid γ a : own γ a   a.
91 92
Proof.
  rewrite !own_eq /own_def ownM_valid /iRes_singleton.
93
  rewrite discrete_fun_validI (forall_elim (inG_id _)) discrete_fun_lookup_singleton.
94 95 96 97
  rewrite gmap_validI (forall_elim γ) lookup_singleton option_validI.
  (* implicit arguments differ a bit *)
  by trans ( cmra_transport inG_prf a : iProp Σ)%I; last destruct inG_prf.
Qed.
98
Lemma own_valid_2 γ a1 a2 : own γ a1 - own γ a2 -  (a1  a2).
99
Proof. apply wand_intro_r. by rewrite -own_op own_valid. Qed.
100
Lemma own_valid_3 γ a1 a2 a3 : own γ a1 - own γ a2 - own γ a3 -  (a1  a2  a3).
101
Proof. do 2 apply wand_intro_r. by rewrite -!own_op own_valid. Qed.
102
Lemma own_valid_r γ a : own γ a  own γ a   a.
Robbert Krebbers's avatar
Robbert Krebbers committed
103
Proof. apply: bi.persistent_entails_r. apply own_valid. Qed.
104
Lemma own_valid_l γ a : own γ a   a  own γ a.
105
Proof. by rewrite comm -own_valid_r. Qed.
106

107
Global Instance own_timeless γ a : Discrete a  Timeless (own γ a).
108
Proof. rewrite !own_eq /own_def; apply _. Qed.
109
Global Instance own_core_persistent γ a : CoreId a  Persistent (own γ a).
110
Proof. rewrite !own_eq /own_def; apply _. Qed.
111

112 113 114
Lemma later_own γ a :  own γ a -  ( b, own γ b   (a  b)).
Proof.
  rewrite own_eq /own_def later_ownM. apply exist_elim=> r.
115
  assert (NonExpansive (λ r : iResUR Σ, r (inG_id Hin) !! γ)).
116
  { intros n r1 r2 Hr. f_equiv. by specialize (Hr (inG_id _)). }
117
  rewrite (f_equiv (λ r : iResUR Σ, r (inG_id Hin) !! γ) _ r).
118
  rewrite {1}/iRes_singleton discrete_fun_lookup_singleton lookup_singleton.
119 120 121 122 123 124 125 126
  rewrite option_equivI. case Hb: (r (inG_id _) !! γ)=> [b|]; last first.
  { by rewrite and_elim_r /sbi_except_0 -or_intro_l. }
  rewrite -except_0_intro -(exist_intro (cmra_transport (eq_sym inG_prf) b)).
  apply and_mono.
  - rewrite /iRes_singleton. assert ( {A A' : cmraT} (Heq : A' = A) (a : A),
      cmra_transport Heq (cmra_transport (eq_sym Heq) a) = a) as ->
      by (by intros ?? ->).
    apply ownM_mono=> /=.
127 128
    exists (discrete_fun_insert (inG_id _) (delete γ (r (inG_id Hin))) r).
    intros i'. rewrite discrete_fun_lookup_op.
129
    destruct (decide (i' = inG_id _)) as [->|?].
130
    + rewrite discrete_fun_lookup_insert discrete_fun_lookup_singleton.
131 132 133
      intros γ'. rewrite lookup_op. destruct (decide (γ' = γ)) as [->|?].
      * by rewrite lookup_singleton lookup_delete Hb.
      * by rewrite lookup_singleton_ne // lookup_delete_ne // left_id.
134 135
    + rewrite discrete_fun_lookup_insert_ne //.
      by rewrite discrete_fun_lookup_singleton_ne // left_id.
136 137 138 139 140 141
  - apply later_mono.
    by assert ( {A A' : cmraT} (Heq : A' = A) (a' : A') (a : A),
      cmra_transport Heq a'  a @{iPropI Σ}
        a'  cmra_transport (eq_sym Heq) a) as -> by (by intros ?? ->).
Qed.

142
(** ** Allocation *)
Robbert Krebbers's avatar
Robbert Krebbers committed
143 144
(* TODO: This also holds if we just have ✓ a at the current step-idx, as Iris
   assertion. However, the map_updateP_alloc does not suffice to show this. *)
Dan Frumin's avatar
Dan Frumin committed
145 146 147
Lemma own_alloc_strong a (P : gname  Prop) :
  pred_infinite P 
   a  (|==>  γ, P γ⌝  own γ a)%I.
148
Proof.
Dan Frumin's avatar
Dan Frumin committed
149 150
  intros HP Ha.
  rewrite -(bupd_mono ( m,  γ, P γ  m = iRes_singleton γ a  uPred_ownM m)%I).
151
  - rewrite /uPred_valid /bi_emp_valid (ownM_unit emp).
152
    eapply bupd_ownM_updateP, (discrete_fun_singleton_updateP_empty (inG_id _));
153 154
      first (eapply alloc_updateP_strong', cmra_transport_valid, Ha);
      naive_solver.
155
  - apply exist_elim=>m; apply pure_elim_l=>-[γ [Hfresh ->]].
156
    by rewrite !own_eq /own_def -(exist_intro γ) pure_True // left_id.
157
Qed.
Dan Frumin's avatar
Dan Frumin committed
158 159 160 161 162 163 164 165 166
Lemma own_alloc_cofinite a (G : gset gname) :
   a  (|==>  γ, ⌜γ  G  own γ a)%I.
Proof.
  intros Ha.
  apply (own_alloc_strong a (λ γ, γ  G))=> //.
  apply (pred_infinite_set (C:=gset gname)).
  intros E. set (i := fresh (G  E)).
  exists i. apply not_elem_of_union, is_fresh.
Qed.
167
Lemma own_alloc a :  a  (|==>  γ, own γ a)%I.
168
Proof.
Dan Frumin's avatar
Dan Frumin committed
169
  intros Ha. rewrite /uPred_valid /bi_emp_valid (own_alloc_cofinite a ) //; [].
Ralf Jung's avatar
Ralf Jung committed
170
  apply bupd_mono, exist_mono=>?. eauto using and_elim_r.
171
Qed.
172

173
(** ** Frame preserving updates *)
Ralf Jung's avatar
Ralf Jung committed
174
Lemma own_updateP P γ a : a ~~>: P  own γ a ==  a', P a'  own γ a'.
175
Proof.
176
  intros Ha. rewrite !own_eq.
177
  rewrite -(bupd_mono ( m,  a', m = iRes_singleton γ a'  P a'  uPred_ownM m)%I).
178
  - eapply bupd_ownM_updateP, discrete_fun_singleton_updateP;
179
      first by (eapply singleton_updateP', cmra_transport_updateP', Ha).
Robbert Krebbers's avatar
Robbert Krebbers committed
180
    naive_solver.
181 182
  - apply exist_elim=>m; apply pure_elim_l=>-[a' [-> HP]].
    rewrite -(exist_intro a'). by apply and_intro; [apply pure_intro|].
183 184
Qed.

185
Lemma own_update γ a a' : a ~~> a'  own γ a == own γ a'.
186
Proof.
187
  intros; rewrite (own_updateP (a' =)); last by apply cmra_update_updateP.
188
  by apply bupd_mono, exist_elim=> a''; apply pure_elim_l=> ->.
189
Qed.
190
Lemma own_update_2 γ a1 a2 a' :
191
  a1  a2 ~~> a'  own γ a1 - own γ a2 == own γ a'.
192
Proof. intros. apply wand_intro_r. rewrite -own_op. by apply own_update. Qed.
193
Lemma own_update_3 γ a1 a2 a3 a' :
194
  a1  a2  a3 ~~> a'  own γ a1 - own γ a2 - own γ a3 == own γ a'.
195
Proof. intros. do 2 apply wand_intro_r. rewrite -!own_op. by apply own_update. Qed.
196
End global.
197

198
Arguments own_valid {_ _} [_] _ _.
199 200
Arguments own_valid_2 {_ _} [_] _ _ _.
Arguments own_valid_3 {_ _} [_] _ _ _ _.
201 202 203 204
Arguments own_valid_l {_ _} [_] _ _.
Arguments own_valid_r {_ _} [_] _ _.
Arguments own_updateP {_ _} [_] _ _ _ _.
Arguments own_update {_ _} [_] _ _ _ _.
205 206
Arguments own_update_2 {_ _} [_] _ _ _ _ _.
Arguments own_update_3 {_ _} [_] _ _ _ _ _ _.
207

208
Lemma own_unit A `{!inG Σ (A:ucmraT)} γ : (|==> own γ ε)%I.
209
Proof.
210
  rewrite /uPred_valid /bi_emp_valid (ownM_unit emp) !own_eq /own_def.
211
  apply bupd_ownM_update, discrete_fun_singleton_update_empty.
Robbert Krebbers's avatar
Robbert Krebbers committed
212
  apply (alloc_unit_singleton_update (cmra_transport inG_prf ε)); last done.
213 214
  - apply cmra_transport_valid, ucmra_unit_valid.
  - intros x; destruct inG_prf. by rewrite left_id.
215
Qed.
216

217
(** Big op class instances *)
218
Instance own_cmra_sep_homomorphism `{!inG Σ (A:ucmraT)} :
219 220
  WeakMonoidHomomorphism op uPred_sep () (own γ).
Proof. split; try apply _. apply own_op. Qed.
221

222 223
(** Proofmode class instances *)
Section proofmode_classes.
224
  Context `{!inG Σ A}.
225 226
  Implicit Types a b : A.

227 228
  Global Instance into_sep_own γ a b1 b2 :
    IsOp a b1 b2  IntoSep (own γ a) (own γ b1) (own γ b2).
Robbert Krebbers's avatar
Robbert Krebbers committed
229
  Proof. intros. by rewrite /IntoSep (is_op a) own_op. Qed.
230
  Global Instance into_and_own p γ a b1 b2 :
231
    IsOp a b1 b2  IntoAnd p (own γ a) (own γ b1) (own γ b2).
Robbert Krebbers's avatar
Robbert Krebbers committed
232 233 234 235 236
  Proof. intros. by rewrite /IntoAnd (is_op a) own_op sep_and. Qed.

  Global Instance from_sep_own γ a b1 b2 :
    IsOp a b1 b2  FromSep (own γ a) (own γ b1) (own γ b2).
  Proof. intros. by rewrite /FromSep -own_op -is_op. Qed.
237
  Global Instance from_and_own_persistent γ a b1 b2 :
Robbert Krebbers's avatar
Robbert Krebbers committed
238 239
    IsOp a b1 b2  TCOr (CoreId b1) (CoreId b2) 
    FromAnd (own γ a) (own γ b1) (own γ b2).
240
  Proof.
Robbert Krebbers's avatar
Robbert Krebbers committed
241
    intros ? Hb. rewrite /FromAnd (is_op a) own_op.
242
    destruct Hb; by rewrite persistent_and_sep.
243
  Qed.
244
End proofmode_classes.