That is pretty messed up 🤯
So if you go sail around the world you better be back under 3 years?

In all seriousness, I don't know anything about boat VAT in the EU and I understand it might be messed up even if you don't own/plan on owning one 🤔

Why do you care about VAT on boats if you don't have any? 😅

Is that... one of the rare use cases for a bloom filter? 🤔

Maybe you could have a go to definition for the impl function itself go to the class definition? 🤔 So from any use site you're one hop away from 2) and two hops away from 1)

I'm pretty sure there will always be something more useful to spend the energy on, even if highly inefficient, like desalination 🤔

With Nat you can encode constraints without extra comparison support:

head :: Vec (n + 1) a -> a

But if you support comparison constraints I think this is nicer to use in practice anyway:

head :: (1 <= n) => Vec n a -> a

Is that because for B you could take a reference to b.1 and the layout has to match (u8, u16)? 🤔

Careers We are always looking for brilliant minds to join our team. If you have experience in Computer Science, Maths, or ML, we’d love to hear from you!

You could learn Haskell while employed: myrtle.ai/about/careers/ 😄
We use Rust, Haskell, nix (and Python, Verilog, ...) for compilers and customs FPGA circuits

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 😊