diff options
author | Rutger Broekhoff | 2024-06-27 01:56:05 +0200 |
---|---|---|
committer | Rutger Broekhoff | 2024-06-27 01:56:05 +0200 |
commit | 4598e77a9406d8040357c943a05dd1ab939932db (patch) | |
tree | e990beaa94803da3585547f22e186e8819f6a887 /sound.v | |
parent | 73df1945b31c0beee88cf4476df4ccd09d31403b (diff) | |
download | mininix-formalization-4598e77a9406d8040357c943a05dd1ab939932db.tar.gz mininix-formalization-4598e77a9406d8040357c943a05dd1ab939932db.zip |
Tidy up project
* Write README.md
* Add LICENSE
* Clean up some theorems and proofs
Diffstat (limited to 'sound.v')
-rw-r--r-- | sound.v | 56 |
1 files changed, 27 insertions, 29 deletions
@@ -13,9 +13,8 @@ Lemma strong_value_stuck_rtc sv e: | |||
13 | expr_from_strong_value sv -->* e → | 13 | expr_from_strong_value sv -->* e → |
14 | e = expr_from_strong_value sv. | 14 | e = expr_from_strong_value sv. |
15 | Proof. | 15 | Proof. |
16 | intros. inv H. | 16 | intros. inv H; [done|]. |
17 | - reflexivity. | 17 | exfalso. apply strong_value_stuck with (sv := sv). by exists y. |
18 | - exfalso. apply strong_value_stuck with (sv := sv). by exists y. | ||
19 | Qed. | 18 | Qed. |
20 | 19 | ||
21 | Lemma force__strong_value (e : expr) (v : value) : | 20 | Lemma force__strong_value (e : expr) (v : value) : |
@@ -68,33 +67,32 @@ Lemma force_map_fmap_union_insert (sws : gmap string strong_value) es k e sv : | |||
68 | Proof. | 67 | Proof. |
69 | intros [n Hsteps] % rtc_nsteps. | 68 | intros [n Hsteps] % rtc_nsteps. |
70 | revert sws es k e Hsteps. | 69 | revert sws es k e Hsteps. |
71 | induction n; intros sws es k e Hsteps. | 70 | induction n; intros sws es k e Hsteps; [inv Hsteps|]. |
72 | - inv Hsteps. | 71 | inv Hsteps. |
73 | - inv Hsteps. | 72 | inv H0. |
74 | inv H0. | 73 | inv H2. |
75 | inv H2. | 74 | - inv H3. inv H1. |
76 | + inv H3. inv H1. | 75 | + simplify_option_eq. unfold expr_from_strong_value, compose. |
77 | * simplify_option_eq. unfold expr_from_strong_value, compose. | 76 | by rewrite H4. |
78 | by rewrite H4. | 77 | + edestruct strong_value_stuck. exists y. done. |
79 | * edestruct strong_value_stuck. exists y. done. | 78 | - inv H0. simplify_option_eq. |
80 | + inv H0. simplify_option_eq. | 79 | apply rtc_transitive |
81 | apply rtc_transitive | 80 | with (y := X_Force (X_V (V_Attrset (<[k:=E2 e2]> es ∪ |
82 | with (y := X_Force (X_V (V_Attrset (<[k:=E2 e2]> es ∪ | 81 | (expr_from_strong_value <$> sws))))). |
83 | (expr_from_strong_value <$> sws))))). | 82 | + do 2 rewrite <-insert_union_l. |
84 | * do 2 rewrite <-insert_union_l. | 83 | apply rtc_once. |
85 | apply rtc_once. | 84 | eapply E_Ctx |
86 | eapply E_Ctx | 85 | with (E := λ e, X_Force (X_V (V_Attrset (<[k := E2 e]>(es ∪ |
87 | with (E := λ e, X_Force (X_V (V_Attrset (<[k := E2 e]>(es ∪ | 86 | (expr_from_strong_value <$> sws)))))). |
88 | (expr_from_strong_value <$> sws)))))). | 87 | * eapply IsCtx_Compose. |
89 | -- eapply IsCtx_Compose. | 88 | -- constructor. |
89 | -- eapply IsCtx_Compose | ||
90 | with (E1 := (λ e, X_V (V_Attrset (<[k := e]>(es ∪ | ||
91 | (expr_from_strong_value <$> sws)))))). | ||
90 | ++ constructor. | 92 | ++ constructor. |
91 | ++ eapply IsCtx_Compose | 93 | ++ done. |
92 | with (E1 := (λ e, X_V (V_Attrset (<[k := e]>(es ∪ | 94 | * done. |
93 | (expr_from_strong_value <$> sws)))))). | 95 | + by apply IHn. |
94 | ** constructor. | ||
95 | ** done. | ||
96 | -- done. | ||
97 | * by apply IHn. | ||
98 | Qed. | 96 | Qed. |
99 | 97 | ||
100 | Lemma insert_union_fmap__union_fmap_insert {A B} (f : A → B) i x | 98 | Lemma insert_union_fmap__union_fmap_insert {A B} (f : A → B) i x |