The Eternal Doorman

I think that card-punch definition is actually the closest one. This was the first session today.  Her talk starts about 10 minutes in: The Q&A session was really good. See Lindsey Kuper - Interpreters Everywhere!   Subscribe to ACM SIGPLAN . 

Seems like there are lots of different shades of bisimilarity. Why didn't anybody tell me about compiler calculating? See Safety First: How to Safely Disregard Unsafe Behaviour in Compiler Calculations by Patrick Bahr. Talk starts about 2 hours into this livestream. Subscribe to ACM SIGPLAN .  

This is a really great talk. I hope Dana Scott gets to hear about this fixpoint model. Also the questions from the programming language semantics angle are very interesting. His answer is basically "Don't write programs like that!" See his book  Deterministic Concurrency . It's the first talk in this session. See ICFP 2026 . Before I listened to this talk I was thinking about what sort of a world it would be if we had tools where we could use synthetic mathematics to build languages (syntax and operational semantics) with certain abstract properties defined by Lawvere semantics. You would be able to compose different notions and factor out sublanguages which are well-behaved according to the functorial semantics. In this somewhere there is surely a kind of algebra of languages. For some reason though, people think it is better to develop separation logic and stuff to "reason" about any old garbage that somebody might try to write, and the people who make the...

See  ICFP 2026 Program . I just caught the end of an interesting talk by  Hongshuo Fan  who has been experimenting with musical gesture recognition. That would be interesting to try in collaborative composition projects too. Also Jared Gentner on what sounds to me like an interesting way to compose languages. It definitely works for performance programming! There was also a miniKanren thread. See  William Byrd on Relational Programming and Quines . Starts at 1:18:34 . At 3:08:42  Towards bottom-up enumeration in miniKanren via pruning and memoization. At  6:04:44 Compiling polymorphic relations without monomorphization.  6:52:18 Efficient Rational Unification for miniKanren.  Questions & Answers at 7:26:12 .  8:14:53 Lean, Mean miniKanren Machine.  9:03:12 Q&A. Subscribe to ACM SIGPLAN .  Also, tomorrow at 9AM Edward Lee on Deterministic Concurrency .  It is not uncommon, particularly in the early literature in co...

Somebody please inform the Vatican ,... See also this Patreon post by Anton and these articles: Deep subsurface organic-rich shale supports abundant, diverse, and novel fungi  by Quinn S Moon et al. Rock-eating fungi flourish deep below our feet   (U. Michigan Press Office.)  Subscribe to Anton Petrov . 

See  CuriousMarc - Taking Apart an HP 16702 Logic Analyzer .  Some of this rings bells. I think I must have done an HP/UX upgrade from CD-ROM once,... Buy SCSI knives from  Jurassic Computing .  Subscribe to  Curious Marc . 

Born into the prominent political and banking Medici family of Florence, Giovanni was the second son of Lorenzo de' Medici, the de-facto ruler of the Florentine Republic, and was elevated to the cardinalate in 1489. Following the death of Pope Julius II, Giovanni was elected pope after securing the backing of the younger members of the College of Cardinals. See Pope Leo X  on Wikipedia. See also  Fugger family  (well in the sixteenth century they spelled words differently.)  Subscribe to  Uncover Things  (shit, etc.) and  Uncover History  (more shit than you can shake a stick at.)  Pope Leo XVI is going to make up for it I'm sure. Subscribe to Lena Petrova . 

This is interesting. See the paper  Hyperfunctions: Communicating Continuations  by Donnacha Oisín Kidney and Nicolas Wu. We use this framework to solve a long-standing problem: giving a fully-abstract continuation-based semantics for a  concurrent calculus, the Calculus of Communicating Systems. Finally, we use hyperfunctions to build a monadic Haskell library for efficient first-class coroutines. I found this by interrogating Google search AI for ten minutes on coroutines and reactive systems. Google search AI is stupid and rude. That company is finished.  Subscribe to ACM SIGPLAN . 

Both of  these talks are relevant to this post of mine:  The Story of Unix - Chapter Ω: The Captains All Jumped Ship . Douglas Creager on Concatenative Programming and Stack-based Languages  See  The Theory of Concatenative Combinators  by Brent Kirby.  Subscribe to Strange Loop .  Shriram Krishnamurthi on the 1991 paper  On the expressive power of programming languages  by Matthias Felleisen. He does a great job describing a quite subtle idea to a non-mathematical audience.  35:36 I really need to read this paper to understand exactly what is the difference between Ω and halt . [ 40:13 halt   is just call/cc ].  Subscribe to Papers We Love .