derived.v 2.86 KB
Newer Older
1
From iris.heap_lang Require Export lifting.
2 3 4
Import uPred.

(** Define some derived forms, and derived lemmas about them. *)
5
Notation Lam x e := (Rec BAnon x e).
6
Notation Let x e1 e2 := (App (Lam x e2) e1).
7 8
Notation Seq e1 e2 := (Let BAnon e1 e2).
Notation LamV x e := (RecV BAnon x e).
9
Notation LetCtx x e2 := (AppRCtx (LamV x e2)).
10
Notation SeqCtx e2 := (LetCtx BAnon e2).
11
Notation Skip := (Seq (Lit LitUnit) (Lit LitUnit)).
12
Notation Match e0 x1 e1 x2 e2 := (Case e0 (Lam x1 e1) (Lam x2 e2)).
13 14

Section derived.
15
Context {Σ : iFunctor}.
16 17
Implicit Types P Q : iProp heap_lang Σ.
Implicit Types Φ : val  iProp heap_lang Σ.
18 19

(** Proof rules for the sugar *)
20 21
Lemma wp_lam E x ef e Φ :
  is_Some (to_val e)  Closed (x :b: []) ef 
22
   WP subst' x e ef @ E {{ Φ }}  WP App (Lam x ef) e @ E {{ Φ }}.
23
Proof. intros. by rewrite -(wp_rec _ BAnon) //. Qed.
24

25 26
Lemma wp_let E x e1 e2 Φ :
  is_Some (to_val e1)  Closed (x :b: []) e2 
27
   WP subst' x e1 e2 @ E {{ Φ }}  WP Let x e1 e2 @ E {{ Φ }}.
28
Proof. apply wp_lam. Qed.
29

30 31
Lemma wp_seq E e1 e2 Φ :
  is_Some (to_val e1)  Closed [] e2 
32
   WP e2 @ E {{ Φ }}  WP Seq e1 e2 @ E {{ Φ }}.
33
Proof. intros ??. by rewrite -wp_let. Qed.
34

35
Lemma wp_skip E Φ :  Φ (LitV LitUnit)  WP Skip @ E {{ Φ }}.
36
Proof. rewrite -wp_seq; last eauto. by rewrite -wp_value. Qed.
37

38 39
Lemma wp_match_inl E e0 x1 e1 x2 e2 Φ :
  is_Some (to_val e0)  Closed (x1 :b: []) e1 
40
   WP subst' x1 e0 e1 @ E {{ Φ }}  WP Match (InjL e0) x1 e1 x2 e2 @ E {{ Φ }}.
41
Proof. intros. by rewrite -wp_case_inl // -[X in _  X]later_intro -wp_let. Qed.
42

43 44
Lemma wp_match_inr E e0 x1 e1 x2 e2 Φ :
  is_Some (to_val e0)  Closed (x2 :b: []) e2 
45
   WP subst' x2 e0 e2 @ E {{ Φ }}  WP Match (InjR e0) x1 e1 x2 e2 @ E {{ Φ }}.
46
Proof. intros. by rewrite -wp_case_inr // -[X in _  X]later_intro -wp_let. Qed.
47

48
Lemma wp_le E (n1 n2 : Z) P Φ :
49 50
  (n1  n2  P   |={E}=> Φ (LitV (LitBool true))) 
  (n2 < n1  P   |={E}=> Φ (LitV (LitBool false))) 
51
  P  WP BinOp LeOp (Lit (LitInt n1)) (Lit (LitInt n2)) @ E {{ Φ }}.
52 53 54 55 56
Proof.
  intros. rewrite -wp_bin_op //; [].
  destruct (bool_decide_reflect (n1  n2)); by eauto with omega.
Qed.

57
Lemma wp_lt E (n1 n2 : Z) P Φ :
58 59
  (n1 < n2  P   |={E}=> Φ (LitV (LitBool true))) 
  (n2  n1  P   |={E}=> Φ (LitV (LitBool false))) 
60
  P  WP BinOp LtOp (Lit (LitInt n1)) (Lit (LitInt n2)) @ E {{ Φ }}.
61 62 63 64 65
Proof.
  intros. rewrite -wp_bin_op //; [].
  destruct (bool_decide_reflect (n1 < n2)); by eauto with omega.
Qed.

66
Lemma wp_eq E (n1 n2 : Z) P Φ :
67 68
  (n1 = n2  P   |={E}=> Φ (LitV (LitBool true))) 
  (n1  n2  P   |={E}=> Φ (LitV (LitBool false))) 
69
  P  WP BinOp EqOp (Lit (LitInt n1)) (Lit (LitInt n2)) @ E {{ Φ }}.
70 71 72 73 74
Proof.
  intros. rewrite -wp_bin_op //; [].
  destruct (bool_decide_reflect (n1 = n2)); by eauto with omega.
Qed.
End derived.