modalities.v 8.08 KB
Newer Older
1 2 3 4 5 6 7 8
From iris.bi Require Export bi.
From stdpp Require Import namespaces.
Set Default Proof Using "Type".
Import bi.

(** The `iModIntro` tactic is not tied the Iris modalities, but can be
instantiated with a variety of modalities.

9
For the purpose of MoSeL, a modality is a mapping of propositions
10 11 12
`M : PROP1 → PROP2` (where `PROP1` and `PROP2` are BI-algebras)
that is monotone and distributes over finite products. Specifically,
the following rules have to be satisfied:
13 14 15 16 17 18 19 20 21 22 23

      P ⊢ Q        emp ⊢ M emp
    ----------
    M P ⊢ M Q      M P ∗ M Q ⊢ M (P ∗ Q)

Together those conditions allow one to introduce the modality in the
goal, while stripping away the modalities in the context.

Additionally, upon introducing a modality one can perform a number of
associated actions on the intuitionistic and spatial contexts.
Such an action can be one of the following:
24 25 26 27 28 29 30 31 32 33 34

- Introduction is only allowed when the context is empty.
- Introduction is only allowed when all hypotheses satisfy some predicate
  `C : PROP → Prop` (where `C` should be a type class).
- Introduction will transform each hypotheses using a type class
  `C : PROP → PROP → Prop`, where the first parameter is the input and the
  second parameter is the output. Hypotheses that cannot be transformed (i.e.
  for which no instance of `C` can be found) will be cleared.
- Introduction will clear the context.
- Introduction will keep the context as-if.

35 36 37 38 39 40 41 42 43 44 45 46 47
Formally, these actions correspond to the inductive type [modality_action].
For each of those actions you have to prove that the transformation is valid.

To instantiate the modality you have to define: 1) a mixin `modality_mixin`,
2) a record `modality`, 3) a `FromModal` type class instance from `classes.v`.

For examples consult `modality_id` at the end of this file, or the instances
in the `modality_instances.v` file.

Note that in MoSeL modality can map the propositions between two different BI-algebras.
For instance, the <affine> modality maps propositions of an arbitrary BI-algebra into
the sub-BI-algebra of affine propositions.
*)
48

49 50 51 52 53 54
Inductive modality_action (PROP1 : bi) : bi  Type :=
  | MIEnvIsEmpty {PROP2 : bi} : modality_action PROP1 PROP2
  | MIEnvForall (C : PROP1  Prop) : modality_action PROP1 PROP1
  | MIEnvTransform {PROP2 : bi} (C : PROP2  PROP1  Prop) : modality_action PROP1 PROP2
  | MIEnvClear {PROP2} : modality_action PROP1 PROP2
  | MIEnvId : modality_action PROP1 PROP1.
55 56 57 58 59 60 61 62
Arguments MIEnvIsEmpty {_ _}.
Arguments MIEnvForall {_} _.
Arguments MIEnvTransform {_ _} _.
Arguments MIEnvClear {_ _}.
Arguments MIEnvId {_}.

Notation MIEnvFilter C := (MIEnvTransform (TCDiag C)).

63 64
Definition modality_intuitionistic_action_spec {PROP1 PROP2}
    (s : modality_action PROP1 PROP2) : (PROP1  PROP2)  Prop :=
65 66 67 68 69 70 71 72 73 74 75 76
  match s with
  | MIEnvIsEmpty => λ M, True
  | MIEnvForall C => λ M,
     ( P, C P   P  M ( P)) 
     ( P Q, M P  M Q  M (P  Q))
  | MIEnvTransform C => λ M,
     ( P Q, C P Q   P  M ( Q)) 
     ( P Q, M P  M Q  M (P  Q))
  | MIEnvClear => λ M, True
  | MIEnvId => λ M,  P,  P  M ( P)
  end.

77 78
Definition modality_spatial_action_spec {PROP1 PROP2}
    (s : modality_action PROP1 PROP2) : (PROP1  PROP2)  Prop :=
79 80 81 82 83 84 85 86 87 88 89
  match s with
  | MIEnvIsEmpty => λ M, True
  | MIEnvForall C => λ M,  P, C P  P  M P
  | MIEnvTransform C => λ M,  P Q, C P Q  P  M Q
  | MIEnvClear => λ M,  P, Absorbing (M P)
  | MIEnvId => λ M,  P, P  M P
  end.

(* A modality is then a record packing together the modality with the laws it
should satisfy to justify the given actions for both contexts: *)
Record modality_mixin {PROP1 PROP2 : bi} (M : PROP1  PROP2)
90 91 92
    (iaction saction : modality_action PROP1 PROP2) := {
  modality_mixin_intuitionistic : modality_intuitionistic_action_spec iaction M;
  modality_mixin_spatial : modality_spatial_action_spec saction M;
93 94 95 96 97 98 99
  modality_mixin_emp : emp  M emp;
  modality_mixin_mono P Q : (P  Q)  M P  M Q;
  modality_mixin_sep P Q : M P  M Q  M (P  Q)
}.

