Related papers: Alpha-conversion for lambda terms with explicit we…
We construct affine algebras with an arbitrary amount of simple modules of each dimension.
We introduce a method for translating an alternating weak B\"uchi automaton (AWA), which corresponds to a Linear Dynamic Logic (LDL) formula, to an unambiguous B\"uchi automaton (UBA). Our translations generalise constructions for Linear…
Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects. Leveraging ideas from work on the…
For a set $\Gamma$, a function $\lambda:\Gamma\to \Gamma$ and a non-trivial abelian group $K$, the generalized shift $\sigma_\lambda:K^\Gamma\to K^\Gamma$ is defined by $(x_i)_{i\in \Gamma}\mapsto (x_{\lambda(i)})_{i\in\Gamma}$. In this…
Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…
We prove a characterization of first-order string-to-string transduction via $\lambda$-terms typed in non-commutative affine logic that compute with Church encoding, extending the analogous known characterization of star-free languages. We…
We give an explicit algorithm and source code for extracting equity risk factors from dead (a.k.a. "flatlined" or "hockey-stick") alphas and using them to improve performance characteristics of good (tradable) alphas. In a nutshell, we use…
The aim of this note is to show that weak relative hyperbolicity of a group relative to a subgroup (or relative hyperbolicity in the sense of Farb) does not imply any natural analogues of some well-known algebraic properties of ordinary…
We show that for a system containing a set of general second class constraints which are linear in the phase space variables, the Abelian conversion can be obtained in a closed form and that the first class constraints generate a…
We present a direct transformation of weak alternating $\omega$-automata into equivalent backward deterministic $\omega$-automata and show (1) how it can be used to obtain a transformation of non-deterministic B\"uchi automata into…
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…
We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and…
Alpha($^{4}$He)-cluster models have often been used to describe light nuclei. Towards the application to multi-cluster systems involving heavy clusters, we study the relative wave functions of the $\alpha+^{16}$O and $\alpha+^{40}$Ca…
Early work established convergence of the principal component estimators of the factors and loadings up to a rotation for large dimensional approximate factor models with weak factors in that the factor loading $\Lambda^{(0)}$ scales…
I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are…
A notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one…
The description of complex physical phenomena often involves sophisticated models that rely on a large number of parameters, with many dimensions and scales. One practical way to simplify that kind of models is to discard some of the…
We present a framework for reconstructing any simply connected, bounded or unbounded, quadrature domain $\Omega$ from its quadrature function $h$. Using the Faber transform, we derive formulae directly relating $h$ to the Riemann map for…