cwzwarich

10 ms·

91.
by cwzwarich 4y ago
Rosetta does support executing 32-but code in alternate code segments created in a 64-bit process, used by CodeWeavers’ Crossover: https://www.codeweavers.com/blog/jwhite/2020/11/18/okay-im-o...
92.
by cwzwarich 4y ago
To be fair to people using 'a/'b-type variables: 1) They are used pervasively in the standard library and its documentation. 2) Due to lifetime subtyping and implicit bounds, descriptive names may be inaccurate. For example,
93.
by cwzwarich 4y ago
The closest thing to Swift’s approach to polymorphism in the academic world is intensional polymorphism: https://www.cs.cmu.edu/~rwh/papers/intensional/popl95.pdf
94.
by cwzwarich 4y ago
Number of distinct mnemonics doesn't really determine ISA complexity. As an extreme example, how many AArch64/RISC-V instructions are there corresponding to an x86 MOV?
95.
by cwzwarich 4y ago
It's pretty sad that C/C++ finally accepted that arithmetic on contemporary computers is twos-complement but kept UB on signed overflow to ensure that compilers can continue to optimize loops with signed indices. If everyone used
96.
by cwzwarich 4y ago
I am the creator / main author of Rosetta 2. I don't have a blog or a Twitter (beyond lurking).
97.
by cwzwarich 4y ago
You could say the same thing for any abstract mathematical construct, e.g. metric spaces. There's no theorem (that's not itself about metric spaces) that can only be proven using metric spaces. It's always possible to make ne
98.
by cwzwarich 4y ago
Which of the results mentioned in the article are proven by applying some result of category theory to another field, and which are just stated using category theory (with the real mathematical insight lying elsewhere)?
99.
by cwzwarich 4y ago
I used to be a religious devotee to Lisp, but then I started programming for a living and realized that static type systems (even of the simplest variety) are so helpful for preventing bugs. Unfortunately, I never found a typed variant of L
100.
by cwzwarich 4y ago
> The way a function is declares looks just like a variable assignment for instance, but in a compiled language it pushes the wrong paradigm on me, since that's pretty much immutable. I think one of the problems with the syntax is t
101.
by cwzwarich 4y ago
> We're often told that Rust is hard because the underlying problem is hard, but I've encountered many cases where that's not true, it really is just the borrow checker. And unfortunately, most of them are problems that Po
102.
by cwzwarich 4y ago
This phenomenon is actually another example of the phenomenon he mentions. In strict precedence parsing, operators are assigned meaning rather than productions of a grammar (which would could those operators in distinct contexts), so once y
103.
by cwzwarich 4y ago
Facebook Infer is now just an ordinary unsound static analysis tool where some of the original analyses are inspired by separation logic. It doesn't actually prove any facts about the program being analyzed using separation logic.
104.
by cwzwarich 4y ago
You're reusing some components from rust-analyzer, so is there any reason you didn't go with a more query-based/demand-driven architecture, e.g. by also using salsa?
105.
by cwzwarich 4y ago
> it's encouraging to me that Rust's semantics allow borrow checking to keep getting better without breaking changes Just to be clear, these are breaking changes. If the new borrow checker didn’t break existing code, they would
106.
by cwzwarich 4y ago
From https://support.apple.com/en-us/HT208909 : The True Tone technology in Mac computers, Studio Display, and Apple Pro Display XDR uses advanced multichannel sensors to adjust the color and intensity of your display a
107.
by cwzwarich 4y ago
One of the most well known is Igalia: https://www.igalia.com
108.
by cwzwarich 4y ago
> 2. Contention is resolved by adding the blocked thread into a wait queue. The queue is allocated/discovered via a global hash table, keyed by the address of the mutex. The mutex keeps a stable address while locked, as the lock hol
109.
by cwzwarich 4y ago
What’s an example?
110.
by cwzwarich 4y ago
Unless they've made a recent radical change, data races on multiword values (e.g. interfaces and slices) are unsafe in Go. In other GC languages (e.g. Java and C#), data races don't compromise memory safety, but Go made different
111.
by cwzwarich 4y ago
> So it’s not statically memory-safe. That’s not hugely attractive I have to say. Ref-counting with mutable data (which this seems to be replacing?) works the same way in Rust. You need to take an Rc/Arc of RefCell, and calling borr
112.
by cwzwarich 4y ago
> So it's not too much of a mark against Rust that it doesn't have proper documentation for those aspects either. There is obviously the benefit that this generally only affects unsafe code (as opposed to C/C++ where the s
113.
by cwzwarich 4y ago
> first-in-first-out rules in Sweden I don't know anything about Swedish labor law, but wouldn't it be LIFO rather than FIFO?
114.
by cwzwarich 4y ago
> What I find funny is that Pratt's parser was never really a theoretical result and was never properly covered in popular compiler textbook. The theory behind precedence parsing was studied a decade earlier by Floyd (who is cited i
115.
by cwzwarich 4y ago
> My brother is a pharmacist, and is constantly shocked by the prescriptions that healthy people bring in to get filled. While I definitely agree with your general point, how does your brother know that they’re healthy or don’t need to t
116.
by cwzwarich 4y ago
> Rust's popularity is certainly helping that, though I wish they hadn't repurposed the existing word "enum" to serve as a new synonym for a concept with an existing name ("algebraic data types"). What keywo
117.
by cwzwarich 4y ago
That doesn’t stop “Google engineer says…”
118.
by cwzwarich 5y ago
Here’s a paper describing a simulator that worked by similar means: https://dl.acm.org/doi/10.1145/384265.291063 It’ll help, but still won’t get you down to the 10-20x cycle overhead range that you need to claim s
119.
by cwzwarich 5y ago
It’s probably not even possible to emulate the Pentium Pro (or any other out-of-order x86 CPU) in a cycle-accurate fashion at the original speeds on contemporary hardware. Just attempting to match the original behavior for instruction sched
120.
by cwzwarich 5y ago
> I remember wanting to ask a rabbinical scholar if the product would count as unleavened bread. It would (almost certainly) count as leavened bread. Jewish law defines chametz (leavened bread) as a combination of one of five species of

More ›