A monoidal category of dependently sorted algebraic theories I: syntax
Abstract
This is the first of a pair of papers where we construct and investigate a closed monoidal structure on the category of generalized algebraic theories (in the sense of Cartmell). In the present text, as a starting point, we define the tensor product, , between two generalized algebraic theories and . This is done syntactically via an algorithm that uses the axioms of and in a recursive manner to produce those of . We provide examples of known structures that are recovered by our construction, such as tensor products of Lawvere theories, "cellular" products of dependent type signatures, and theories of diagrams and of displayed structures. It will be verified in the second volume that, as suggested by these special cases, the category of family-valued models is isomorphic to and to for certain contextual categories and whose underlying categories are equivalent to and to , respectively. Moreover, the cellular structure of the tensor product is obtained by combining, via a pushout-product operation, those of the two theories. We also construct a functor comparing the associated contextual categories, and describe isomorphisms of the forms and . In the sequel paper we will describe a universal property of , which will induce functoriality of the tensor product and thus allow us to check the monoidal category conditions.
Keywords
Cite
@article{arxiv.2511.13547,
title = {A monoidal category of dependently sorted algebraic theories I: syntax},
author = {Daniel Almeida},
journal= {arXiv preprint arXiv:2511.13547},
year = {2025}
}
Comments
119 pages