Perl: the Markov chain saw | |
PerlMonks |
Re: (FoxUni) Re: Nested data structures... nasty?by Anonymous Monk |
on May 29, 2002 at 00:03 UTC ( [id://169938]=note: print w/replies, xml ) | Need Help?? |
Common Lisp has had those kind of optimizations for ages. You tell it what your variables hold, and how much effort it should spend compiling for speed, and it figures out the rest. The only catch is that it still does garbage collection. For a real example of Common Lisp used in a high-performance situation, read this description of how Orbitz works.
In Section
Meditations
|
|