4-Clause BSD summarized/explained in plain English.
Structured CoT: Shorter Reasoning with a Grammar File
Constrain only the think block with a tiny grammar. On Qwen3.6 coding evals, explicit reasoning gets 22x-43x shorter without losing pass@1 in these runs.
Opus 4.7 Part 2: Capabilities and Reactions
Claude Opus 4.7 raises a lot of key model welfare related concerns.
Operads for compositional reasoning in LLMs
Question decomposition, i.e. breaking a complex query into simpler sub-queries whose answers are composed to produce a final answer, is a widely used strategy for improving LLM reasoning, yet it currently lacks a rigorous mathematical foundation. In this paper, we propose operads, mathematical structures that model many-in, one-out operations and compositions thereof, as a natural framework for describing question decomposition. We define the questions operad $Q$, in which operations correspond to question templates and composition corresponds to substitution of sub-answers, and show how QA models can be interpreted as algebras over $Q$. Beyond reframing existing practice, this operadic perspective points toward new methods, in particular a notion of operadic consistency, which measures whether a QA model's answers agree across the partial collapses of a question decomposition tree. Empirical evaluation of operadic consistency is reported in our companion paper (Bottman, Liu, and Richardson, 2026), which finds it strongly correlated with accuracy across twelve LLMs and four multi-hop QA datasets and outperforming standard temperature-based self-consistency baselines. We argue that operads are the natural mathematical home for question decomposition, and that invariants such as operadic consistency open new directions for analyzing and improving the reliability of multi-step reasoning.
Read-me for Kilgarriff's BNC word frequency lists
The lemmatised list is called 'lemma' and is available in four forms: ordered alphabetically or by frequency, and compressed (using gzip) or uncompressed, so the four files are:
The Lambek Calculus
There is a noticeable revival of categorial grammar these days, as a vehicle for linguistic description. The systems used differ somewhat from the original calculus of Ajdukiewicz and Bar-Hillel, however. In particular, there is a component of rules for ‘type change’ of expressions, making for greater flexibility and elegance. One fundamental system of this kind is the so-called ‘Lambek Calculus’, whose type-change rules show a close analogy with the inference rules of constructive propositional logic. In this paper, we present one calculus of this kind, and survey its theoretical properties as a device in linguistic semantics. Our two main new contributions are a new and complete semantics for this calculus, as well as a modest study of its language-accepting capacity. In this way, we hope to provide a better understanding of the background theory of flexible categorial grammar, in tandem with its descriptive uses.
The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits
Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad $\mcT$, capturing this self-similarity. We discuss the algebra $\Rel$ of mathematical relations on $\mcT$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem: ACM Transactions on Programming Languages and Systems: Vol 29, No 3
We propose a novel approach to the view-update problem for tree-structured data: a domain-specific programming language in which all expressions denote bidirectional transformations on trees. In one direction, these transformations---dubbed lenses---map ...
dynamic abstractions
We will have our first reading group on February 28th! Visit the reading group page for details!
Opus 4.7 Part 3: Model Welfare
It is thanks to Anthropic that we get to have this discussion in the first place.
Page 4: POW+TREE Writing Strategy
As Ms. Lin reflects on the trouble her students are having with writing, she realizes that many of her students need help incorporating the four elements of the writing process (i.e., planning, organizing, writing, and editing and revising) into their essays. She concludes that they need a guide or strategy to follow as they write.[.....]
Elias Stengel-Eskin, Aaron Steven White, Sheng Zhang, Benjamin Van Durme · Universal Decompositional Semantic Parsing · SlidesLive
Professional Conference Recording
org/TermsOfUse.md at 71149c7fc95ccfeae36109b5cddca339e4aa1473
org - Official Codeberg Documents and their unofficial translations.
memory.md is just file paths, no summaries. makes total sense ngl. i’ve been moving my agents to this. it’s progressive disclosure
"but where are all the bluesky instances?" i've heard this so many times that i wrote an explainer
There Are No Instances in atproto — overreacted
overreacted.io
