Oh snap. Nerd stuff here with @GabriellaG439 (of #Haskell and #Nix fame) on the Impure Pics @impurepics channel, where she talks about #Grace, which looks like a web-based functional language (I just started the video and got excited)
Oh snap. Nerd stuff here with @GabriellaG439 (of #Haskell and #Nix fame) on the Impure Pics @impurepics channel, where she talks about #Grace, which looks like a web-based functional language (I just started the video and got excited)

I wanted a #Haskell function to efficiently compute the conjugate of an integer partition. I think I know how to write it, but it's fiddly. There's a nice, succinct functional specification:
conjugate = reverse . map length . transpose . map (`replicate` ())
but it's slow. Now I'm wondering whether it's possible to derive an efficient version from this specification, #Bird-Meertens style. Anyone know of previous work along these lines? Or should I add it to my list of interesting projects?
Why I Still Reach for Scheme and Lisp Instead of Haskell - jointhefreeworld
Exception Annotations: Lay of the Land https://well-typed.com/blog/2026/05/lay-annotation-land/
"Exception Annotations: Lay of the Land" by Edsko de Vries.
TL;DR: Use ghc 9.12, don’t call throwIO on an argument of type SomeException, and use your own function instead of displayException if you want to see all exception annotations.
🦾 Functional Programmers need to take a look at Zig.
https://pure-systems.org/posts/2026-04-29-functional-programmers-need-to-take-a-look-at-zig.html
You can now try MicroHS in the browser! Check it out:
https://augustss.github.io/MicroHs/web-mhs/
Discourse: https://discourse.haskell.org/t/microhs-in-the-browser/14055