Reference. Fat Cell Structures and Generalized Algebraic Theories

We give a new syntax-independent account of finitely-presented generalized algebraic theories (GATs) as finite cell complexes in the category of categories with families (CwFs), in which GATs are constructed by successive pushouts along the CwF morphisms generically postulating a sort, an operation, or an equation. Inspired by the fat small object argument of Makkai, Rosický, and Vokřínek, we introduce fat GAT presentations, thereby allowing infinite presentations with non-linear dependency structure. Then, motivated by wanting our GATs to self-describe, we extend presentations to admit infinitary arities, including infinitely deep dependency chains. Finally, we verify that these generalized GATs satisfy expected semantic properties including Frey’s Gabriel–Ulmer duality.

Cite

Cite as @huang-2026-fat (helia, typst) · \cite{huang-2026-fat} (LaTeX)
BibTeX
bibtex · 14 lines
@inproceedings{huang-2026-fat,
  doi = {10.4230/LIPICS.LICS.2026.58},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.58},
  author = {Huang, Xu and Angiuli, Carlo},
  keywords = {Generalized algebraic theories, quotient inductive-inductive types, categories with families, cell complexes, logical frameworks, Gabriel-Ulmer duality, Theory of computation → Categorical semantics, Theory of computation → Type theory},
  language = {en},
  title = {Fat Cell Structures and Generalized Algebraic Theories},
  volume = {380},
  pages = {58:1-58:27},
  publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
  year = {2026},
  copyright = {Creative Commons Attribution 4.0 International license},
  booktitle = {41st Annual Symposium on Logic in Computer Science (LICS 2026)}
}
hayagriva YAML (typst)
yaml · 16 lines
huang-2026-fat:
  type: article
  title: Fat Cell Structures and Generalized Algebraic Theories
  author:
  - Huang, Xu
  - Angiuli, Carlo
  date: 2026
  page-range: 58:1-58:27
  url: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.LICS.2026.58
  serial-number:
    doi: 10.4230/LIPICS.LICS.2026.58
  parent:
    type: proceedings
    title: 41st Annual Symposium on Logic in Computer Science (LICS 2026)
    publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    volume: 380
Cites 52 works (3 here)
With notes (3)

The Univalence Principle ahrens-2021-the

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a non-algebraic and space-based style, as well as models of higher-order theories such as topological spaces. In particular, we formulate a general definition of indiscernibility for objects of any such structure, and a corresponding univalence condition that generalizes Rezk’s completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences. Our work builds on Makkai’s First-Order Logic with Dependent Sorts, but is expressed in Voevodsky’s Univalent Foundations (UF), extending previous work on the Structure Identity Principle and univalent categories in UF. This enables indistinguishability to be expressed simply as identification, and yields a formal theory that is interpretable in classical homotopy theory, but also in other higher topos models. It follows that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky.
DOI · arXiv

Syntax and semantics of dependent types Hofmann_1997

DOI

Functorial Semantics of Algebraic Theories lawvere_1963

Web
External (49)
huang-2026-fat reference entries/refs/huang-2026-fat/huang-2026-fat.hel