Sad to hear about Bill Atkinson's passing. When I was a kid and we got our first original 128k Mac, I absorbed the programming documentation and marveled at the amazing breadth of functionality crammed into the QuickDraw library that he wrote. nytimes.com/2025/06/07/tec…

Had a great time talking about the astonishments I've experienced while thinking hard on invariant inference and finding myself studying learning theory. Also: SAT solving for metamaterials w/Yair Shokef, and the joys of feeling stupid. Hope you'll enjoy it. etaps.org/blog/034-yotam…

Great comment on how Rust's slow compilation speed is mostly a result of Cargo being the way it is and how "crates" are just way too big. Cargo isn't a good build system.

Here's a paper describing quantum computing using standard programming constructs, w/o linear algebra! Goal: demystify quantum computing + serve as a formal foundation for reasoning about quantum programs. paper paper eprint.iacr.org/2025/1091.pdf code github.com/qqq-wisc/qwla

New paper: World models + Program synthesis by Wasu Top Piriyakulkij 1. World modeling on-the-fly by synthesizing programs w/ 4000+ lines of code 2. Learns new environments from minutes of experience 3. Positive score on Montezuma's Revenge 4. Compositional generalization to new environments

Vivek Galatage My favorite use case: CSS selectors (bugs.webkit.org/show_bug.cgi?i…). When looking for elements matching a selector, update a bloom filter of ancestor element class/ID/tag names to quickly reject elements without the necessary ones.

Hear ye, hear ye! Come 16:20 Korean time tomorrow for a talk "Omelets Need Onions: E-graphs Modulo Theories via Bottom Up E-Matching". pldi25.sigplan.org/details/egraph… arxiv.org/abs/2504.14340

I have created a concurrent trie datatype in Haskell, which you may find interesting or useful Posting here to get some code review and feedback link to follow

I am once again pitching my romantic comedy: - two academics start dating - discover they are each other's terrible reviewer - hijinks ensue Working title: Love is Double-Blind

taking a go at oxcaml today first attempt: let's try a parallel reduction. Idea is to compute the "sum" of [f(lo), ..., f(hi-1)] in parallel, combining via some associative function g (and corresponding zero element, z).

It’s a officially a new national record🇮🇸🇮🇸🇮🇸!! 140kg at 57.2 bodyweight (<59kg), beating the previous record by 15kg 😄 Can you spot the Haskell logo?

100% of ACM publications available for free from 1st January 2026! 🎉 Landmark achievement!

[New Blog Post] Telescopes Are Tries: A Dependent Type Shellac on SQLite #database #logic philipzucker.com/telescope_trie…

What's this? An abstract syntax tree? A bytecode? What does that even mean anymore? Next Wednesday, Octave Larose is going to explore those questions in his ICOOOLPS presentation. Our draft paper is online already: 2025.ecoop.org/details/ICOOOL… #interpreter #design #tradeoffs

One Happy Fellow Maybe this will help. blog.sigfpe.com/2008/08/untang… 😀

Some more exciting news! This year we had not one, but two(!) dissertations receiving the SIGPLAN John C. Reynolds Doctoral Dissertation Award at PLDI! The awardees are: Harrison Goldstein from the University of Pennsylvania and Rachit Nigam from Cornell University. More info ⬇️

Going to start calling it “C/Haskell” since C++ and Haskell have similar relationships to C. Both: - use its preprocessor - inherit its ABI - inherit its concurrent memory model - require libc - depend on C’s compiler, linker, and program loader to function

If you only care about orbits, Newton didn't add much. His laws give the same predictions. But Newton's laws went beyond orbits: the same laws explain pendula, cannonballs, and rockets. This motivates our framework: Predictions apply to one task. World models generalize to many

A new VentureBeat article just landed about Positron.AI. venturebeat.com/ai/positron-be…

Every tail-recursive call is just a jmp in a trench coat, mugging your stack for frames. 🕵️‍♂️ My new blog post explains why recursion's secret identity is ‘while(1){}’ (link follows): "Why Tail-Recursive Functions are Loops"