Related papers: Toward Isomorphism of Intersection and Union types
We extend the linear {\pi}-calculus with composite regular types in such a way that data containing linear values can be shared among several processes, if there is no overlapping access to such values. We describe a type reconstruction…
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…
We develop a Thurston-like theory to characterize geometrically finite rational maps, then apply it to study pinching and plumbing deformations of rational maps. We show that in certain conditions the pinching path converges uniformly and…
Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…
In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…
Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group action. Since the 19th century, studying the structure of various types of…
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…
We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…
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…
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
The Springer modules have a combinatorial property called ``coincidence of dimensions,'' i.e., the Springer modules are naturally decomposed into submodules with common dimensions. Morita and Nakajima proved the property by giving modules…
We classify conjugacy classes of involutions in the isometry groups of nondegenerate, symmetric bilinear forms over the field of two elements. The new component of this work focuses on the case of an orthogonal form on an even dimensional…
In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures. Its essence is captured by patterns of the form $x\,y$ which decompose a compound data structure into its…
An invariant of a model of genus one curve is a polynomial in the coefficients of the model that is stable under certain linear transformations. The classical example of an invariant is the discriminant, which characterizes the singularity…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
We introduce the structural resource lambda-calculus, a new formalism in which strongly normalizing terms of the lambda-calculus can naturally be represented, and at the same time any type derivation can be internally rewritten to its…
We use the notion of isomorphism between two invariant vector fields to shed new light on the issue of linearization of an invariant vector field near a relative equilibrium. We argue that the notion is useful in understanding the passage…