Related papers: Principal Types as Partial Involutions
In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Let $G$ be a simply connected semisimple group over $\mathbb{C}$. We show that a certain involution of an open subset of the affine Grassmannian of $G$, defined previously by Achar and the author, corresponds to the action of the nontrivial…
We introduce the notion of relation type of an affine algebra and prove that it is well defined by using the Jacobi-Zariski exact sequence of Andr\'e-Quillen homology. In particular, the relation type is an invariant of an affine algebraic…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
A type assignment system for lambda-calculus enjoys the principal typing property if every typable term M has a special typing, called principal, from which all typings for M can be obtained via suitable operations. The existence of…
The lambda-calculus with de Bruijn indices assembles each alpha-class of lambda-terms in a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism and can characterise normalisable…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
The well-known theory of "rational canonical form of an operator" describes the invariant factors, or elementary divisors, as a complete set of invariants of a similarity class of an operator on a finite-dimensional vector space $\V$ over a…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
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…
We revisit the most general theory for a massive vector field with derivative self-interactions, extending previous works on the subject to account for terms having trivial total derivative interactions for the longitudinal mode. In the…
We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…
I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…
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 state and prove a simple Theorem that allows one to generate invariant quantities in Metric-Affine Geometry, under a given transformation of the affine connection. We start by a general functional of the metric and the connection and…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We study, for plane complex branches of genus one, the topological type of its generic polar curve, as a function of the semigroup of values and the Zariski invariant of the branch. We improve some results given by Casas-Alvero in 2023,…