Related papers: Bounding normalization time through intersection t…
We consider non-colliding Brownian bridges starting from two points and returning to the same position. These positions are chosen such that, in the limit of large number of bridges, the two families of bridges just touch each other forming…
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming…
We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…
The border-collision normal form describes the local dynamics in continuous systems with switches when a fixed point intersects a switching surface. For one-dimensional cases where the bifurcation creates or destroys only fixed points and…
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…
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,…
We derive a variational expression for the correlation time of physical observables in steady-state diffusive systems. As a consequence of this variational expression, we obtain lower bounds on the correlation time, which provide speed…
We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…
Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…
We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this…
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial…
It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-term in the worst case. We consider the following relevant…
This work obtains sharp closed-form exponential concentration inequalities of Bernstein type for the ubiquitous beta distribution, improving upon sub-gaussian and sub-gamma bounds previously studied in this context. The proof leverages a…
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…
We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…
If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…
The general relation between the standard expansion coefficients and the beta function for the QCD coupling is exactly derived in a mathematically strict way. It is accordingly found that an infinite number of logarithmic terms are lost in…
We propose a geometric approach for bounding average stopping times for stopped random walks in discrete and continuous time. We consider stopping times in the hyperspace of time indexes and stochastic processes. Our techniques relies on…