Hi, I'm Swastik Baranwal, a software developer from New Delhi, India passionate about open-source contribution, Gopher, Pythoneer, Compiler Design and DevOps.
So basically is uses reference counting but runs aggressive lifetime analysis to convert as many strong references to weak ones, to reduce the number of actual RC updates, and if possible even put the value on the stack and avoid heap allocation altogether?
And the compiler will do all that in super blazing fast speed?
Hi, I'm Swastik Baranwal, a software developer from New Delhi, India passionate about open-source contribution, Gopher, Pythoneer, Compiler Design and DevOps.
Here's the memory model they are gonna follow aardappel.github.io/lobster/memory...
So basically is uses reference counting but runs aggressive lifetime analysis to convert as many strong references to weak ones, to reduce the number of actual RC updates, and if possible even put the value on the stack and avoid heap allocation altogether?
And the compiler will do all that in super blazing fast speed?
Probably. I don't if this will slow down the compile speed because I am not the creator V lang.