1
1
mirror of https://github.com/anoma/juvix.git synced 2024-12-04 17:07:28 +03:00
juvix/tests/positive/PolymorphismHoles.juvix

94 lines
2.2 KiB
Plaintext

module PolymorphismHoles;
type Pair (A : Type) (B : Type) :=
mkPair : A → B → Pair A B;
type Nat :=
zero : Nat |
suc : Nat → Nat;
type List (A : Type) :=
nil : List A |
cons : A → List A → List A;
type Bool :=
false : Bool |
true : Bool;
id : (A : Type) → A → A;
id _ a := a;
terminating
undefined : (A : Type) → A;
undefined A := undefined A;
add : Nat → Nat → Nat;
add zero b := b;
add (suc a) b := suc (add a b);
fst : (A : Type) → (B : Type) → Pair A B → A;
fst _ _ (mkPair a b) := a;
p : Pair Bool Bool;
p := mkPair true false;
swap : (A : Type) → (B : Type) → Pair A B → Pair B A;
swap A B (mkPair a b) := mkPair b a;
curry : (A : Type) → (B : Type) → (C : Type)
→ (Pair A B → C) → A → B → C;
curry A B C f a b := f (mkPair a b) ;
ap : (A : Type) → (B : Type)
→ (A → B) → A → B;
ap A B f a := f a;
headDef : (A : Type) → A → List A → A;
headDef _ d nil := d;
headDef A _ (cons h _) := h;
ite : (A : Type) → Bool → A → A → A;
ite _ true tt _ := tt;
ite _ false _ ff := ff;
filter : (A : Type) → (A → Bool) → List A → List A;
filter _ f nil := nil;
filter _ f (cons x xs) := ite _ (f x) (cons x (filter _ f xs)) (filter _ f xs);
map : (A : Type) → (B : Type) →
(A → B) → List _ → List _;
map _ _ f nil := nil;
map _ _ f (cons x xs) := cons (f x) (map _ _ f xs);
zip : (A : Type) → (B : Type)
→ List A → List B → List (Pair A B);
zip A _ nil _ := nil;
zip _ _ _ nil := nil;
zip _ _ (cons a as) (cons b bs) := nil;
zipWith : (A : Type) → (B : Type) → (C : Type)
→ (A → B → C)
→ List A → List B → List C;
zipWith _ _ C f nil _ := nil;
zipWith _ _ C f _ nil := nil;
zipWith _ _ _ f (cons a as) (cons b bs) := cons (f a b) (zipWith _ _ _ f as bs);
rankn : ((A : Type) → A → A) → Bool → Nat → Pair Bool Nat;
rankn f b n := mkPair (f _ b) (f _ n);
-- currying
trankn : Pair Bool Nat;
trankn := rankn id false zero;
l1 : List Nat;
l1 := cons zero nil;
pairEval : (A : Type) → (B : Type) → Pair (A → B) A → B;
pairEval _ _ (mkPair f x) := f x;
main : Nat;
main := headDef _ (pairEval _ _ (mkPair (add zero) zero))
(zipWith _ _ _ add l1 l1);
end;