Related papers: Typability and Type Inference in Atomic Polymorphi…
Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…
We call an order type inscribable if it is realized by a point configuration where the extreme points are all on a circle. In this paper, we investigate inscribability of order types. We first show that every simple order type with at most…
We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…
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…
We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…
In this article the author endows the functor category [B(Z2),Gpd] with the structure of a type-theoretic fibration category with a univalent universe using the so-called injective model structure. It gives us a new model of Martin-L\"of…
Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap…
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
The invertibility hypothesis for a monoidal model category S asks that localizing an S-enriched category with respect to an equivalence results in an weakly equivalent enriched category. This is the most technical among the axioms for S to…
Bidirectional typing is a discipline in which the typing judgment is decomposed explicitly into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be…
This article first provides an algorithm W based type inference algorithm for an affine type system. Then the article further assumes the language equipped with the above type system uses lazy evaluation, and explores the possibility of…
This is a quick survey on the characteristic varieties associated to rank one local systems on a smooth, irreducible, quasi-projective complex variety $M$. A key new result is Proposition 1.8, giving additional information on the…
For each $\lambda\in\left]0,1\right]$ we exhibit an uncountable family of compact quantum groups $\mathbb{G}$ such that the von Neumann algebra $\mathsf{L}^{\!\infty}(\mathbb{G})$ is the injective factor of type $\mathrm{III}_\lambda$ with…
We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…
Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…