Related papers: Lambda-calculus and Reversible Automatic Combinato…
We show that the principal types of the closed terms of the affine fragment of $\lambda$-calculus, with respect to a simple type discipline, are structurally isomorphic to their interpretations, as partial involutions, in a natural Geometry…
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…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
A general procedure of affinization of linear algebra structures is illustrated by the case of Leibniz algebras. Specifically, the definition of an affine Leibniz bracket, that is, a bi-affine operation on an affine space that at each…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
In this paper, we show that for a class of linearly constrained convex composite optimization problems, an (inexact) symmetric Gauss-Seidel based majorized multi-block proximal alternating direction method of multipliers (ADMM) is…
It is well-known that affine Hecke algebras are very useful to describe the smooth representations of any connected reductive p-adic group G, in terms of the supercuspidal representations of its Levi subgroups. The goal of this paper is to…
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 algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…
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…
The Lie algebra gl(lambda) dependent on the complex parameter lambda is a continuous version of the Lie algebra gl(inf) of infinite matrices with only finite number of nonzero entries. The gl(lambda) was first introduced by B.L.Feigin in…
We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
We give a geometric proof of inverse Hamiltonian reduction for all finite W-algebras in type $A$, a certain embedding of the finite W-algebra corresponding to an arbitrary nilpotent in $\mathfrak{gl}_N$ into that corresponding to a larger…
We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
Affine W-algebras are a somewhat complicated family of (topological) associative algebras associated with a semisimple Lie algebra, quantizing functions on the algebraic loop space of Kostant's slice. They have attracted a great deal of…
Affine matrix-ball construction (abbreviated AMBC) was developed by Chmutov, Lewis, Pylyavskyy, and Yudovina as an affine generalization of Robinson-Schensted correspondence. We show that AMBC gives a simple way to compute a distinguished…
We give a geometric proof of inverse Hamiltonian reduction for all affine W-algebras in type A at generic level, a certain embedding of the affine W-algebra corresponding to an arbitrary nilpotent in $\mathfrak{gl}_N$ into that…