4 ms·
$ and + are built-in functions being used with infix syntax.
by Zak 17y ago
$ and + are built-in functions being used with infix syntax.
- Locke1689 17y agoWithout such built-in functions like application or arithmetic this is impossible in every language. Consider: without application you cannot consider such a language general recursive and therefore it is not Turing complete according to the Church-Turing thesis.
- Zak 17y agoHence my claim about the near-impossibility of the task.