1
1
mirror of https://github.com/anoma/juvix.git synced 2024-11-30 05:42:26 +03:00
juvix/tests/Rust/Compilation/positive/test034.juvix
Łukasz Czajka 3030196fdd Non-recursive definitions (#3138)
* Closes #2968 
* Implements detection of function-like definitions, which either:
  - have some arguments on the left of `:`, or
  - have at least one clause.
* Only function-like definitions are recursive.
* Non-recursive definitions are not mutually recursive either, and can
be used only after their definition. This necessitates rearranging some
definitions in existing Juvix code.
* Changes the scoping of identifiers in record updates. Now field names
on the right side don't refer to the old values of the record fields but
to identifiers in scope defined outside the record update. To refer to
old values, one needs to explicitly use record projections, e.g.
```
r@Rec{x := Rec.x r}
```
2024-11-04 18:18:39 +01:00

24 lines
491 B
Plaintext

-- recursive let
module test034;
import Stdlib.Prelude open;
sum : Nat → Nat :=
let
sum' : Nat → Nat
| zero := zero
| (suc n) := suc n + sum' n
in sum';
mutrec : Nat :=
let
terminating
f (x : Nat) : Nat := ite (x < 1) 1 (g (sub x 1) + 2 * x);
terminating
g (x : Nat) : Nat := ite (x < 1) 1 (x + h (sub x 1));
terminating
h (x : Nat) : Nat := ite (x < 1) 1 (x * f (sub x 1));
in f 5 + f 10 + g 5 + h 5;
main : Nat := sum 1000 + mutrec;