4 ms·
Indeed. By the Church-Turing Thesis, any program written for any Turing Machine (including any Turing-complete language) can be translated into the lambda calcu
by greyfade 14y ago
Indeed. By the Church-Turing Thesis, any program written for any Turing Machine (including any Turing-complete language) can be translated into the lambda calculus through a rote transformation.