Re: SBCL is now faster than Java, as fast as Ocaml, and getting

On Jul 15, 6:41=A0am, Mark Wooding <m...@[EMAIL PROTECTED]
> wrote:
> The non-tail-recursive factorial will blow the stack in more or less any
> language implementation. =A0(Yes, I did test it with OCaml, specifically
> version 3.10.2.) =A0Stupid techniques fail in most languages.

Perhaps this is slightly OT, but I hope someone targets LLVM with a CL
implementationl.  Check out http://llvm.org/demo/
, where the LLVM (a
general purpose compiler back end) optimizer converts naive recursive
factorial into a loop.  I saw some abstract interpretation techniques
to do this years ago, but did not expect to see a general purpose back
end (mostly for imperative languages) actually implement it...