Uploaded March 2026 | Updated November 2026, 15 hours ago
Oxford Seminar, March 5 2026
Speaker: David Corfield
Also appearing in this recording are David Jaz Myers and Matteo Capucci.
Full Title: Categorical systems theory: control and emergence
Abstract: This will be an informal session with plenty of discussion time, investigating a couple of concepts that arise from the category-theoretic treatment of systems.
*(1) Control*
How inputs to a system regulate its behaviour. Starting points: (a) In response to the 'active inference' program, some recent articles (e.g., arxiv.org/abs/2406.07577 and arxiv.org/abs/2508.06326) have looked to understand autonomous systems as composed of agent and controller subsystems, equipped with dual interfaces; (b) Ordinary Lyapunov functions have been treated category-theoretically (arxiv.org/abs/2502.15276), work that should be extendable to variants. Where ISS (input-to-state stability) Lyapunov functions concern stability under any external perturbation, control Lyapunov functions concern stability under a chosen input.
*(2) Emergence*
Phenomena where the composite behaviour of the parts does not equate to the behaviour of the composite. Starting points: (a) Elie Adam's thesis, 'Systems, Generativity and Interactional Effects' (elieadam.com/eadam_PhDThesis.pdf); (b) Puca et al. on 'Failures of compositionality' (arxiv.org/abs/2307.14461) (c) Erik Hoel on causal emergence (e.g., arxiv.org/abs/2202.01854). Two relevant CT constructions appear to be laxness of functors and coarse-graining as epimorphisms, potentially fitting well with a double category-theoretic outlook.
Oxford Seminar, March 5 2026
Speaker: David Corfield
Also appearing in this recording are David Jaz Myers and Matteo Capucci.
Full Title: Categorical systems theory: control and emergence
Abstract: This will be an informal session with plenty of discussion time, investigating a couple of concepts that arise from the category-theoretic treatment of systems.
*(1) Control*
How inputs to a system regulate its behaviour. Starting points: (a) In response to the 'active inference' program, some recent articles (e.g., arxiv.org/abs/2406.07577 and arxiv.org/abs/2508.06326) have looked to understand autonomous systems as composed of agent and controller subsystems, equipped with dual interfaces; (b) Ordinary Lyapunov functions have been treated category-theoretically (arxiv.org/abs/2502.15276), work that should be extendable to variants. Where ISS (input-to-state stability) Lyapunov functions concern stability under any external perturbation, control Lyapunov functions concern stability under a chosen input.
*(2) Emergence*
Phenomena where the composite behaviour of the parts does not equate to the behaviour of the composite. Starting points: (a) Elie Adam's thesis, 'Systems, Generativity and Interactional Effects' (elieadam.com/eadam_PhDThesis.pdf); (b) Puca et al. on 'Failures of compositionality' (arxiv.org/abs/2307.14461) (c) Erik Hoel on causal emergence (e.g., arxiv.org/abs/2202.01854). Two relevant CT constructions appear to be laxness of functors and coarse-graining as epimorphisms, potentially fitting well with a double category-theoretic outlook.
![[TopOx] Tom Leinster: The many faces of magnitude
16th of February 2026. Slides available at https://topos.institute/events/topox/
The magnitude of a square matrix is the sum of all the entries of its inverse. This strange definition, suitably used, enables us to define the magnitude of many objects in different contexts across mathematics. All of them can be seen as measures of size. For example, the magnitude of a metric space combines classical quantities such volume, surface area, and dimension. The magnitude of a category is closely related to Euler characteristic. The magnitude of a graph is an invariant sharing features with the Tutte polynomial (but not a specialization of it). Magnitude also appears in the difficult problem of quantifying biological diversity: under certain circumstances, the greatest possible diversity of an ecosystem is exactly its magnitude. And there is now a theory of magnitude homology, which has the same relationship to magnitude as ordinary homology does to Euler characteristic. I will give an aerial view of this landscape. [TopOx] Tom Leinster: The many faces of magnitude](https://i.ytimg.com/vi/wxqfxRCGoOE/mqdefault.jpg)


![[Berkeley Seminar] Bryce Goldman (Topos Institute) | ModalTT
Title: ModalTT: a type theory for modal virtual double theories
Abstract: CatColab’s DoubleTT module uses virtual double theories to parameterize logics, which determine a type theory on models. These theories are currently hard-coded in CatColab’s backend, and their specification is not exposed directly to the user. This talk introduces an implementation of a user-facing DSL for specifying custom (modal) virtual double theories. This language is backed by a type theory for virtual double categories (VDCs), inspired by prior work by Hayato Nasu on an internal language of VDCs. We propose a handful of modifications to Nasu’s type theory, which integrate support for double monads, expose the innate resource-sensitivity and order-sensitivity of the internal logic, and better facilitate a translation into software.
Date: August 18, 2026 [Berkeley Seminar] Bryce Goldman (Topos Institute) | ModalTT](https://i.ytimg.com/vi/xK1KIaVo0Uo/mqdefault.jpg)
![[Oxford Seminar] Matthew Daggit | Developing support for end-to-end verification of neural AI agents
Oxford Seminar, 1st of May 2025,
Full Title: Developing programming language support for end-to-end verification of neural AI agents
Over the past decade, there has been impressive progress in developing algorithms capable of formally verifying first-order, linear specifications about small-to-medium-sized neural networks. This has opened the door to formally verifying the correctness of neural AI agents operating in complex environments. However, due to the complexity of integrating these verification algorithms with other reasoning tools and the many moving parts involved, deploying them in practice has proven more challenging than anticipated.
In this talk, I will introduce Vehicle, a tool that my collaborators and I have been developing. Vehicle allows users to: (i) write specifications for AI agents in a high-level, domain-specific language; (ii) use these specifications to guide training; (iii) formally verify whether the resulting neural network satisfies the specification; and (iv) export verified specifications to interactive theorem provers where the agents can be reasoned in the context of their environment. In the talk I will highlight how we leverage type theory in unusual ways to improve the user experience, our use of real-valued logic semantics to interpret Boolean specifications, and finally some of the open theoretical challenges in the field.
Links:
https://github.com/vehicle-lang/vehicle [Oxford Seminar] Matthew Daggit | Developing support for end-to-end verification of neural AI agents](https://i.ytimg.com/vi/xK8Kw-g0mNs/mqdefault.jpg)
![[DOTS Lectures] 6. Categories of Moore Machines
Part of a lecture series on the Double Operadic Theory of Systems (DOTS) presented by David Jaz Myers. [DOTS Lectures] 6. Categories of Moore Machines](https://i.ytimg.com/vi/xMYGOzYhVVo/mqdefault.jpg)
![[2-torial] Owen tells Tim about elaborators for type theories [2/2]
Accompanying code can be found on github: https://github.com/ToposInstitute/elaboratorial [2-torial] Owen tells Tim about elaborators for type theories [2/2]](https://i.ytimg.com/vi/xQSG_a_uyKk/mqdefault.jpg)
![[Berkeley Seminar] Aaron Huntley (Topos Institute) | Generalised coproduct completions
Title: Partial functions and other generalised coproduct completions
Abstract: The category of sets and functions is the free coproduct completion of the terminal category. In a double-categorical setting, Evan Patterson defined a new notion of double (co)product and used it to prove that the double category of sets, functions and spans is the free coproduct completion of the terminal double category. In this talk we both generalise and refine this notion. First, we extend Patterson’s original definition to include (co)products in (co)virtual double categories, which can capture examples such as coproducts in Span(C) even when C does not have pullbacks. Second, we isolate finer classes of double (co)products, denoted (L,R)-(co)products, where L and R are certain classes of functions. As an application, we exhibit the double category of sets, functions and partial functions as a free (L,R)-coproduct completion of the terminal double category.
Date: 9/1/2026 [Berkeley Seminar] Aaron Huntley (Topos Institute) | Generalised coproduct completions](https://i.ytimg.com/vi/xa04dVG4fEs/mqdefault.jpg)
![[Berkeley Seminar] David Spivak (Topos Institute) | Categories by Kan extension
Title: Categories by Kan extension
Abstract: Categories can be identified—up to isomorphism—with polynomial comonads on 𝐒𝐞𝐭. The left Kan extension of a functor along itself is always a comonad—called the density comonad—so it defines a category when its carrier is polynomial. We provide a number of generalizations of this to produce new categories from old, as well as from distributive laws of monads over comonads. For example, all Lawvere theories, all product completions of small categories, and the simplex category 𝚫^op arise in this way. Along the way, we will see various constructions of non-polynomial comonads as well.
Date: Sept 8, 2026 [Berkeley Seminar] David Spivak (Topos Institute) | Categories by Kan extension](https://i.ytimg.com/vi/yKlLGYiOpmc/mqdefault.jpg)
![[Oxford Seminar] tslil clingman | What is type theory (theory)?
Oxford Seminar, October 15 2026
You can view the listing for this talk online at https://topos.institute/events/oxford-seminar/talks/2026-10-15_clingman_type.html
Speaker: tslil clingman
Full Title: What is type theory (theory)?
Abstract: Join us to hear an account of (re-)inventing what type theory is, from a position of ignorance. Specifically the work to be discussed arose as an attempt to understand what a coordinate free understanding of type theory might be, and why and whether we might be interested in such a thing. In particular, the to-be-discussed framework eschews the usual microcosm approach of categorical type theoretic accounts in which (external) limits and colimits are used to model internal ones and the various calculi of syntax thereupon.
*Optional background:* Cursory experience with sheaves and type theory is likely to be useful.
Heres a link to the pdf mentioned at the start of the talk: https://tslil.xyz/store/what_is_type_theory_theory.pdf [Oxford Seminar] tslil clingman | What is type theory (theory)?](https://i.ytimg.com/vi/yeYw2UNCOpw/mqdefault.jpg)
