mrkeen

3 ms·

1.
by mrkeen 6d ago
Game programmers have long been the producers of the most impressive applied computer science. The film Shrek 3 (2007) took 20 million CPU hours of render time. Games push 60 frames a second. For a visual comparison, check Call of Duty wo
2.
by mrkeen 6d ago
An immutable object is a special kind of mutated object, which when mutated does what exactly?
3.
by mrkeen 8d ago
To clarify, It looks like Haskell got better string types around 20 years ago.
4.
by mrkeen 9d ago
For a longer read: https://justinas.org/the-bizarre-world-of-v
5.
by mrkeen 10d ago
No, the sum of the first ten natural numbers is always 55. It is not "initialised" to some other number beforehand.
6.
by mrkeen 10d ago
Nah. It involves multiple passes and setting the answer to the wrong value before (hopefully) setting it to the right value. Plus it forces you out of whatever lazy/streaming paradigm you had going on. If your foldr produces a list,
7.
by mrkeen 10d ago
It's pairwise, not global reasoning.
8.
by mrkeen 11d ago
I don't think I can recall a time where I routed-around-the-damage on the basis of a particular typed exception. As soon as you consider retrying a network failure, you immediately need to start thinking about distributed systems failu
9.
by mrkeen 11d ago
The standard library writers can go first.
10.
by mrkeen 13d ago
Same rationale as flow valuing. Some people like values being reassigned, and some people like types being reassigned. You might be reading too much into the union example. The checker just doesn't know if the middle block ran, so ma
11.
by mrkeen 14d ago
Yep, this sounds like conflating two different ideas about SSA. You could parse a source language with shadowed variables into an AST, and then one of your earliest AST transforms could be a 'de-shadowing' pass. The resulting AST
12.
by mrkeen 14d ago
Ok. More thoughts. I was trying to see what was special about Crystal in this regard. It seems like if you took any ML or Haskell-like, you'd have type inference. Then you could allow shadowing (Rust-style) meaning the same symbol in t
13.
by mrkeen 14d ago
No. Type systems are unrelated to abstract machines which are unrelated to usability. Type inference/checking happens early in the pipeline. SSA is a way of laying out assembly instructions for an abstract machine. I say abstract bec
14.
by mrkeen 14d ago
The solution to this is assume an async spine to your program, and branch off to as much sync code as possible. It's the same lesson you learn wrangling the IO monad in Haskell, or dependencies (like databases) in OO-land.
15.
by mrkeen 14d ago
I started reading from the first sentence
16.
by mrkeen 14d ago
He won. The only thing sinking him is a term limit.
17.
by mrkeen 14d ago
Like I said, I got curious to see what they've been up to. Links would have been better.
18.
by mrkeen 15d ago
It got me curious, so I took a look at what Iran has been up to. https://www.aljazeera.com/news/2026/1/13/a-timeline-of-crise... It doesn't look like foreign conquest is part of their MO.
19.
by mrkeen 16d ago
> If only 2 years ago somebody said GitHub would be no longer relevant soon, nobody would believe them. GitHub was the undisputed leader in repository hosting [..] > GitHub has done too many great things over the years, so I hope it r
20.
by mrkeen 17d ago
And by my work, you are of course talking about Harry Potter.
21.
by mrkeen 17d ago
Good for them. They can sell not-your-work, and you can sell your work.
22.
by mrkeen 17d ago
What's the most generous, charitable definition of an alternative?
23.
by mrkeen 18d ago
Found another one: https://www.cs.columbia.edu/~sedwards/classes/2021/4115-fall... https://github.com/kkysen/cstar And to sibling comments: I care. Non-mainstream languages are talkin
24.
by mrkeen 20d ago
I'm not a C++er, but I sorely miss this is nearly every non-Haskell language. I have a type capable of some behavior, e.g ToString. I also want to write general code operating on such objects (highlighting, obfuscating passwords, esca
25.
by mrkeen 20d ago
It's evidence of bad abstraction if you need everyone else to make changes and couple themselves directly to you. If for some reason your services can't speak an already common language, I think it's on you to add those shims
26.
by mrkeen 21d ago
C already has vel and aut operators, but now we can name them as such!
27.
by mrkeen 22d ago
The article shows how to have a fixed array of maybe-null orders. It doesn't show how to place, cancel, or execute an order. It's even worse than just leaving this core functionality as an exercise for the reader. Because the f
28.
by mrkeen 23d ago
> TigerStyle: All memory must be statically allocated at startup. No memory may be dynamically allocated (or freed and reallocated) after initialization. This avoids unpredictable behavior that can significantly affect performance, and a
29.
by mrkeen 26d ago
Well did you learn proper computer science or did you learn plain wrong computer science?
30.
by mrkeen 26d ago
Don't forget to define OOP before requiring it!

More ›