Commit 81ed7343 authored by Ralf Jung's avatar Ralf Jung
Browse files

COFE for sigma types

parent 6bbc6b49
......@@ -955,6 +955,59 @@ Proof.
destruct n as [|n]; simpl in *; first done. apply cFunctor_ne, Hfg.
(** Sigma *)
Section sigma.
Context {A : ofeT} {f : A Prop}.
  • Probably better to name this P : A → Prop

  • I wasn't sure since P is also frequently an iProp. But I tend to agree.

  • In prelude we use P a lot for predicates (e.g. in Forall and Exists). Ambiguity of naming only starts to appear when we also have the base logic, in ofe.v that is not the case yet.

Please register or sign in to reply
(* TODO: Find a better place for this Equiv instance. It also
should not depend on A being an OFE. *)
Instance sig_equiv : Equiv (sig f) :=
λ x1 x2, (proj1_sig x1) (proj1_sig x2).
Instance sig_dist : Dist (sig f) :=
λ n x1 x2, (proj1_sig x1) {n} (proj1_sig x2).
Global Lemma exist_ne :
Please register or sign in to reply
n x1 x2, x1 {n} x2
(H1 : f x1) (H2 : f x2), (exist f x1 H1) {n} (exist f x2 H2).
Proof. intros n ?? Hx ??. exact Hx. Qed.
Global Instance proj1_sig_ne : Proper (dist n ==> dist n) (@proj1_sig _ f).
Proof. intros n [] [] ?. done. Qed.
Definition sig_ofe_mixin : OfeMixin (sig f).
- intros x y. unfold dist, sig_dist, equiv, sig_equiv.
destruct x, y. apply equiv_dist.
- unfold dist, sig_dist. intros n.
split; [intros [] | intros [] [] | intros [] [] []]; simpl; try done.
intros. by etrans.
- intros n [] []. unfold dist, sig_dist. apply dist_S.
Canonical Structure sigC : ofeT := OfeT (sig f) sig_ofe_mixin.
Global Class LimitPreserving `{Cofe A} : Prop :=
  • You probably want to put this class outside of the section. That makes stuff clearer. Besides, the A is now implicit, which would not happen if you put it outside.

  • Ack. It's good for A to be implicit, but f should be explicit and it is not.

  • Oh, I meant f, not A.

    Thus, what you say is right: f should be explicit, A should be implicit.

Please register or sign in to reply
limit_preserving : c : chain A, ( n, f (c n)) f (compl c).
Program Definition sig_compl `{LimitPreserving} : Compl sigC :=
λ c, exist f (compl (chain_map proj1_sig c)) _.
Next Obligation.
intros ? Hlim c. apply Hlim. move=>n /=. destruct (c n). done.
Program Definition sig_cofe `{LimitPreserving} : Cofe sigC :=
{| compl := sig_compl |}.
Next Obligation.
intros ? Hlim n c. apply (conv_compl n (chain_map proj1_sig c)).
Global Instance sig_timeless (x : sig f) :
Timeless (proj1_sig x) Timeless x.
Proof. intros ? y. destruct x, y. unfold dist, sig_dist, equiv, sig_equiv. apply (timeless _). Qed.
Global Instance sig_discrete_cofe : Discrete A Discrete sigC.
intros ? [??] [??]. rewrite /dist /equiv /ofe_dist /ofe_equiv /=.
rewrite /sig_dist /sig_equiv /=. apply discrete_timeless.
End sigma.
Arguments sigC {A} f.
(** Notation for writing functors *)
Notation "∙" := idCF : cFunctor_scope.
Notation "T -c> F" := (ofe_funCF T%type F%CF) : cFunctor_scope.
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment