Discussion
Loading...

Discussion

  • About
  • Code of conduct
  • Privacy
  • About Bonfire
Demi Marie Obenour
@alwayscurious@infosec.exchange  ·  activity timestamp 14 hours ago

@simon_brooke @vashti Only if it doesn’t also need to be fast.

  • Copy link
  • Flag this post
  • Block
Simon Brooke
@simon_brooke@mastodon.scot replied  ·  activity timestamp 13 hours ago

@alwayscurious @vashti define fast. I can compute the factorial of 1,000 in under one millisecond on an ordinary laptop in several different #Lisp dialects, without optimisation.

Is that not fast enough for you?

https://gist.github.com/simon-brooke/fcb59705950c5ad515e18fba065510ae

  • Copy link
  • Flag this comment
  • Block
Simon Brooke
@simon_brooke@mastodon.scot replied  ·  activity timestamp 11 hours ago

@alwayscurious @vashti however, I'm grateful to you for raising that issue, because it prompted me to find out how fast it would run in Portable Standard #Lisp, so I've spent a happy couple of hours trying to debug bootstrapping problems in Blake McBride's version of the PSL compiler. I don't have it working yet, but I have made progress. Will it be faster than SBCL? Don't know, but I suspect so.

https://github.com/blakemcbride/PSL

GitHub

GitHub - blakemcbride/PSL: Portable Standard Lisp

Portable Standard Lisp. Contribute to blakemcbride/PSL development by creating an account on GitHub.
  • Copy link
  • Flag this comment
  • Block
Log in

Bonfire community

This is a bonfire demo instance for testing purposes

btfree.social: About · Code of conduct · Privacy ·
Bonfire community · 1.0.0 no JS en
Automatic federation enabled
  • Explore
  • About
  • Public Groups
  • Code of Conduct
Home
Login