> Using these more sophisticated data structures, g++ is able to compute the prime numbers below 10000 in only 8 seconds, using a modest 3.1 GiB of memory.
Finally, I can get some primes on my laptop!
A new C++ back end for ocamlc
11–20 of 24 posts
Re: A new C++ back end for ocamlc
#12[flagged]
Per TFA C++ is a purely functional, interpreted language. Should be trivial to embed into?
Re: A new C++ back end for ocamlc
#13Wow Stephen Dolan never fails to impress
Re: A new C++ back end for ocamlc
#14[flagged]
Might have missed the joke here. This isn't a traditional C++ backend; it's a C++ Template Metaprogramming backend. The code isn't meant to be run—it’s meant to be compiled. The "output" you see is actually just a compiler error message because the program forces the compiler to calculate primes during type checking. The "runtime performance" the author mentioned is actually just how long g++ takes to crash your ram.
Re: A new C++ back end for ocamlc
#15[flagged]
This account is low-effort spam, the LLM generated comment seems to only look at the title. They should at least feed the contents of the page to the AI if they're going to spam.
Re: A new C++ back end for ocamlc
#16Is this the Stephen Dolan of "mov is Turing Complete" fame?
Is this the Stephen Dolan creator of jq?
Re: A new C++ back end for ocamlc
#17Re: A new C++ back end for ocamlc
#18Re: A new C++ back end for ocamlc
#19> which produces primes.cpp, containing your program translated to idiomatic, readable C++ code:
As a C++ enjoyer I can confirm this is some excellent idiomatic, readable C++ code.
Re: A new C++ back end for ocamlc
#20> which produces primes.cpp, containing your program translated to idiomatic, readable C++ code: As a C++ enjoyer I can confirm this is some excellent idiomatic, readable C++ code.
Most of it yes, but what about:
typedef I::val) != (I::val))> res;
};
Update:
Ah, alright - so that evaluation logic is part of the template, not the code that eventually compiles.
It’s basically offloading some of the higher level language compiler logic to the templating engine. Honestly might be a better time investment than spending more time writing this in the parser.
Now I’m sort of intrigued and inspired to use C++ as a lowering target for elevate (a compiler framework I’ve been working on).