Related papers: Uniqueness typing for intersection types

We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating.…

We define a type system with intersection types for an extension of lambda-calculus with unbind and rebind operators. In this calculus, a term with free variables, representing open code, can be packed into an "unbound" term, and passed…

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…

The Abella interactive theorem prover has proven to be an effective vehicle for reasoning about relational specifications. However, the system has a limitation that arises from the fact that it is based on a simply typed logic:…

Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…

We consider any classical Grassmannian geometry $\Gamma$; that is, any projective or polar Grassmann space. Suppose every line in $\Gamma$ contains $s+1$ points. Then we classify all sets of points in $\Gamma$ of cardinality $s+1$, with the…

The logical technique of focusing can be applied to the $\lambda$-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with $\beta\eta$-normal forms.…

Given a 2-crossing minimal chart $\Gamma$, a minimal chart with two crossings, set $\alpha=\min\{~i~|~$there exists an edge of label $i$ containing a white vertex$\}$, and $\beta=\max\{~i~|~$there exists an edge of label $i$ containing a…

Let $\Gamma$ be a subset of $\{0,1,2,...\}$. We show that if $\Gamma$ has `gaps' then the completeness and frame properties of the system $\{t^ke^{2\pi i nt}: n\in\mathbb{Z},k\in\Gamma\}$ differ from those of the classical exponential…

Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…

Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…

A theorem of Eilenberg establishes that there exists a bijection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts $S$ and a fixed…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…

In the finite dimensional case, mean-type mappings, their invariant means, relations between the uniqueness of invariant means and convergence of orbits of the mapping, are considered. In particular it is shown, that the uniqueness of an…

We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

We prove that for every tower $\mathcal T$ there are $\aleph_1$-dense $A$ and $B$ so that any ``reasonable" forcing notion $\mathbb{P}$ -- an adjective that includes all known ones -- for making $A$ and $B$ isomorphic will add a…

We prove that a C$^*$-algebra $A$ has uniform property $\Gamma$ if the set of extremal tracial states, $\partial_e T(A)$, is a non-empty compact space of finite covering dimension and for each $\tau \in \partial_e T(A)$, the von Neumann…

In this short notice we give a universal definition of $\Z_2$-module $Or(\Gamma)$ of orientations of a graph $\Gamma$ and construct a method, by means of which one can easily verify whenever two such special definitions coincide.