• Corpus ID: 119368046

# C-system of a module over a monad on sets 1

@article{Voevodsky2014CsystemOA,
title={C-system of a module over a monad on sets 1},
author={Vladimir Voevodsky},
journal={arXiv: Logic},
year={2014}
}
AbstractThis is the second paper in a series started in [13] which aims to provide mathematicaldescriptions of objects and constructions related to the rst few steps of the semantical theoryof dependent type systems.We construct for any pair ( M;LM ), where M is a monad on sets and LM is a left moduleover M , a C-system (\contextual category") CC ( M;LM ) and describe, using the results of [13]a class of sub-quotients of CC ( M;LM ) in terms of objects directly constructed from M and LM . In…
8 Citations
From Signatures to Monads in UniMath
• Computer Science, Mathematics
Journal of Automated Reasoning
• 2018
This work partially remedy the lack of inductive types by constructing some set-level datatypes and their associated induction principles from other type constructors and formalizes the untyped lambda calculus and the raw syntax of Martin-Löf type theory.
University of Birmingham From signatures to monads in UniMath
• Computer Science
• 2018
This work partially remedy the lack of inductive types by constructing some set-level datatypes and their associated induction principles from other type constructors, and formalizes the untyped lambda calculus and the raw syntax of Martin-Löf type theory.
Martin-Lof identity types in the C-systems defined by a universe category 1
This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the
Subsystems and regular quotients of C-systems
C-systems were introduced by J. Cartmell under the name "contextual categories". In this note we study sub-objects and quotient-objects of C-systems. In the case of the sub-objects we consider all
A C-system defined by a universe in a category
This is the third paper in a series started in 1406.7413. In it we construct, in a functorial way, a C-system $CC({\cal C},p)$ starting from a category $\cal C$ together with a morphism
Heterogeneous substitution systems revisited
• Computer Science
TYPES
• 2015
The analysis is extended by creating more categorical structure by organizing substitution systems into a category and studying its properties, and the proofs of the results of the cited paper and new ones in UniMath, a recent library of univalent mathematics formalized in the Coq theorem prover.
From functors between categories to homomorphisms of C-systems
We prove a theorem, motivated by a conjecture of Voevodsky on C-systems, that provides, under some assumptions, a lift of a functor with a C-system as domain and a category as codomain, to a
An introduction to univalent foundations for mathematicians
We offer an introduction for mathematicians to the univalent foundations of Vladimir Voevodsky, aiming to explain how he chose to encode mathematics in type theory and how the encoding reveals a

## References

SHOWING 1-10 OF 18 REFERENCES
Subsystems and regular quotients of C-systems
C-systems were introduced by J. Cartmell under the name "contextual categories". In this note we study sub-objects and quotient-objects of C-systems. In the case of the sub-objects we consider all
Notions of Computation and Monads
• E. Moggi
• Computer Science
Inf. Comput.
• 1991
Modules over Monads and Linearity
• Mathematics
WoLLIC
• 2007
In this paper, basic constructions of modules are presented and examples concerning in particular abstract syntax and lambda-calculus are shown.
Higher-Order Theories
• Computer Science, Mathematics
Encyclopedia of Continuum Mechanics
• 2020
A new general definition of arity is given, yielding the companion notion of signature, and a modularity result is obtained as requested by Ghani and Uustalu (2003): in this setting, merging two extensions of syntax corresponds to building an amalgamated sum.
Collection Principles in Dependent Type Theory
• Philosophy
TYPES
• 2000
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond
Constructive mathematics and computer programming
• P. Martin-Lof
• Computer Science
Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
• 1984
If programming is understood not as the writing of instructions for this or that computing machine but as the design of methods of computation that it is the computer’s duty to execute, then it no longer seems possible to distinguish the discipline of programming from constructive mathematics.