Related papers: Strong normalization of lambda-Sym-Prop- and lambd…
Instead of developing a customized typed lambda-calculus for each theory, we attempt to design a general parametric calculus that permits to express the proofs of any theory. This way, the problem of expressing proofs in the lambda-calculus…
The confluence of untyped \lambda-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of \lambda-calculus with conditional rewriting and provide general results in two directions.…
We introduce a new normalization condition for symplectic capacities, which we call cube normalization. This condition is satisfied by the Lagrangian capacity and the cube capacity. Our main result is an analogue of the strong Viterbo…
In 2016 and 2017, Haihui Fan, Don Hadwin and Wenjing Liu proved a commutative and noncommutative version of Beurling's theorems for a continuous unitarily invariant norm $\alpha $ on $L^{\infty}(\mathbb{T},\mu)$ and tracial finite von…
Recent studies on stability and contractivity have highlighted the importance of semi-inner products, which we refer to as pairings, associated with general norms. A pairing is a binary operation that relates the derivative of a curve's…
In a recent paper, Herbelin developed dPA${^\omega}$, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the memoization of choice functions. However, the property of normalization…
We have previously published the Isabelle/HOL formalization of a general theory of syntax with bindings. In this companion paper, we instantiate the general theory to the syntax of lambda-calculus and formalize the development leading to…
To support the understanding of declarative probabilistic programming languages, we introduce a lambda-calculus with a fair binary probabilistic choice that chooses between its arguments with equal probability. The reduction strategy of the…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive…
In [8], P. Lecomte conjectured the existence of a natural and projectively equivariant quantization. In [1], M. Bordemann proved this existence using the framework of Thomas-Whitehead connections. In [9], we gave a new proof of the same…
This article relaxes the integrability condition imposed in the literature for the robust $\alpha$-stable central limit theorem under sublinear expectation. Specifically, for $\alpha \in(0,1]$, we prove that the normalized sums of i.i.d.…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…
Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…
On montre comment les conjectures d'Arthur permettent de calculer les points de r\'eductibilit\'e pour les induites de cuspidales des groupes classiques. Les conjectures d'Arthur utilis\'ees portent sur l'existence d'un rel\`evement faible…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
We produce a flat $\Lambda$-module of $\Lambda$-adic critical slope overconvergent modular forms, producing a Hida-type theory that interpolates such forms over $p$-adically varying integer weights. This provides a Hida-theoretic…
The two-way modal mu-calculus is the extension of the (standard) one-way mu-calculus with converse (backward-looking) modalities. For this logic we introduce two new sequent-style proof calculi: a non-wellfounded system admitting infinite…
In this paper, we apply the saddle-point method in conjunction with the theory of the N$\ddot{o}$rlund-Rice integrals to derive a precise asymptotic formula for the generalized Li coefficients established by Omar and Mazhouda. Actually, for…