3 ms·
It's not that bad. "All" we have to do is implement everything in Lisp, since Lisp can be reduced trivially to the lambda calculus. Once again, Lisp saves the
by chimeracoder 14y ago
It's not that bad. "All" we have to do is implement everything in Lisp, since Lisp can be reduced trivially to the lambda calculus.
Once again, Lisp saves the day! ;)
EDIT: I'm totally looking forward to experienced Lisp and Haskell programmers like me being in high demand for their legendary skills... at invalidating patents!
- PENLAND365 14y agoThis brought lulz. Thanks.
- deleted 14y ago[deleted]
- dinkumthinkum 14y agoWell if you wrote a program in any Turing complete programming language, you would be done; how "trivial" it is doesn't matter. :)
- greyfade 14y agoIndeed. 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.