The Eternal Doorman

This is an amazing phenomenon. This language kind of invents type systems as it goes,... It's a bit like what set theorists do, in fact. More on that later,... The talk starts around 34:50 . See  The Verse Calculus: a core calculus for functional logic programming . Also Simon Peyton-Jones' lectures at OPLSS 2026:  Types, Proofs, and Program Logics .  On denotational semantics see also Domain-Theoretic Semantics for Functional Logic Programming : 17:23 On models which are termination-insensitive. See  Two Great Talks on Programming Languages , in particular Shriram Krishnamurthi on the 1991 paper On the expressive power of programming languages by Matthias Felleisen. Subscribe to  ACM SIGPLAN . 

We don't have any decent operating systems unfortunately, but I keep thinking about this device, because it is a cool toy. I once programmed something like it in Microsoft Basic, of all things. All it did was allow the program to open new windows on the screen with widgets of various kinds which it could configure by calling procedures. So there was a widget which could display a list of items and the widget handled the scrolling as each item was added. There was another which allowed input strings and the widget made the data available as the return result of another procedure. There was a status bar widget which showed various flags according to procedure calls etc. etc.  But we have much fancier displays in the form of web pages, so it occurs to me that you could make a system like this allowing programs to interact with local web servers, one for each app. These could be multiple different processes each serving http requests on a different port. Then one of them would be the ...

See his Google scholar list of publications and  Narya documentation .  Some noteworthy papers: Homotopy type theory: the logic of space  (2017) Comparing material and structural set theories  (2019) Subscribe to  About Logic . 

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 .