michael/csci8980-f21
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

agda style

Browse source
This commit is contained in:
Jeremy Siek 2019-08-20 15:37:15 -04:00
parent b88cd2478b
commit 69da80df93
1 changed files with 72 additions and 73 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
src/plfa/part3/Compositional.lagda.md
View file

@ -35,7 +35,8 @@ open import plfa.part2.Untyped
using (Context; _,_; ★; _∋_; _⊢_; `_; ƛ_; _·_)
open import plfa.part3.Denotational
using (Value; _↦_; _`,_; _⊔_; ⊥; _⊑_; _⊢_↓_;
⊑-bot; ⊑-fun; ⊑-conj-L; ⊑-conj-R1; ⊑-conj-R2; ⊑-dist; ⊑-refl; ⊑-trans; ⊔↦⊔-dist;
⊑-bot; ⊑-fun; ⊑-conj-L; ⊑-conj-R1; ⊑-conj-R2;
⊑-dist; ⊑-refl; ⊑-trans; ⊔↦⊔-dist;
var; ↦-intro; ↦-elim; ⊔-intro; ⊥-intro; sub;
up-env; ℰ; _≃_; ≃-sym; Denotation; Env)
open plfa.part3.Denotational.≃-Reasoning
@ -308,8 +309,7 @@ To round-out the semantic equations, we establish the following one
for variables.
```
var-equiv : ∀{Γ}{x : Γ ∋ ★}
→ ℰ (` x) ≃ (λ γ v → v ⊑ γ x)
var-equiv : ∀{Γ}{x : Γ ∋ ★} → ℰ (` x) ≃ (λ γ v → v ⊑ γ x)
var-equiv γ v = ⟨ var-inv , (λ lt → sub var lt) ⟩
```
@ -507,8 +507,7 @@ straightforward induction, using the three equations
with the congruence lemmas for `ℱ` and `●`.
```
ℰ≃⟦⟧ : ∀ {Γ} {M : Γ ⊢ ★}
→ ℰ M ≃ ⟦ M ⟧
ℰ≃⟦⟧ : ∀ {Γ} {M : Γ ⊢ ★} → ℰ M ≃ ⟦ M ⟧
ℰ≃⟦⟧ {Γ} {` x} = var-equiv
ℰ≃⟦⟧ {Γ} {ƛ N} =
let ih = ℰ≃⟦⟧ {M = N} in