quox/examples/list.quox

39 lines
1.2 KiB
Text
Raw Normal View History

2023-03-31 13:31:49 -04:00
def0 Vec : 0. → 0.★₀ → ★₀ =
λ n A ⇒
caseω n return ★₀ of {
zero ⇒ {nil};
succ _, 0.Tail ⇒ A × Tail
};
def0 List : 0.★₀ → ★₀ =
λ A ⇒ (len : ) × Vec len A;
2023-04-17 15:44:16 -04:00
def nil : 0.(A : ★₀) → List A =
2023-03-31 13:31:49 -04:00
λ A ⇒ (0, 'nil);
2023-04-17 15:44:16 -04:00
def cons : 0.(A : ★₀) → 1.A → 1.(List A) → List A =
λ A x xs ⇒ case1 xs return List A of { (len, elems) ⇒ (succ len, x, elems) };
def foldr' : 0.(A : ★₀) → 0.(B : ★₀) →
1.B → ω.(1.A → 1.B → B) → 1.(n : ) → 1.(Vec n A) → B =
λ A B z c n ⇒
case1 n return n' ⇒ 1.(Vec n' A) → B of {
zero ⇒
λ nil ⇒ case1 nil return B of { 'nil ⇒ z };
succ n, 1.ih ⇒
λ cons ⇒ case1 cons return B of { (first, rest) ⇒ c first (ih rest) }
2023-03-31 13:31:49 -04:00
};
2023-04-17 15:44:16 -04:00
def foldr : 0.(A : ★₀) → 0.(B : ★₀) →
1.B → ω.(1.A → 1.B → B) → 1.(List A) → B =
λ A B z c xs ⇒
case1 xs return B of { (len, elems) ⇒ foldr' A B z c len elems };
2023-03-31 13:31:49 -04:00
2023-04-17 15:44:16 -04:00
load "nat.quox";
2023-03-31 13:31:49 -04:00
2023-04-17 15:44:16 -04:00
def sum : 1.(List ) → = foldr 0 plus;
2023-03-31 13:31:49 -04:00
2023-04-17 15:44:16 -04:00
def numbers : List = (5, (0, 1, 2, 3, 4, 5, 'nil));
2023-03-31 13:31:49 -04:00
2023-04-17 15:44:16 -04:00
def number-sum : sum numbers ≡ 10 : = δ _ ⇒ 10;