English
Related papers

Related papers: Combinatorial realizability models of type theory

200 papers

We give a new presentation of interactive realizability with a more explicit syntax. Interactive realizability is a realizability semantics that extends the Curry-Howard correspondence to (sub-)classical logic, more precisely to first-order…

Logic in Computer Science · Computer Science 2013-10-16 Giovanni Birolo

We investigate a framework of Krivine realizability with I/O effects, and present a method of associating realizability models to specifications on the I/O behavior of processes, by using adequate interpretations of the central concepts of…

Logic · Mathematics 2015-04-27 Jonas Frey

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

Logic · Mathematics 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

In this article the author endows the functor category [B(C2),Gpd] with the structure of a type-theoretic fibration category with a universe using the projective fibrations. It offers a new model of Martin-L\"of type theory with dependent…

Category Theory · Mathematics 2020-09-09 Anthony Bordg

We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…

Logic in Computer Science · Computer Science 2015-07-03 Thomas Seiller

We describe a non-extensional variant of Martin-L\"of type theory which we call two-dimensional type theory, and equip it with a sound and complete semantics valued in 2-categories.

Logic · Mathematics 2011-10-17 Richard Garner

We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…

Logic · Mathematics 2022-01-26 Hugo Moeneclaey

Recently, a class of interaction round the face (IRF) solvable lattice models were introduced, based on any rational conformal field theory (RCFT). We investigate here the connection between the general solvable IRF models and the fusion…

High Energy Physics - Theory · Physics 2008-02-03 Doron Gepner

In this paper we construct new categorical models for the identity types of Martin-L\"of type theory, in the categories Top of topological spaces and SSet of simplicial sets. We do so building on earlier work of Awodey and Warren, which has…

Logic · Mathematics 2011-10-17 Benno van den Berg , Richard Garner

The R-matrix formalism for the construction of integrable systems with infinitely many degrees of freedom is reviewed. Its application to Poisson, noncommutative and loop algebras as well as central extension procedure are presented. The…

Exactly Solvable and Integrable Systems · Physics 2016-02-18 Maciej Blaszak , Blazej M. Szablikowski

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

Rings and Algebras · Mathematics 2019-04-10 P. Ara , J. Bosa , E. Pardo

We study exponentiable functors in the context of synthetic $\infty$-categories. We do this within the framework of simplicial Homotopy Type Theory of Riehl and Shulman. Our main result characterizes exponentiable functors. In order to…

Category Theory · Mathematics 2025-11-25 César Bardomiano-Martínez

We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game…

Logic in Computer Science · Computer Science 2012-05-31 Thomas Seiller

We present a type theory dealing with non-linear, "ordinary" dependent types (which we will call cartesian) and linear types, where both constructs may depend on terms of the former. In the interplay between these, we find new type formers…

Logic · Mathematics 2018-06-29 Martin Lundfall

We prove a motivic version of Landweber's exact functor theorem from topology. The main result is that the assignment given by a Landweber-type formula using the MGL-homology of a motivic spectrum defines a homology theory on the stable…

Algebraic Geometry · Mathematics 2009-11-02 Niko Naumann , Paul Arne Østvær , Markus Spitzweck

We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…

Operator Algebras · Mathematics 2025-03-28 Bartosz K. Kwaśniewski , Ralf Meyer , Akshara Prasad

In a previous work, by extending the classical Quillen construction to the non-simply connected case, we have built a pair of adjoint functors, 'model' and 'realization', between the categories of simplicial sets and complete differential…

Algebraic Topology · Mathematics 2018-10-22 Urtzi Buijs , Yves Félix , Aniceto Murillo , Daniel Tanré

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

Representation Theory · Mathematics 2015-06-17 Steven V Sam , Andrew Snowden

This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…

cmp-lg · Computer Science 2007-05-23 Marc Dymetman

In this paper, we present a directed homotopy type theory for reasoning synthetically about (higher) categories, directed homotopy theory, and its applications to concurrency. We specify a new `homomorphism' type former for Martin-L\"of…

Logic in Computer Science · Computer Science 2018-07-30 Paige Randall North
‹ Prev 1 3 4 5 6 7 10 Next ›