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

The point of tree calculus as I understand is that all programs are valid data structures, so they can be modified and analyzed during runtime with nothing but other programs.


That is also true of Lisp. And Forth. And a dozen other homoiconic languages.


Any Turing-complete language should be able to express programs that do this.




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

Search: