Related papers: Parametricity and Semi-Cubical Types
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Relational parametricity was first introduced by Reynolds for System F. Although System F provides a strong model for the type systems at the core of modern functional programming languages, it lacks features of daily programming practice…
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…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
We define here the category of partial differential equations. Special cases of morphisms from an object (equation) are symmetries of the equation and reductions of the equation by a symmetry groups, but there are many other morphisms. We…
We give a categorial definition separating cylindric-like algebras from polyadic-like ones. Viewing the neat reduct operator as a functor, we show that it does not have a right adjoint in the former case, but it is strongly invertible in…
We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…
We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…
In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…
This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…
We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
We construct a model structure on the category of cubical sets with connections whose cofibrations are the monomorphisms and whose fibrant objects are defined by the right lifting property with respect to inner open boxes, the cubical…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
The relationship according to which one physical theory encompasses the domain of empirical validity of another is widely known as "reduction." Here it is argued that one popular methodology for showing that one theory reduces to another,…
The filter quotient construction is a particular instance of a filtered colimit of categories. It has primarily been considered in the context of categorical logic, where it has been used effectively to construct non-trivial models, for…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…