Lmst

Last but not least, Mark Koch talks about Guppy.

Mark Koch standing next to a psychedelic image of a fish. The text says "GUPPY".

I am in Denver. It is Burns Night. Where do I get haggis?
#denver #haggis #popl

Agustin Borgna talking about HUGR at PLanQC 2025. #planqc #popl #quantumcomputing #quantinuum

Agustin Borgna giving a talk. The slide says "HUGR".

Kaitlin Smith opens PLanQC 2025 with an overview of quantum software in her keynote talk. #planqc #popl #quantumcomputing

Kate Smith standing at lecturn giving a talk, with slides showing the logos of lots of quantum companies..

"cottage industry of safe forms of recursion" - @danielgratzer #popl

the howling noises have started #popl

OH: "infamous within the ML module community" #popl

the temperatures are slowly rising … #popl

"engenders" used #popl

#popl
“pantograph” is a great name for a structure editor! the analogy works really well

I'm presenting in #POPL our paper on dis/equality graphs on Thursday, 14h MST in Marco Polo.

If you're writing or extending a prover/solver you have to deal with equalities. Here's what to expect from our talk and paper 🧵⬇️

from Emily Riehl’s CPP talk: she distinguishes two approaches that may both be called synthetic (strategies II and III) #popl

Prospects for formalization? I can imagine three strategies for formalizing the theory of co-categories. Strategy I. Give precise "analytic" definitions of oo-categorical notions in some model (e.g., using quasi-categories). Prove theorems using the combinatorics of that model. Strategy Il. Axiomatize the category of oo-categories (e.g., using the notion of oo-cosmos or something similar). State and prove theorems about oo-categories in this axiomatic language. To show that this theory is non-vacuous, prove that some model satisfies the axioms and formalize other examples, as desired Strategy III. Avoid the technicalities of set-based models by developing the theory of so-categories "synthetically," in a domain-specific type theory. Formalization then requires a bespoke proof assistant (e.g., Rzk).

in case anyone needs some counterprogramming for certain political events today, I believe the #POPL* workshops (see https://popl25.sigplan.org/) will be streamed at https://youtube.com/@acmsigplan?si=fZCtgJqY7CueUidw

*principles of programming languages; academic nerd stuff; mechanized proofs and semantics and compilers and whatnot

I'm at #POPL in Denver all week. On Thursday I'm presenting my paper in the main track.

I'm really looking forward to meet all of you. Hit me up if you want to meet or chat.

The POPL paper "Relaxed Memory Concurrency Re-executed" by Evgenii Moiseenko, Matteo Meluzzi, Innokentii Meleshchenko, Ivan Kabashnyi, Anton Podkopaev, and our own Soham Chakraborty was selected for a distinguished paper award. Congratulations to all the authors!

https://dl.acm.org/doi/10.1145/3704908

#XMM #Concurrency #POPL