A monoidal category of dependently sorted algebraic theories I: syntax
Daniel Almeida

TL;DR
This paper introduces a syntactic construction of a tensor product for generalized algebraic theories, establishing a monoidal structure that unifies various known algebraic and type-theoretic frameworks.
Contribution
It defines a tensor product of algebraic theories syntactically and explores its properties, laying groundwork for a monoidal category structure on these theories.
Findings
Defined tensor product via recursive axioms
Recovered known structures like Lawvere theories
Established isomorphisms and cellular structures
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 …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models · Logic, programming, and type systems
