[Paper Review] C-system of a module over a monad on sets

Vladimir Voevodsky|arXiv (Cornell University)|Jan 1, 2014

Logic, programming, and type systems9 references6 citations

TL;DR

This paper constructs a C-system (contextual category) from a monad on sets and a left module over it, providing a general categorical framework for modeling dependent type theories. It characterizes sub-quotients of this C-system using structures directly derived from the monad and module, and applies the construction to nominal signatures, recovering C-systems for generalized algebraic and Martin-Löf type theories via α-equivalence classes of judgements.

ABSTRACT

This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where $R$ is a monad on sets and $LM$ is a left module over $R$, a C-system (contextual category) $CC(R,LM)$ and describe a class of sub-quotients of $CC(R,LM)$ in terms of objects directly constructed from $R$ and $LM$. In the special case of the monads of expressions associated with nominal signatures this construction gives the C-systems of general dependent type theories when they are specified by collections of judgements of the four standard kinds.

Motivation & Objective

• To provide a general categorical construction of C-systems from monads on sets and left modules over them.
• To characterize all C-subsystems and regular quotients of the constructed C-system in terms of data directly from the monad and module.
• To apply the construction to syntactic pairs arising from nominal signatures, recovering C-systems for dependent type theories.
• To formalize the semantics of Martin-Löf-type judgements (e.g., context formation, type formation) using the framework of monads and modules.
• To show that the four standard judgement forms in dependent type theory correspond precisely to regular congruence relations and sub-C-systems in the constructed C-system.

Proposed method

• Constructs a C-system CC(R, LM) from a monad R on sets and a left R-module LM with values in sets.
• Uses the results of [15] to describe all C-subsystems and regular quotients of CC(R, LM) via structures derived from R and LM.
• Defines operations σ and eσ on CC(R, LM) and studies regular congruence relations compatible with these operations.
• Applies the framework to nominal signatures, where R(X) and LM(X) are sets of α-equivalence classes of expressions with free variables in X.
• Identifies the four standard judgement forms (context, type, type equality, term equality) with subsets C, eC, Ceq, gCeq of the C-system.
• Shows that any sub-C-system with a regular congruence relation gives rise to such a four-tuple of subsets, and vice versa.

Experimental results

Research questions

• RQ1 How can a C-system be systematically constructed from a monad on sets and a left module over it?
• RQ2 What is the complete characterization of all C-subsystems and regular quotients of such a C-system in terms of the monad and module?
• RQ3 How do the four standard judgement forms in dependent type theory (context, type, type equality, term equality) arise from the categorical structure of the constructed C-system?
• RQ4 Can the C-systems of generalized algebraic and Martin-Löf type theories be recovered as special instances of this construction?
• RQ5 What is the role of α-equivalence and nominal signatures in the categorical semantics of dependent type systems?

Key findings

• The construction CC(R, LM) yields a C-system for any monad R on sets and left R-module LM, providing a general framework for type-theoretic semantics.
• All C-subsystems and regular quotients of CC(R, LM) are completely characterized by data directly associated with R and LM, via the machinery of [15].
• The four standard judgement forms in dependent type theory correspond bijectively to specific subsets C, eC, Ceq, gCeq of CC(R, LM), when R and LM are derived from nominal signatures.
• For the λ-calculus signature, the construction recovers the C-system of the pure type theory with α-equivalence classes of λ-terms.
• The framework shows that the full monadic structure of substitution is not recoverable from typed λ-calculus encodings, justifying the use of monads and modules for syntax with binding.
• The construction generalizes known C-systems of generalized algebraic theories and Martin-Löf type theory as special cases, unifying their semantics under a single categorical framework.