Variables are quite subtle and easy to get wrong. An approach is described to support rigid $α$ canonical variables in an e-graph. The lifting e-graph has a baked-in notion of functional lifting combinator. It is implemented by fattening the usual integer identifiers with thinning bitvectors, lift-pulling smart constructors, and a special thinning-aware union find variation. The approach is inspired by slotted e-graphs and Co-de Bruijn syntax.
I mean that both in the specific and the abstract. This episode we are looking at APL, which stands for A Programming Language. APL was developed in the mid 50s, but didn't see a working implementation until 1965. It's a language that truly looks like no others, but has some odd parallels to everything from BASIC to LISP to linear algebra. Learn APL at: - A Programming Language
While we speak every other week with a distinguished logician, this episode is a particularly special one.
Dana Scott is a Turing Award winner (often described as the Nobel Prize of computer science) whose work has had a profound impact on logic, set theory, and theoretical computer science.
His contributions range from Boolean-valued models and the forcing method to computability theory, domain theory, and the denotational semantics of the lambda calculus.
Have a look: this is living logic history.
New blog post! In "Zigzag decoding with AVX-512", we look at two different ways to possibly (caveat emptor) speed up various forms of zigzag decoding with AVX-512 functionality that isn't just "wider registers".
Boosts appreciated!
I’ve been working on speeding up AVX-512 vertex decoding in meshoptimizer recently; in the process I stumbled upon two optimizations that I did not end up using but I thought they might be fun to write about! The optimizations that actually made it in require some higher level background / explanations that will have to wait until another day :)
#PLDI2026 is live-streaming participating sessions on YouTube! Catch workshops, keynotes, research talks, and more from the premier PL and programming systems research venue.
📺Tune in at: https://pldi26.sigplan.org/attending/live-streams
Welcome to the home page of the 47th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2026)! PLDI is the premier forum in the field of programming languages and programming systems research, covering the areas of design, implementation, theory, applications, and performance. PLDI 2026 will be held in person at the Limelight Boulder in Boulder, Colorado, USA. The main PLDI conference will be held from Wednesday, June 17, through Friday, June 19. Workshops and tutorials were held on Monday, June 15, and Tuesday, June 16. Registration opens on Monday, March 16, 2 ...
Philip Zucker
Cong Li
Thor
CF Bolz-Tereick
Arseny Kapoulkine
Stephen Kell
PLDI 2026
Ken Shirriff