English
Related papers

Related papers: Products of families of types and (Pi,lambda)-stru…

200 papers

We introduce the notion of a $(\Pi,\lambda)$-structure on a C-system and show that C-systems with $(\Pi,\lambda)$-structures are constructively equivalent to contextual categories with products of families of types. We then show how to…

Category Theory · Mathematics 2015-07-31 Vladimir Voevodsky

We define the notion of a (P,P-tilde)-structure on a universe p in a locally cartesian closed category category C with a binary product structure and construct a (Pi,lambda)-structure on the C-systems CC(C,p) from a (P,P-tilde)-structure on…

Category Theory · Mathematics 2017-06-13 Vladimir Voevodsky

C-systems were defined by Cartmell as the algebraic structures that correspond exactly to generalised algebraic theories. B-systems were defined by Voevodsky in his quest to formulate and prove an initiality conjecture for type theories.…

Category Theory · Mathematics 2025-02-12 Benedikt Ahrens , Jacopo Emmenegger , Paige Randall North , Egbert Rijke

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 sub-objects while in the case of the…

Logic · Mathematics 2016-03-16 Vladimir Voevodsky

This is a major update of the previous version. The methods of the paper are now fully constructive and the style is "formalization ready" with the emphasis on the possibility of formalization both in type theory and in constructive set…

Logic · Mathematics 2015-07-30 Vladimir Voevodsky

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 intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

Category Theory · Mathematics 2015-11-26 Juan Pablo Ramirez

We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…

Logic in Computer Science · Computer Science 2007-05-23 M. Dezani-Ciancaglini , F. Honsell , F. Alessi

The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension…

Logic in Computer Science · Computer Science 2023-10-20 Denis Cousineau , Gilles Dowek

Let $X$ be a product system over a quasi-lattice ordered groupoid $(G,P)$. Under mild hypotheses, we associate to $X$ a $C^*$-algebra which is couniversal for injective Nica covariant Toeplitz representations of $X$ which preserve the gauge…

Operator Algebras · Mathematics 2024-01-10 Massoud Amini , Mahdi Moosazadeh

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…

Logic · Mathematics 2014-09-30 Vladimir Voevodsky

We use product systems of $C^*$-correspondences to introduce twisted $C^*$-algebras of topological higher-rank graphs. We define the notion of a continuous $\mathbb{T}$-valued $2$-cocycle on a topological higher-rank graph, and present…

Operator Algebras · Mathematics 2021-07-30 Becky Armstrong , Nathan Brownlowe

We introduce basic notions in category theory to type theorists, including comprehension categories, categories with attributes, contextual categories, type categories, and categories with families along with additional discussions that are…

Logic in Computer Science · Computer Science 2022-04-05 Tesla Zhang

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…

Logic in Computer Science · Computer Science 2023-06-22 Frédéric Blanqui , Gilles Dowek , Emilie Grienenberger , Gabriel Hondet , François Thiré

We present a C-language implementation of the lambda-pi calculus by extending the (call-by-need) stack machine of Ariola, Chang and Felleisen to hold types, using a typeless- tagless- final interpreter strategy. It has the advantage of…

Programming Languages · Computer Science 2015-09-24 David M. Rogers

We define the notion of a $\Lambda$-system of $C^*$-correspondences associated to a higher-rank graph $\Lambda$. Roughly speaking, such a system assigns to each vertex of $\Lambda$ a $C^*$-algebra, and to each path in $\Lambda$ a…

Operator Algebras · Mathematics 2009-02-17 Valentin Deaconu , Alex Kumjian , David Pask , Aidan Sims

B-systems are algebras (models) of an essentially algebraic theory that is expected to be constructively equivalent to the essentially algebraic theory of C-systems which is, in turn, constructively equivalent to the theory of contextual…

Logic · Mathematics 2014-10-21 Vladimir Voevodsky

Let (G,P) be a quasi-lattice ordered group and let X be a compactly aligned product system over P of Hilbert bimodules. Under mild hypotheses we associate to X a C*-algebra which we call the Cuntz-Nica-Pimsner algebra of X. Our construction…

Operator Algebras · Mathematics 2009-01-08 Aidan Sims , Trent Yeend

In this paper we attempt to present a very general approach to the study of structures (somehow) defined on a set $X$ by a family of maps $d: X \times X \mapsto \mathbb{R}^+$. It will be shown how the assignment of a preorder $\prec_{\Pi}$…

General Mathematics · Mathematics 2024-04-08 Tullio Valent

The lambda-cube is a famous pure type system (PTS) cube of eight powerful explicit type systems that include the simple, polymorphic and dependent type theories. The lambda-cube only types Strongly Normalising (SN) terms but not all of…

Logic in Computer Science · Computer Science 2024-05-02 Fairouz Kamareddine , Joe Wells
‹ Prev 1 2 3 10 Next ›