iprop.v 6.32 KB
Newer Older
1
From iris.base_logic Require Export base_logic.
2
From iris.algebra Require Import iprod gmap.
3
From iris.algebra Require cofe_solver.
4
Set Default Proof Using "Type".
5

6
7
8
(** In this file we construct the type [iProp] of propositions of the Iris
logic. This is done by solving the following recursive domain equation:

9
  iProp ≈ uPred (∀ i : gid, gname -fin-> (Σ i) iProp)
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

where:

  Σ : gFunctors  := lists of locally constractive functors
  i : gid        := indexes addressing individual functors in [Σ]
  γ : gname      := ghost variable names

The Iris logic is parametrized by a list of locally contractive functors [Σ]
from the category of COFEs to the category of CMRAs. These functors are
instantiated with [iProp], the type of Iris propositions, which allows one to
construct impredicate CMRAs, such as invariants and stored propositions using
the agreement CMRA. *)


(** * Locally contractive functors *)
(** The type [gFunctor] bundles a functor from the category of COFEs to the
category of CMRAs with a proof that it is locally contractive. *)
27
28
29
Structure gFunctor := GFunctor {
  gFunctor_F :> rFunctor;
  gFunctor_contractive : rFunctorContractive gFunctor_F;
30
}.
31
32
Arguments GFunctor _ {_}.
Existing Instance gFunctor_contractive.
33

34
35
36
37
38
39
(** The type [gFunctors] describes the parameters [Σ] of the Iris logic: lists
of [gFunctor]s.

Note that [gFunctors] is isomorphic to [list gFunctor], but defined in an
alternative way to avoid universe inconsistencies with respect to the universe
monomorphic [list] type. *)
40
Definition gFunctors := { n : nat & fin n  gFunctor }.
41

42
Definition gid (Σ : gFunctors) := fin (projT1 Σ).
43
44
Definition gFunctors_lookup (Σ : gFunctors) : gid Σ  gFunctor := projT2 Σ.
Coercion gFunctors_lookup : gFunctors >-> Funclass.
45
46
47

Definition gname := positive.

48
(** The resources functor [iResF Σ A := ∀ i : gid, gname -fin-> (Σ i) A]. *)
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
Definition iResF (Σ : gFunctors) : urFunctor :=
  iprodURF (λ i, gmapURF gname (Σ i)).


(** We define functions for the empty list of functors, the singleton list of
functors, and the append operator on lists of functors. These are used to
compose [gFunctors] out of smaller pieces. *)
Module gFunctors.
  Definition nil : gFunctors := existT 0 (fin_0_inv _).

  Definition singleton (F : gFunctor) : gFunctors :=
    existT 1 (fin_S_inv (λ _, gFunctor) F (fin_0_inv _)).

  Definition app (Σ1 Σ2 : gFunctors) : gFunctors :=
    existT (projT1 Σ1 + projT1 Σ2) (fin_plus_inv _ (projT2 Σ1) (projT2 Σ2)).
End gFunctors.

Coercion gFunctors.singleton : gFunctor >-> gFunctors.
Notation "#[ ]" := gFunctors.nil (format "#[ ]").
Notation "#[ Σ1 ; .. ; Σn ]" :=
  (gFunctors.app Σ1 .. (gFunctors.app Σn gFunctors.nil) ..).


(** * Subfunctors *)
(** In order to make proofs in the Iris logic modular, they are not done with
respect to some concrete list of functors [Σ], but are instead parametrized by
Zhen Zhang's avatar
Zhen Zhang committed
75
76
77
an arbitrary list of functors [Σ] that contains at least certain functors. For
example, the lock library is parameterized by a functor [Σ] that should have
the functors corresponding to the heap and the exclusive monoid to manage to
78
79
80
81
82
83
84
85
lock invariant.

The contraints to can be expressed using the type class [subG Σ1 Σ2], which
expresses that the functors [Σ1] are contained in [Σ2]. *)
Class subG (Σ1 Σ2 : gFunctors) := in_subG i : { j | Σ1 i = Σ2 j }.

(** Avoid trigger happy type class search: this line ensures that type class
search is only triggered if the arguments of [subG] do not contain evars. Since
86
instance search for [subG] is restrained, instances should persistently have [subG] as
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
their first parameter to avoid loops. For example, the instances [subG_authΣ]
and [auth_discrete] otherwise create a cycle that pops up arbitrarily. *)
Hint Mode subG + + : typeclass_instances.

