Hacker News Reader

tbh I wish something like BEAM's processes would get implemented. I know there's a Lisp for BEAM (https://lfe.io/) but having that in SBCL would be a game changer.

Anyway, it's impressive how fast SBCL can be given the amount of developer time/money it receives compared to Java, etc.

View on HN

Coroutines, and generators more specifically, will be in my opinion the basis for asynchronous programming a la Rust.

BEAM style concurrency requires preemptive scheduling which I don’t see happening. It requires a rewrite from the ground up.

Does SBCL have a borrow checker?

To the extent that things are immutable and side-effect free, then it’d be data race free like Rust, but how does it handle code that needs to mutate state?

The lifetime borrow checker is a paradigm specific to Rust and is the only language to use it to my knowledge.

Just for the perspective, Rust is 9 years old, SBCL 25 years old and the first implementation of Lisp is 64 years old

It has data races. Why would SBCL have a borrow checker?

Ideally, some lisp would have one (or hopefully something simpler/more ergonomic) to eliminate data races, like the rust one does.

The rust borrow checker also eliminates memory allocation bugs, but that’s less interesting to me.

Carp ?

https://github.com/carp-lang/Carp

Reply on news.ycombinator.com