"I prefer a lack of magic for my programming [production systems]" the dev says while they write in a language for a compiler they don't understand, with algorithms in the standard library they couldn't implement, performing processor specific optimiza...
-
samir, mad idea generatorreplied to Hrefna (DHC) last edited by
@hrefna Oh, I love this observation.
I’ve been very guilty of protesting against “magic” in the past. On reflection, I think what I’m wary of is leaky abstractions. I want to be able to reason about my code/software, and I’m fine with magic as long as it doesn’t interfere with the reasoning.
So thank you for making me dig into this.
-
-
samir, mad idea generatorreplied to Gerbrand van Dieyen last edited by
-
Spectre and malloc are both great examples.
Really at some point you just accept that everything you are writing is pseudocode that mostly runs in a way that approximates what you expect and is _good enough_. Most of the time.
Until it isn't.
-
You also don't have to scratch very hard in compiler optimizations either before you start running into it causing actual real problems or unpredictable behavior in production code.
Not even in a JIT either. In a standard AOT compiler.
That's without getting into Tomasulo's algorithm or how modern branch predictors work.
-
It is all a rube Goldberg device.
-
@hrefna i like my footguns to stare at me in the face, not be an abstract concept that is nondeterministic
-
@dontony Cool, enjoy programming on paper with pi calculus.
-
@hrefna i mean idk about them but i just understand all that stuff there's no magic to me sounds like a knowledge issue ig
-
@lunch Is your name Dunning-Kruger?
-
@Structuralist worse, because a good half or more of the complexity is necessary complexity.
Rube Goldberg devices you can simplify and get the same output. The ball can still be moved.
No such luxuries here, where most of these things exist for a reason. This is less Rube Goldberg and more Chesterton's Fence.
-
Alexandra Magin 🏳️🌈replied to Hrefna (DHC) last edited by
@hrefna I like all the reasonably durable abstractions we can manage, but with a bias towards ones we can prove some things about
Although on some level things like this I consider a challenge
Like maybe I should learn all about Infiniband, just because
-
@hrefna You may be interested in reading this Turing Award acceptance essay by Ken Thompson, published in the Communications of the ACM in August, 1984:
Reflections on Trusting Trust
https://www.cs.cmu.edu/~rdriley/487/papers/Thompson_1984_ReflectionsonTrustingTrust.pdf
