Tootfinder

from my link log —
Row polymorphic programming.
https://www.stranger.systems/posts/by-slug/row-polymorphic-programming.html
saved 2025-07-14

Row Polymorphic Programming
Sometimes, especially when dealing with business logic, we have to deal with data that comes in from the real world, or elsewhere, naturally very messily typed, leading to nasty type signatures and messes of macros or code generation to build data structures from a schema. Row polymorphism can help us by abstracting over the fields contained in a record type in the type signature, letting us define records based on data, concatenate records together, and define functions that are generic across…

Zug steht. Paulanergarten-Flagge weht.

Zug steht. Paulanergarten-Flagge weht.

Ouwehand die Brekelmans laat zien waar het hier over gaat.
Directe link naar Debat Direct:
https://debatdirect.tweedekamer.nl/2025-08-22/overig/plenaire-zaal/twe…

📷🎥 Lights, cameras…on #TNC25!
From thought-provoking keynotes to spontaneous hallway chats, #TNC25 was packed with unforgettable moments—and now you can relive them all.
The official #TNC25 photos and reco…

Letzter Plenartag vor der Sommerpause im #ltbw - es geht um die von gestern aus Zeitgründen verschobenen Änderungen an Abgeordnetengesetz und GO, um Kita-Leitungszeit und Jugendhilfe, um NOOTS, BITBW und Regelbefreiung für Kommunen sowie um das Vermessungsgesetz. Danach für alle in Stuttgart Landtagssommerfest (ich bin leider im Home-Office).

Planar Tur\'an number of disjoint union of $C_3$ and $C_5$
Luyi Li, Ping Li, Guiying Yan, Qiang Zhou
https://arxiv.org/abs/2507.16351 https://

Planar Turán number of disjoint union of $C_3$ and $C_5$
The planar Turán number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex $H$-free planar graph. The planar Turán number of $k\geq 3$ vertex-disjoint union of cycles is the trivial value $3n-6$. Let $C_{\ell}$ denote the cycle of length $\ell$ and $C_{\ell}\cup C_t$ denote the union of disjoint cycles $C_{\ell}$ and $C_t$. The planar Turán number $ex_{\mathcal{P}}(n,H)$ is known if $H=C_{\ell}\cup C_k$, where $\ell,k\in \{3,4\}$. In this paper, we de…

Now *thats* a medical announcement worth making a big deal about!!
https://wandering.shop/@adapalmer/115248780757355899

Analysis of polymerized superconducting circuits
Sean Crowe, Stefan Evans, Alexei Smolyaninov
https://arxiv.org/abs/2509.18016 https://arxiv.org/pdf/2509.1…

Analysis of polymerized superconducting circuits
We apply polymer quantization, a quantization technique sometimes used in high energy physics, to several superconducting circuits including: transmons, transmission line resonators, and LC circuits. In the case of transmon qubits and transmission line resonators, experimental predictions are very close to what is found with canonical quantization, though in this approach constant charge offsets can be interpreted as quantization ambiguities. In the case of LC circuits, polymer quantization pre…

Polymarket says it is buying little-known derivatives exchange QCX, in a move to legally re-enter the US market; a source says Polymarket will pay $112M (Bloomberg)
https://www.bloomberg.com/news/articles/2025-07-21/cr…