Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
finiteparadox
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
finiteparadox
1y ago
I think you are missing the point a bit. With staging you can build up arbitrary levels of compile time abstractions and be sure that they will not appear in the final executable. Of course, an optimising compiler will reorder/rearrang
2.
▲
by
finiteparadox
1y ago
The point is that compiler optimisations are a black box and not guaranteed. They can be very brittle wrt to seemingly harmless source changes (even something as simple as making an extra intermediate assignment). You are at the mercy of th
3.
▲
by
finiteparadox
1y ago
This sort of flow works well for me with obsidian+paperpile+latex
4.
▲
by
finiteparadox
2y ago
A combination of staging and effects might be a candidate. Any other candidate will probably be staging + X. https://se.cs.uni-tuebingen.de/publications/schuster19zero.p...
5.
▲
by
finiteparadox
4y ago
If tree is a category, does it have limits?
6.
▲
by
finiteparadox
4y ago
Incredible, one would expect this to be theoretically possible since Typescript's type system is Turing complete, but it is certainly different to see it done in practice. Wow!
7.
▲
by
finiteparadox
6y ago
This is just plain wrong. There's nothing you can do in C/C++ (or C+, as you put it) that you can't in rust, when it comes to parallelism. There's always unsafe if you really need it.