2 ms·
Sorry if I got the syntax wrong, but in something like f = { x = (list 1 2 3) y = (list x x) z = (get x 1) <- y } How does the compile
by gus_massa 3y ago
Sorry if I got the syntax wrong, but in something like
f = {
x = (list 1 2 3)
y = (list x x)
z = (get x 1)
<- y
}
How does the compiler decides if it must free the memory used by x?
- s_Hogg 3y agoAll lists are passed by value and X isn't the return value, would be my guess
- yeputons 3y agoIt should. Everything is copied and by-value, there are no references/pointers or even closures, cycles are impossible. Think Pascal that has garbage collection for strings and dynamic arrays.
- _a_a_a_ 3y agoIt's an interpreter rather than a compiler, and looking at the code it seems to use ref counting
- gus_massa 3y agoRef counting makes a lot of sense with the description of the OP, and if there are no cycles it's good.