Record modality (PROP1 PROP2 : bi) := Modality {
  modality_car :> PROP1  PROP2;
100 101
  modality_intuitionistic_action : modality_action PROP1 PROP2;
  modality_spatial_action : modality_action PROP1 PROP2;
102
  modality_mixin_of :
103
    modality_mixin modality_car modality_intuitionistic_action modality_spatial_action
104 105
}.
Arguments Modality {_ _} _ {_ _} _.
106 107
Arguments modality_intuitionistic_action {_ _} _.
Arguments modality_spatial_action {_ _} _.
108 109 110 111

Section modality.
  Context {PROP1 PROP2} (M : modality PROP1 PROP2).

112
  Lemma modality_intuitionistic_transform C P Q :
113
    modality_intuitionistic_action M = MIEnvTransform C  C P Q   P  M ( Q).
114 115
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_and_transform C P Q :
116
    modality_intuitionistic_action M = MIEnvTransform C  M P  M Q  M (P  Q).
117 118
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_spatial_transform C P Q :
119
    modality_spatial_action M = MIEnvTransform C  C P Q  P  M Q.
120 121
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_spatial_clear P :
122
    modality_spatial_action M = MIEnvClear  Absorbing (M P).
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141
  Proof. destruct M as [??? []]; naive_solver. Qed.

  Lemma modality_emp : emp  M emp.
  Proof. eapply modality_mixin_emp, modality_mixin_of. Qed.
  Lemma modality_mono P Q : (P  Q)  M P  M Q.
  Proof. eapply modality_mixin_mono, modality_mixin_of. Qed.
  Lemma modality_sep P Q : M P  M Q  M (P  Q).
  Proof. eapply modality_mixin_sep, modality_mixin_of. Qed.
  Global Instance modality_mono' : Proper (() ==> ()) M.
  Proof. intros P Q. apply modality_mono. Qed.
  Global Instance modality_flip_mono' : Proper (flip () ==> flip ()) M.
  Proof. intros P Q. apply modality_mono. Qed.
  Global Instance modality_proper : Proper (() ==> ()) M.
  Proof. intros P Q. rewrite !equiv_spec=> -[??]; eauto using modality_mono. Qed.
End modality.

Section modality1.
  Context {PROP} (M : modality PROP PROP).

142
  Lemma modality_intuitionistic_forall C P :
143
    modality_intuitionistic_action M = MIEnvForall C  C P   P  M ( P).
144 145
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_and_forall C P Q :
146
    modality_intuitionistic_action M = MIEnvForall C  M P  M Q  M (P  Q).
147
  Proof. destruct M as [??? []]; naive_solver. Qed.
148
  Lemma modality_intuitionistic_id P :
149
    modality_intuitionistic_action M = MIEnvId   P  M ( P).
150 151
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_spatial_forall C P :
152
    modality_spatial_action M = MIEnvForall C  C P  P  M P.
153 154
  Proof. destruct M as [??? []]; naive_solver. Qed.
  Lemma modality_spatial_id P :
155
    modality_spatial_action M = MIEnvId  P  M P.
156 157
  Proof. destruct M as [??? []]; naive_solver. Qed.

158
  Lemma modality_intuitionistic_forall_big_and C Ps :
159
    modality_intuitionistic_action M = MIEnvForall C 
160 161 162
    Forall C Ps   [] Ps  M ( [] Ps).
  Proof.
    induction 2 as [|P Ps ? _ IH]; simpl.
163 164 165
    - by rewrite intuitionistically_True_emp -modality_emp.
    - rewrite intuitionistically_and -modality_and_forall // -IH.
      by rewrite {1}(modality_intuitionistic_forall _ P).
166 167
  Qed.
  Lemma modality_spatial_forall_big_sep C Ps :
168
    modality_spatial_action M = MIEnvForall C 
169 170 171 172 173 174 175 176 177 178 179 180 181
    Forall C Ps  [] Ps  M ([] Ps).
  Proof.
    induction 2 as [|P Ps ? _ IH]; simpl.
    - by rewrite -modality_emp.
    - by rewrite -modality_sep -IH {1}(modality_spatial_forall _ P).
  Qed.
End modality1.

(** The identity modality [modality_id] can be used in combination with
[FromModal modality_id] to support introduction for modalities that enjoy
[P ⊢ M P]. This is done by defining an instance [FromModal modality_id (M P) P],
which will instruct [iModIntro] to introduce the modality without modifying the
proof mode context. Examples of such modalities are [bupd], [fupd], [except_0],
182
[monPred_subjectively] and [bi_absorbingly]. *)
183 184 185
Lemma modality_id_mixin {PROP : bi} : modality_mixin (@id PROP) MIEnvId MIEnvId.
Proof. split; simpl; eauto. Qed.
Definition modality_id {PROP : bi} := Modality (@id PROP) modality_id_mixin.