Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

The evaluator is the interesting part, of course. How do you stop it from getting stuck evaluating functions like this?

    def f():
        f()
If you can do general recursion, you can do infinite loops. If you can't do general recursion, I'm not sure the language will be very useful.


No, you can't do general recursion on the evaluator alone. But it would be possible to run any general recursive function across both parts, for example if you wanted to run software not designed for this architecture. The problem with this is that optimizations would only happen on per expression basis, so it wouldn't make very good use of the architecture.




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

Search: