Related papers: Modal Dependent Type Theory and Dependent Right Ad…

Suppose that $F: \mathcal{N} \to \mathcal{M}$ is a functor whose target is a Quillen model category. We give a succinct sufficient condition for the existence of the right-induced model category structure on $\mathcal{N}$ in the case when…

Dependent types offer great versatility and power, but developing proofs with them can be tedious and requires considerable human guidance. We propose to integrate Satisfiability Modulo Theories (SMT)-based refinement types into the…

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

To any left system of diagram categories or to any left pointed derivateur (in the sense of Grothendieck) a K-theory space is associated. This K-theory space is shown to be canonically an infinite loop space and to have a lot of common…

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

We classify C$^*$ near-group categories by using Vaughan Jones theory of subfactors and the Cuntz algebra endomorphisms. Our results show that there is a sharp contrast between two essentially different cases, integral and irrational cases.…

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculus'. This lambda-calculus is called modal type theory ---…

In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…

In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…

We give a new criterion guaranteeing existence of model structures left-induced along a functor admitting both adjoints. This works under the hypothesis that the functor induces idempotent adjunctions at the homotopy category level. As an…

We investigate how much type theory is able to prove about the natural numbers. A classical result in this area shows that dependent type theory without any universes is conservative over Heyting Arithmetic (HA). We build on this result by…

Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

Let $X$ be a simplicial set. We construct a novel adjunction between the categories of retractive spaces over $X$ and of $X_{+}$-comodules, then apply recent work on left-induced model category structures (arXiv:1401.3651v2…

We construct an abelian category C and exact functors in C which on the Grothendieck group descend to the action of a simply-laced quantum group in its adjoint representation. The braid group action in the adjoint representation lifts to an…

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…

Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type theory offers such a…

We define a notion of equivalence between algebraic dependent type theories which we call Morita equivalence. This notion has a simple syntactic description and an equivalent description in terms of models of the theories. The category of…

We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means…