rml, 1 year ago to random

wow, the #Chez #Scheme implementation of the #Shen #Prolog logic programming system[1] performs 4x faster than the #SBCL #Lisp implementation[2].

It seems like Mark Tarver, the author of Shen who reported these results, authored both implementations.

[1] https://shen-language.github.io/
[2] https://groups.google.com/g/chez-scheme/c/vTyTn_yh9vg/m/D8t-jooBGAAJ

rml, 1 year ago to random

That #SBCL's assembler can be extended at runtime is such a flex tbh

dekkzz76, 1 year ago to random

OK Lispers is GNU Clisp any better or worse than any other #lisp implementation ?

rml, 1 year ago to random

"I tried #SBCL, and something I noticed was that for any simple function, #lisp takes a moment to compile, which isn't acceptable for a #shell"

• Ilya Sher, author of #NGS ("next generation shell") on #InferencePodcast

Is this really the case?? Doesn't sound right at all.

#Guile and #Chez both feel faster than #bash, for example.

https://www.youtube.com/watch?v=dCbTw9UOuS8

schnouki, 1 year ago to random

TIL: every run of #SBCL has the same initial *random-state*, so sequences of pseudo-random numbers are not so random. The solution is super simple: (setf *random-state* (make-random-state t)).
It makes sense considering what a #Lisp image is... but it's still pretty surprising compared to other programming languages. (And doesn't happen in #ECL or #clisp 😅)

#CommonLisp