Re: Is Rust the culprit? (Was: What about the Holy Grail?)

Most likely Rust has not high performance computing
on its mind. This here looks horrible, and is the
same nightmare as in Go:
https://jondot.medium.com/errors-in-rust-a-formula-1e3e9a37d207
I would never port or realize a Prolog system on a
programming language and runtime, that doesn't offer
clever and efficient exception handling.
You don't get clever and efficient exception handling if you
shuffel around tuples. Althoug some of recent nodeJS
async programming had a similar flavor.
But still JavaScript has solid exception handling,
and so does Java and Python.
Mild Shock schrieb:

If Rust is the culprit, I guess it isn't
due to this speculation:
 Imagine Rust failed, why did it fail?
https://www.reddit.com/r/rust/comments/c93upr/imagine_rust_failed_why_did_it_fail/   "climate change causes massively increased methane
offgassing in the Arctic, causing a runaway greenhouse
effect that eventually turns Earth into Venus,
destroying the biosphere before rust
can gain widespread adoption"
 There are other signs that Rust is a failure, like here:
 Why Rust is Making You Fail. --> 1.1k Claps
https://medium.com/@ChadJohnsonOfficial/why-rust-is-stopping-your-success-use-c-and-c-instead-586dc7e2edbc   And here:
 Should we call Rust a failed programming language? --> 10.5 views
https://www.quora.com/Should-we-call-Rust-a-failed-programming-language
 Mild Shock schrieb:

Maybe Scryer Prolog is a failure, because Rust
is a failure. Building Scryer Prolog on my machine,
after a git pull of a small change, did just
>
take this much time:
>
$ time cargo build --release
[...]
real    6m52.663s
user    7m39.043s
sys     0m3.241s
>
What did Rust do? And this tabling test case,
2000 shuttle, hangs:
>
/* Scryer Prolog 0.9.4-107 */
?- use_module(library(tabling)).
    true.
?- [user].
:- table c/1.
c(X) :- c(Y), 0 =< Y, Y < 20000, X is -Y-1.
c(X) :- c(Y), -20000 < Y, Y =< 0, X is -Y+1.
c(0).
>
?- time(c(_)).
%%% hangs ? %%%
>
It is solved in a blink in SWI-Prolog:
>
/* SWI-Prolog 9.3.8 */
?- time(c(_)).
% 540,077 inferences, 0.047 CPU in 0.051 seconds (92% CPU, 11521643 Lips)
true .
>
The test case is from here:
>
https://github.com/JanWielemaker/tabling_benchmarks/tree/master