norir

7 ms·

1.
by norir 22d ago
Comments like this just further my bias against analytic philosophy as a system that helps illuminate the path to human flourishing and truth.
2.
by norir 24d ago
As someone who has written a jit compiler, I am puzzled by the claim that jitting requires write/execute permissions. When I have written a jit, I loaded some memory with read/write permissions using mmap. Once I filled in the gen
3.
by norir 25d ago
This reads as rather dismissive and not so humble. Compilers generating suboptimal and sometimes broken code very slowly is the norm, not the exception. Whether or not it's worth worrying about is indeed a development tradeoff but not
4.
by norir 1mo ago
It is simple to convert factorial to tail recursive form. In lua, which has tco: local factorial do local function impl(n, acc) if n == 1 then return acc else return impl(n - 1, acc * n)
5.
by norir 2mo ago
I would suggest adding objective metrics. How fast is this compiler? How long is the longest fuse program? How long does it take to compile? How fast at runtime is the fuse implementation of several benchmark programs compared to semantical
6.
by norir 2mo ago
If you need better performance than a higher level language affords you, I would not recommend programming directly in asm. Instead, I would write a compiler. Raw asm is seductive since the start up cost is relatively low. You can get start
7.
by norir 2mo ago
I agree with your diagnosis but not entirely the solution. I think fixed sized integers in general are a non portable mistake in a language high level language. Instead, a language should provide arbitrary numeric range types and infer the
8.
by norir 2mo ago
This piece would have been a lot more compelling if they had actually done science on selecting a language for compiler development. From what I can tell, they had an untested hypothesis that a low level systems language is necessary for a
9.
by norir 2mo ago
This infrastructure is also slow and leads to poor compilation times for any language that uses llvm as a backend. In an era of automatic code generation, this will become more and more of a problem as llvm compilation times will become a h
10.
by norir 2mo ago
This feels like it should have been a warning rather than an optimization in the first place. In my opinion, dead code elimination should only be done during link time optimization where it can be proven that branches are not taken given th
11.
by norir 3mo ago
Perhaps then it would be better to not use tools of this level of complexity.
12.
by norir 3mo ago
I am actively opposed to this design for a first compiler. There is no need for a lexer with a recursive descent parser. Register allocation is also an unnecessary distraction. It is better for a first compiler to compile to a higher level
13.
by norir 3mo ago
Terry Tao is a next level vibe coder: he inspires people to do his vibe coding for him. As someone with a background in advanced math, though never even close to Tao's level, I find myself skeptical about this type of mathematics. I do
14.
by norir 3mo ago
I think the people with extreme positions are often the most useful because they get closer to the source of the argument. Extreme boosters of ai often want to either bypass developing skills to advance their careers or want to exploit what
15.
by norir 4mo ago
> We could start off with how are you worse off because of people wealthier than you? You are smart enough to come up with some answers of your own. It's rude to demand others to do your own thinking for you.
16.
by norir 4mo ago
It is hard for me to fully trust a compiler backend that isn't self hosted. There is a discipline that self hosting imposes that would both improve the quality of their ir as well as the backend itself. A self hosted backend can always
17.
by norir 4mo ago
When using null terminated strings, parsing can be branchless because you don't need bounds checks and can use a jump table indexed by the byte.
18.
by norir 4mo ago
This is not a hard thing to do without using a library. The code below is easily adapted to the unsigned case and/or arbitrary base rather than 10. #include <stdio.h> int main(int argc, char **argv) { if (argc !
19.
by norir 5mo ago
The product and the process are not orthogonal.
20.
by norir 5mo ago
This is true, which means that a language has to be designed from the ground up to deal with these problems or there will always be inscrutable bugs due to misuse of arithmetic results. A simple example in a c-like language would be that th
21.
by norir 5mo ago
In my reading, what Stroustroup is saying is that given other problems in c/c++, that singed sizes are less bad than unsigned but both have clear and significant deficiencies. A new language doesn't have to inherit all of these de
22.
by norir 5mo ago
I also expect that most side projects that are made with ai end up abandoned within 3 months and contribute next to nothing to the user's personal development and that the use of ai prevented them from the kind of deliberate practice t
23.
by norir 5mo ago
This highly depends on the language and your skill as a compiler writer. You can write a single pass assembler that generates great code but you have to of course write the low level code yourself (including manual register assignment). To
24.
by norir 6mo ago
You don't need a repl for this workflow and it can be easily implemented in any language. `ls *.MY_LANG | entr -c run.sh` You get feedback whenever you save the file. Personally, I find waiting more than 200ms unacceptable and really &
25.
by norir 6mo ago
It is easily possible to parse at > 1MM lines per second with a well designed grammar and handwritten parser. If I'm editing a file with 100k+ lines, I likely have much bigger problems than the need for incremental parsing.
26.
by norir 6mo ago
> I recognize that it is reminiscent of a few decades ago when old timers complained about the proliferation of high level programming languages and insisted they would lead to a generation of programmers lacking a proper understanding o
27.
by norir 6mo ago
> In the meantime, there's nothing stopping you from using the agent to write the code that is every bit as high quality as if you sat down and typed it in yourself. You can only speak for yourself.
28.
by norir 7mo ago
If you have well defined boundaries, you can move the stack to an arbitrarily large chunk of memory before the recursive call and restore it to the system stack upon completion.
29.
by norir 7mo ago
I have a personal aversion to defer as a language feature. Some of this is aesthetic. I prefer code to be linear, which is to say that instructions appear in the order that they are evaluated. Further, the presence of defer almost always im
30.
by norir 7mo ago
I personally would prefer to hear more about what is uniquely good about Odin semantically or syntactically than more ad hominem attacks on the intelligence of the critics of the language, which I have seen in multiple recent pieces by this

More ›