Without such built-in functions like application or arithmetic this is impossible in every language. Consider: without application you cannot consider such a l

Without 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.