Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
casey2
9 months ago
|
parent
|
context
|
favorite
| on:
Tree Calculus
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.
adastra22
9 months ago
[–]
That is also true of Lisp. And Forth. And a dozen other homoiconic languages.
fmoralesc
9 months ago
|
parent
[–]
Any Turing-complete language should be able to express programs that do this.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: