sorry what ? where does this meme comes from ? Most CL implementations are at best multiple times slower than your average JITted language
sorry what ? where does this meme comes from ? Most CL implementations are at best multiple times slower than your average JITted language
http://factor-language.blogspot.com/2010/05/comparing-factor...
All four languages have improved over the last 8 years, but you can see SBCL and LuaJIT are in the same ball park, each winning on some tests. My recollection is that SBCL usually "wins" in the number heavy tests like Mandelbrot, but I don't have time to dig up the links.
https://old.reddit.com/r/programming/comments/6eg0x/where_ar...
> the inner loop of mandelbrot is now identical (at the ucode IR level) to the IR generated by a C compiler. All type checks have been eliminated and only the pure (statically typed) FP adds/multiplies are left (the remaining task is to transform the ucode to the best possible machine code -- working on it). Similar results can be obtained for other numeric loops.
^ This is from a ten-year-old post about LuaJIT optimizations.
Regardless, though, I think it’s clear that there are already fast Lisps.
I might try again with a different program.
Maybe you could post some links to benchmarks that demonstrate your claim.
(I recognize this is unscientific and anecdotal, but I'm just trying to point out that it would take significant evidence to convince me SBCL is faster than Luajit, because my experience is the opposite.)