Basile Henry

So maybe we should be vibe coding in C to be consistent in our use of UB throughout the abstractions 😅

Probably a rhetorical "what" 🤔

It basically says that `[a]` is equivalent to a function `Int -> a`.

It's effectively the indexing function. If you want to set a value in the "array", you create a new function that checks if the input is the index you're setting and use the old function otherwise.

Lots of GADTs when writing Clash Haskell 😭

clash-lang.org

"Linux in the Kernel" 👀 How dare they! 😅

That is a pretty bad error message 😅 I assumed the Generic instance was a given and was already reaching for orphan instances to explain the lack of import
bsky.app/profile/basi...

Maybe you're also supposed to derive Generic for that type in the shame module (so it's not an orphan instance), and that would force you to add the import 🤔

Ouch 😬 That would make sense to me for TemplateHaskell generated code, but for this type of instance deriving/default impl it feels like the extension should manage its own imports 😅

M1 not in scope is weird 🤔 missing a language extension?

I don't know how much AI they ended up using, but watching some of their dev talks a while ago they had some really impressive procedural generation using advanced ML techniques (i.e. AI), it really didn't strike me (at that time) like the plagiarism machine you hear about in more recent game dev 🤷‍♂️

Nice example! 😊

I mean yeah theoretically 😅 It's a practical approach, and I'm struggling to find ways to exploit it to create a function that would do radically different things for different types 🤔
There might be some tricks where you detect the type using broken `==` for NaN, but that's also the case in Haskell

I think it might depend if you have "magic" (no constraints) type classes à la Elm for things like `==`, `+`, or `>=` 🤔

That's probably the most reliable method (especially since the source path could be generated from nix)!
I guess I'm not trusting my AI enough to do the run build step for me yet 😅

That's much better! 😊 What's the workflow like? Does it get the hash locally?

It'd be impressive if AI could guess the hashes 😅

Maybe the lock file could keep the previous version info 🤔 Then for this specific issue, I don't think you need a full compilation of the previous version, only a way to track the impls back to the previous version (if they exist)

It feels like the type of issue that could be fixed automatically (annotate using the impl pre-upgrade) 🤔

How else would you know that the bread is Not a a Number 😅

O(n^2) for a naive compiler, O(1) for a decent compiler even with non-const n. With that inner loop's body, a good compiler could rewrite the snippet:
total = n*n
Although this assumes `n` is positive and has to consider `total`'s overflow semantics, which may not be reasonable in some languages 😅

Now we need a language where escaping a newline character is an alternative way to input the 'n' character 😈

Wordle 1,421 3/6

⬜⬜🟩🟨🟨
⬜⬜⬜🟩🟨
🟩🟩🟩🟩🟩

Got lucky with my 2 starting words 😊

Maybe you're supposed to do a Copenhagen style left turn 🤔

I think it's mostly cursed 😅
NamedFieldPuns is the more practical option in my opinion

Make invalid states representable!

Thanks for the blog post! It is difficult to find nuance nowadays, so your insight and knowledge is both welcome and valuable 😊

Does GHC actually care about the location of the file? Isn't it a restriction of cabal that they need to match?

Often modern vinyls come with a code to download the mp3s, so if you buy the vinyl first you don't need to buy the mp3s 😄

For that kind of money you could get a $55,000 wedding every single day for 30 years 😅

Is that to avoid orphan rule related issues? 🤔
What's the solution then to avoid competing interface function definitions that are in scope? Or worse, different definitions available in different scopes that a value moves between (e.g HashSet and different hash functions)?