Related papers: Displayed Type Theory and Semi-Simplicial Types
Quantum-disordering a discrete-symmetry breaking state by condensing domain-walls can lead to a trivial symmetric insulator state. In this work, we show that if we bind a 1D representation of the symmetry (such as a charge) to the…
We show that any closed model category of simplicial algebras over an algebraic theory is Quillen equivalent to a proper closed model category. By ``simplicial algebra'' we mean any category of algebras over a simplicial algebraic theory,…
Implementing an idea due to John Baez and James Dolan we define new invariants of Whitney stratified manifolds by considering the homotopy theory of smooth transversal maps. To each Whitney stratified manifold we assign transversal homotopy…
We construct a discrete model of the homotopy theory of $S^1$-spaces. We define a category $\sP$ with objects composed of a simplicial set and a cyclic set along with suitable compatibility data. $\sP$ inherits a model structure from the…
This lecture note is intended to be a brief introduction to a recent development on the interplay between the ultradiscrete (or tropical) soliton systems and the combinatorial representation theory. We will concentrate on the simplest cases…
We introduce the simplest one-dimensional nonlinear model with the parity-time (PT) symmetry, which makes it possible to find exact analytical solutions for localized modes ("solitons"). The PT-symmetric element is represented by a…
Given any model category, or more generally any category with weak equivalences, its simplicial localization is a simplicial category which can rightfully be called the "homotopy theory" of the model category. There is a model category…
This book introduces a temporal type theory, the first of its kind as far as we know. It is based on a standard core, and as such it can be formalized in a proof assistant such as Coq or Lean by adding a number of axioms. Well-known…
We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions…
The homotopical information hidden in a supersymmetric structure is revealed by considering deformations of a configuration manifold. This is in sharp contrast to the usual standpoints such as Connes' programme where a geometrical structure…
In the context of dependent type theory, we show that coinductive predicates have an equivalent topological counterpart in terms of coinductively generated positivity relations, introduced by G. Sambin to represent closed subsets in…
In recent years, a new class of models for multi-agent epistemic logic has emerged, based on simplicial complexes. Since then, many variants of these simplicial models have been investigated, giving rise to different logics and…
We study simple type theory with primitive equality (STT) and its first-order fragment EFO, which restricts equality and quantification to base types but retains lambda abstraction and higher-order variables. As deductive system we employ a…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
Homotopy type theory is a formal language for doing abstract homotopy theory -- the study of identifications. But in unmodified homotopy type theory, there is no way to say that these identifications come from identifying the path-connected…
We make use of a higher version of the Yoneda embedding to construct, from a given quasicategory, a tribe, as a subcategory of a well-behaved simplicial model category, that presents the same $(\infty,1)$-category as the former…
Prototypical self-explainable classifiers have emerged to meet the growing demand for interpretable AI systems. These classifiers are designed to incorporate high transparency in their decisions by basing inference on similarity with…
GADTs were introduced in Haskell's eco-system more than a decade ago, but their interaction with several mainstream features such as type classes and functional dependencies has a lot of room for improvement. More specifically, for some…
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…