refactor(tvix/eval): simplify let ... in ... before recursion
While full recursion through thunking is not available, there are actually incorrect behaviours introduced by declaring before binding (example in the newly introduced test). This commit simplifies the implementation to avoid this issue, and also because I intend to explore a bit more how far we can get in non left-to-right bindings *without* introducing thunks immediately. Change-Id: I21fd3007ac3946570639772d7d624d70bd209958 Reviewed-on: https://cl.tvl.fyi/c/depot/+/6226 Tested-by: BuildkiteCI Reviewed-by: sterni <sternenseemann@systemli.org> Reviewed-by: grfn <grfn@gws.fyi>
This commit is contained in:
parent
75ba7c0120
commit
0b51d63081
3 changed files with 14 additions and 30 deletions
1
tvix/eval/src/tests/tvix_tests/eval-okay-nested-let.exp
Normal file
1
tvix/eval/src/tests/tvix_tests/eval-okay-nested-let.exp
Normal file
|
|
@ -0,0 +1 @@
|
|||
7
|
||||
7
tvix/eval/src/tests/tvix_tests/eval-okay-nested-let.nix
Normal file
7
tvix/eval/src/tests/tvix_tests/eval-okay-nested-let.nix
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
let
|
||||
a = let
|
||||
b = 1;
|
||||
c = 2;
|
||||
in b + c;
|
||||
b = 4;
|
||||
in a + b
|
||||
Loading…
Add table
Add a link
Reference in a new issue