-
Currently if is defined like
```haskell
if : {A : Type} → Bool → A → A → A;
if true a _ ≔ a;
if false _ b ≔ b;
```
and since the language is not lazy, this means both `a` and `b` will …
-
The contents of the file are irrelevant for now.
-
-
See https://github.com/heliaxdev/minijuvix/issues/42 for context.
We decided to return to the behaviour of stopping type-checking after the first type error, reverting work done in https://github.c…
-
Compiling:
```agda
module loop;
inductive Unit {
unit : Unit;
};
terminating
loop : {A : Type} -> A;
loop := loop;
const : {A : Type} -> A -> A -> A;
const x y := x;
fail : Unit…
-
For instance, the constructor TypeUniverse lacks location information. Probably it needs to be added to more constructors.
We should also consider handling parsed objects and generated objects locati…
-
The following microjuvix code typechecks as expected:
```
module ListList;
infixr 5 ∷;
inductive List (A : Type) {
nil : List A;
∷ : A → List A → List A;
};
inductive Foo {
a : Fo…
-
Compiling:
```agda
module check;
open import Stdlib.Data.List;
open import Stdlib.Prelude;
main : IO;
main ≔ putStrLn (natToStr (length nil));
end;
```
results in:
```
check.juv…
-
Discussion of private trade circuits we should aim to ship along with Anoma's initial launch.
-
https://github.com/metastatedev/juvix/pull/592/commits/62a79cb07e9850802346b20203fff7dfc912a3c2
In this commit we can see some org parts get flipped around, it seems the file system orders them dif…