Lemma subG_inv Σ1 Σ2 Σ : subG (gFunctors.app Σ1 Σ2) Σ  subG Σ1 Σ * subG Σ2 Σ.
Proof.
  move=> H; split.
  - move=> i; move: H=> /(_ (Fin.L _ i)) [j] /=. rewrite fin_plus_inv_L; eauto.
  - move=> i; move: H=> /(_ (Fin.R _ i)) [j] /=. rewrite fin_plus_inv_R; eauto.
Qed.

Instance subG_refl Σ : subG Σ Σ.
Proof. move=> i; by exists i. Qed.
Instance subG_app_l Σ Σ1 Σ2 : subG Σ Σ1  subG Σ (gFunctors.app Σ1 Σ2).
Proof.
  move=> H i; move: H=> /(_ i) [j ?].
  exists (Fin.L _ j). by rewrite /= fin_plus_inv_L.
Qed.
105
Instance subG_app_r Σ Σ1 Σ2 : subG Σ Σ2  subG Σ (gFunctors.app Σ1 Σ2).
106
107
108
109
110
111
112
Proof.
  move=> H i; move: H=> /(_ i) [j ?].
  exists (Fin.R _ j). by rewrite /= fin_plus_inv_R.
Qed.


(** * Solution of the recursive domain equation *)
Zhen Zhang's avatar
Zhen Zhang committed
113
(** We first declare a module type and then an instance of it so as to seal all of
114
115
the construction, this way we are sure we do not use any properties of the
construction, and also avoid Coq from blindly unfolding it. *)
116
Module Type iProp_solution_sig.
117
  Parameter iPreProp : gFunctors  ofeT.
118
119
  Definition iResUR (Σ : gFunctors) : ucmraT :=
    iprodUR (λ i, gmapUR gname (Σ i (iPreProp Σ))).
120
  Notation iProp Σ := (uPredC (iResUR Σ)).
121

122
123
124
125
126
127
  Parameter iProp_unfold:  {Σ}, iProp Σ -n> iPreProp Σ.
  Parameter iProp_fold:  {Σ}, iPreProp Σ -n> iProp Σ.
  Parameter iProp_fold_unfold:  {Σ} (P : iProp Σ),
    iProp_fold (iProp_unfold P)  P.
  Parameter iProp_unfold_fold:  {Σ} (P : iPreProp Σ),
    iProp_unfold (iProp_fold P)  P.
128
129
130
End iProp_solution_sig.

Module Export iProp_solution : iProp_solution_sig.
131
132
133
134
  Import cofe_solver.
  Definition iProp_result (Σ : gFunctors) :
    solution (uPredCF (iResF Σ)) := solver.result _.

135
  Definition iPreProp (Σ : gFunctors) : ofeT := iProp_result Σ.
136
137
  Definition iResUR (Σ : gFunctors) : ucmraT :=
    iprodUR (λ i, gmapUR gname (Σ i (iPreProp Σ))).
138
  Notation iProp Σ := (uPredC (iResUR Σ)).
139

140
141
142
143
144
145
146
  Definition iProp_unfold {Σ} : iProp Σ -n> iPreProp Σ :=
    solution_fold (iProp_result Σ).
  Definition iProp_fold {Σ} : iPreProp Σ -n> iProp Σ := solution_unfold _.
  Lemma iProp_fold_unfold {Σ} (P : iProp Σ) : iProp_fold (iProp_unfold P)  P.
  Proof. apply solution_unfold_fold. Qed.
  Lemma iProp_unfold_fold {Σ} (P : iPreProp Σ) : iProp_unfold (iProp_fold P)  P.
  Proof. apply solution_fold_unfold. Qed.
147
148
End iProp_solution.

149
150

(** * Properties of the solution to the recursive domain equation *)
151
152
153
Lemma iProp_unfold_equivI {Σ} (P Q : iProp Σ) :
  iProp_unfold P  iProp_unfold Q  (P  Q : iProp Σ).
Proof.
154
  rewrite -{2}(iProp_fold_unfold P) -{2}(iProp_fold_unfold Q). apply: bi.f_equiv.
155
Qed.