Uploaded April 2025 | Updated November 2026, 11 hours ago
Topos Institute Colloquium, 24th of April 2025.
———
Enriched categories have hom-objects in a monoidal category V, but their theory is usually formulated under the assumption that V is biclosed and so is enriched in itself. Categories equipped with an action of V (or V-actegories) provide a related setting with the advantage that an arbitrary monoidal category V can always be regarded as a V-actegory. Richard Wood delineated a setting subsuming both V-enriched categories and V-actegories by considering V-graded categories, which are categories enriched in a monoidal category of presheaves on V but admit also a direct and elementary definition in terms of a notion of morphism with an additional parameter in V. Graded categories have also been called procategories (by Kelly-Labella-Schmitt-Street) and locally V-graded categories (by Levy).
Topos Institute Colloquium, 24th of April 2025.
———
Enriched categories have hom-objects in a monoidal category V, but their theory is usually formulated under the assumption that V is biclosed and so is enriched in itself. Categories equipped with an action of V (or V-actegories) provide a related setting with the advantage that an arbitrary monoidal category V can always be regarded as a V-actegory. Richard Wood delineated a setting subsuming both V-enriched categories and V-actegories by considering V-graded categories, which are categories enriched in a monoidal category of presheaves on V but admit also a direct and elementary definition in terms of a notion of morphism with an additional parameter in V. Graded categories have also been called procategories (by Kelly-Labella-Schmitt-Street) and locally V-graded categories (by Levy).
![[2-torial] José tells Jason about coalgebraic-modal extensions of logic
[2-torial] José tells Jason about coalgebraic-modal extensions of logic [2-torial] José tells Jason about coalgebraic-modal extensions of logic](https://i.ytimg.com/vi/UVj3BDy0iaU/mqdefault.jpg)
![[Oxford Seminar] Paolo Perrone | Descent in Probability Theory: the first steps downward
Oxford Seminar, October 16 2025
Speaker: Paolo Perrone
Full Title: Descent in Probability Theory: the first steps downward
Abstract: Coarse-graining, forming quotients by dropping distinctions, is a unifying idea across mathematics: identifying the endpoints of an interval yields a circle; groups are conveniently presented as quotients of free ones; sheaves and stacks emerge from gluing local data. This idea is also central to probability, where “observing” a random variable similarly quotients a sample space via the sigma-algebra it generates (and is crucial for modeling randomness as ignorance). Yet this quotienting procedure, in probability, has so far lacked a systematic categorical treatment.
We develop a descent theory for probability that makes this intuition precise, while respecting probabilistic practice as much as possible. On the category theory side, the theory parallels classical descent, but diverges in a few ways due to the presence of stochastic dependence (correlations). On the probability side, it unifies the three core concepts of measurability, disintegration and stochastic dominance, within a single framework, providing conceptual understanding of the relationships between random variables, statistical experiments, and inference procedures. [Oxford Seminar] Paolo Perrone | Descent in Probability Theory: the first steps downward](https://i.ytimg.com/vi/VG2RTE1R0BY/mqdefault.jpg)
![[Oxford Seminar] B. Scot Rousse | Who cares about values?
Oxford Seminar, 19th of June 2025
Today it is common to hear about “human values” and the importance of designing technologies that “align” with our values. But where does this notion of “human values” come from? In this talk I trace the history of the concept of human values. I connect this notion with an evolution in our understanding of human autonomy, and argue that both are inadequate abstractions for the challenges of being human in our technological age. Finally, I introduce the notion of care as an alternative to “values,” showing how it furnishes a subtler map for imagining and shaping our relationship to technology today. [Oxford Seminar] B. Scot Rousse | Who cares about values?](https://i.ytimg.com/vi/VJZUZ37gj2Y/mqdefault.jpg)



![[Berkeley Seminar] Brendan Fong | Processes of Production of Abstraction
Title: Category Theory as the Formal Study of the Processes of Production of Abstraction
Abstract: For the last few months I’ve been reflecting on the phrase “Category theory is the formal study of the processes of production of abstraction”. I’ll say some words about what this phrase means to me. I ask your help inquiring about the epistemology of these meditations.
Date: 2025-06-10
https://topos.institute/events/berkeley-seminar/ [Berkeley Seminar] Brendan Fong | Processes of Production of Abstraction](https://i.ytimg.com/vi/WzAPGmW5YHQ/mqdefault.jpg)

![[Oxford Seminar] David Jaz Myers | Compositionality via 2-algebra
Oxford Seminar, May 28 2026
Speaker: David Jaz Myers
Full Title: Compositionality via 2-algebra
Abstract: A complex system may be designed modularly by putting together interacting component subsystems. Since analyses of complex systems can often scale very poorly with their size, it pays to use the modular structure of such systems to divide the task of analysis across the component subsystems.
Many analyses of systems may be encoded as homomorphism search problems between systems of the same sort. This suggests attending to categories of systems and their homomorphisms. In this talk, well consider the modular structure of a class of systems as a 2-algebra — an algebraic structure on categories of systems (and their interfaces and interaction patterns). Well see compositionality theorems as (lax) homomorphisms of these 2-algebraic structures, and survey a number of techniques for proving them using 2-categorical algebra. [Oxford Seminar] David Jaz Myers | Compositionality via 2-algebra](https://i.ytimg.com/vi/XXIaJ98SUik/mqdefault.jpg)
![Jonathan Weinberger: Universes in simplicial homotopy type theory
Topos Institute Colloquium, 29th of October 2026.
———
Homotopy type theory has proven to be a fruitful way of doing homotopy theory synthetically: (topological) spaces are the basic objects of the theory, and all constructions and theorems are invariant under homotopy, i.e. continuous deformation. Up to homotopy, spaces can be understood as ∞-groupoids, i.e., weak infinite-dimensional groupoids, so HoTT can be regarded as a synthetic language for ∞-groupoids.
In contrast, type theories for ∞-category theory remained underexplored for some time. However, in 2017, Riehl—-Shulman [12] worked out an approach extending standard homotopy type theory by simplicial shapes. As opposed to standard HoTT, not every type is of the desired kind in simplicial HoTT, i.e., an ∞-category. But one can restrict to the respective subclass of such types and recover a lot of standard constructions from category theory such as functors, natural transformations, adjunctions [10-12], and (co)limits [1]. In analytic set-based ∞-category theory one has to specify an infinite amount of data together with coherences for these constructions. In simplicial HoTT, these constructions often drastically simplify, yielding naturality and coherence for free. Furthermore, this theory makes ∞-category theory amenable to formalization in a computer proof assistant [5, 6, 14].
I will survey recent developments in simplicial HoTT, emphasizing universe types, namely the synthetic ∞-category of ∞-groupoids and ∞-categories, resp. [7-9]. This admits many parallels to the comprehensive program of synthetic ∞-category theory of [4].
The talk is based on joint work with Ulrik Buchholtz, Daniel Gratzer, Nikolai Kudasov, Emily Riehl, and Rob Schellingerhout.
[1] C. Bardomiano Martínez (2025): Limits and Colimits in Synthetic ∞-Categories. Mathematical Structures in Computer Science 35. https://doi.org/10.1017/S0960129525100248
[2] C. Bardomiano Martínez (2025): Exponentiable Functors between Synthetic ∞-Categories. Mathematical Structures in Computer Science 35. https://doi.org/10.1017/S0960129525100339
[3] U. Buchholtz, J. Weinberger (2023): Synthetic fibered (∞,1)-category theory. https://articles.math.cas.cz/10.21136/HS.2023.04, Higher Structures 7(1): 74–165
[4] D.-C. Cisinski, B. Cnossen, K. Nguyen, T. Walde (2026): Synthetic Category Theory. https://bastiaancnossen.com/books/synthetic-category-theory.pdf
[5] N. Kudasov: Rzk proof assistant. https://rzk-lang.github.io/
[6] N. Kudasov, E. Riehl, J. Weinberger (2024): Formalizing the ∞-Categorical Yoneda Lemma. In Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2024). Association for Computing Machinery, New York, NY, USA, 274–290. https://dl.acm.org/doi/10.1145/3636501.3636945
[7] D. Gratzer, J. Weinberger, U. Buchholtz (2024): Directed univalence in simplicial homotopy type theory. https://arxiv.org/abs/2407.09146
[8] D. Gratzer, J. Weinberger, U. Buchholtz (2025): The Yoneda embedding in simplicial type theory. In 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), https://ieeexplore.ieee.org/document/11186122/
[9] D. Gratzer, J. Weinberger, U. Buchholtz (2026): The ∞-Category of ∞-Categories in Simplicial Type Theory. In 41st Annual Symposium on Logic in Computer Science (LICS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 380, pp. 52:1-52:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026), https://doi.org/10.4230/LIPIcs.LICS.2026.52
[10] E. Riehl (2023): Could ∞-category theory be taught to undergraduates? Notices of the American Mathematical Society 70.5 (2023). https://dx.doi.org/10.1090/noti2692
[11] E. Riehl (2026): Synthetic Perspectives on Spaces and Categories. Proceedings of the International Congress of Mathematicians 2026 - Volume 4: Invited Lectures (Sections 5–8). https://epubs.siam.org/doi/10.1137/25M1806569
[12] E. Riehl, M. Shulman (2017): A type theory for synthetic ∞-categories. Higher Structures 1(1): 147-224. https://articles.math.cas.cz/10.21136/HS.2017.06
[13] R. Schellingerhout, D. Gratzer, J. Weinberger, U. Buchholtz (2026): For ♭-annotated types, Segal implies simplicial. https://www.danielgratzer.com/papers/segal-implies-simplicial.pdf
[14] S. Toth, F. Bakke, and contributors (2026): Agda Synthetic Categories. https://samtoth.github.io/agda-synthetic-categories Jonathan Weinberger: Universes in simplicial homotopy type theory](https://i.ytimg.com/vi/Xnq8zhNzyWI/mqdefault.jpg)
![Astra Kolomatskaia: Towards higher-dimensional syntax
Topos Institute Colloquium, 25th of June 2026.
———
Over the course of a visit to the Hausdorff Institute in May 2024, Kevin Carlson, Reed Mullanix, and I had the pleasure of being the first group in the world to use the newly public Narya proof assistant for substantive formalisation. Despite our recurring initial sense of our human brains are too puny for this labyrinthine complexity, we were successful in working out a toolbox of idioms that has since made reasoning about constructions in Displayed Type Theory [dTT] more tractable. By the end of the week, we arrived at a 73 non-whitespace loc definition of Kan complexes.
With six more lines, we can construct the singular semi-simplicial types and make the following theorem statement:
Sing.Kan (X : Type) : Kan (Sing X) := ?
This is an internal statement that types are ∞-groupoids; to give a term of this type would mean to get an internal uniform handle on all Kan filling operations associated to path-spaces.
We would like to prove this, and it is at this point that everything starts to go wrong!
The key distinction lies in the difference between a displayed and relative Kan structure. The former gives fillers of horns upstairs over prescribed fillers downstairs, while the latter gives fillers of horns upstairs over arbitrary fillers downstairs. This is related to the phenomenon in simplicial homotopy theory in which one is often forced to generalise theorems from the absolute case to the relative case. In dTT, however, the slice construction raises the degree of relativity, and one is then forced to generalise to working across all degrees of relativity at once.
In this talk, I will describe my work in progress with Reed Mullanix on constructing the missing shape/cofibration theory for dTT that would make such proofs possible. This will shift the notion of the syntax for a type theory to meaningfully constitute a higher dimensional object. Astra Kolomatskaia: Towards higher-dimensional syntax](https://i.ytimg.com/vi/XwGtQq-1gBI/mqdefault.jpg)