rhi/quox
rhi/quox
1
0
Fork 0
Code Issues 15 Pull requests 1 Releases Wiki Activity

allow multiple names in a binder

Browse source 
e.g. "(x y : ℕ) × plus x y ≡ 10 : ℕ"

fixes #2
This commit is contained in:
rhiannon morris 2023-04-19 21:36:57 +02:00
parent b4a8438434
commit 3f06e8d68b
8 changed files with 49 additions and 50 deletions
Download patch file Download diff file Expand all files Collapse all files

7
examples/nat.quox
View file

@ -33,8 +33,7 @@ def pred : 1.ℕ → ℕ = λ n ⇒ case1 n return ℕ of { zero ⇒ zero; succ
def pred-succ : ω.(n : ℕ) → pred (succ n) ≡ n : ℕ =
λ n ⇒ δ 𝑖 ⇒ n;
def0 succ-inj : 0.(m : ℕ) → 0.(n : ℕ) →
0.(succ m ≡ succ n : ℕ) → m ≡ n : ℕ =
def0 succ-inj : 0.(m n : ℕ) → 0.(succ m ≡ succ n : ℕ) → m ≡ n : ℕ =
λ m n eq ⇒ δ 𝑖 ⇒ pred (eq @𝑖);
@ -94,14 +93,14 @@ def0 plus-zero : 0.(m : ℕ) → m ≡ plus m 0 : ℕ =
succ _, ω.ih ⇒ δ 𝑖 ⇒ succ (ih @𝑖)
};
def0 plus-succ : 0.(m : ℕ) → 0.(n : ℕ) → succ (plus m n) ≡ plus m (succ n) : ℕ =
def0 plus-succ : 0.(m n : ℕ) → succ (plus m n) ≡ plus m (succ n) : ℕ =
λ m n ⇒
caseω m return m' ⇒ succ (plus m' n) ≡ plus m' (succ n) : ℕ of {
zero ⇒ δ _ ⇒ succ n;
succ _, ω.ih ⇒ δ 𝑖 ⇒ succ (ih @𝑖)
};
def0 plus-comm : 0.(m : ℕ) → 0.(n : ℕ) → plus m n ≡ plus n m : ℕ =
def0 plus-comm : 0.(m n : ℕ) → plus m n ≡ plus n m : ℕ =
λ m n ⇒
caseω m return m' ⇒ plus m' n ≡ plus n m' : ℕ of {
zero ⇒ plus-zero n;