-
Like the title says:
You can construct `IsEven(5)` with `make_even(2.5)` since you switched from integer to floats for Number.
Changing from Number to Nat does fix this issue.
-
The documentation states
`if n: a else: b` | If `n .= 0`, evaluates to `a`, else, evaluates to `b`
According to the segment above that, `.=` means "equals". So, if `n` equals `0`, `n` should ef…
-
`nand` and `xor` from `Data.Bool` are equal. `nand x y` is usually defined to be equal to `and (not x) y`.
`nor x y` is equal to `not (or (not x) (not y))` which is a slightly unconventional defini…
-
Interested in NASIC, but it's missing a lot.
-
Because types are corecursively defined, to check whether those types are equal, we cannot just normalize them and check whether their normal forms are definitionally equal. Rather, we attempt to redu…
-
-
From my experience, the dot notation **extremely improves the readability** of code, while it is *very easy to implement*.
The rule:
```haskell
foo(a,b,c) == a.foo(b,c)
```
The code:
```h…
-
-
Why it is necessary to cover cases that does not occur?
```formality
T Vector {A : Type} (len : Nat)
| vcons {len : Nat, head : A, tail : Vector(A, len)} (succ(len))
| vnil …
-
I think maybe the documentation (and possibly the implementation) changed regarding recursive functions - I had some test functions defined so:
```
!mul2*N : !{case n : Nat} -> Nat
| succ => succ…