Hacker News new | past | comments | ask | show | jobs | submit login

> Some interesting research that may be landing soon that has me excited would enable a completely pure program to do register and memory mutations under the hood, so to speak, in order to boost baseline performance. I don't think we're far off from seeing a dependently typed, pure, lazy functional language that can have bounded performance guarantees... and possibly be able to compile programs that don't even need run time support from a GC.

Is there any more info/links available about this?




I don't think they've finished writing the paper yet but I'll post it out there when it gets published.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: