6 ms·

This doesn't strike me as particularly interesting. CL is just a programming language, a functional assembly so iit seems intuitive that it would be infeasible

This doesn't strike me as particularly interesting. CL is just a programming language, a functional assembly so iit seems intuitive that it would be infeasible to cache all computations. Even just caching all programs up to a given size is a big issue because the number grows exponentially with the size of the program, so even if you could cache all programs of a given size it wouldn't neccesarily help to solve (reduce) larger programs very much. It would be like trying to write a compiler with a peephole optimization for every form of the language, you just end up with a large, slow compiler. Still it makes me want to write an SKI interpreter.

p4bl0 15y ago
> Still it makes me want to write an SKI interpreter. See unlambda at http://en.wikipedia.org/wiki/Unlambda http://en.wikipedia.org/wiki/Unlambda.
- Sniffnoy 15y ago
  Bah, Unlambda is clearly artificial. You want something that is ridiculous in a natural way, you use Iota: http://en.wikipedia.org/wiki/Iota_and_Jot http://en.wikipedia.org/wiki/Iota_and_Jot
JadeNB 15y ago
> Still it makes me want to write an SKI interpreter. How about in Perl-style regexes? http://www.perlmonks.org/?node_id=809842 http://www.perlmonks.org/?node_id=809842