Related papers: Upward confluence in the interaction calculus
In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We show that classical chaining bounds on the suprema of random processes in terms of entropy numbers can be systematically improved when the underlying set is convex: the entropy numbers need not be computed for the entire set, but only…
We use unbiased numerical methods to study the onset of pair superfluidity in a system that displays flat bands in the noninteracting regime. This is achieved by using a known example of flat band systems, namely the Creutz lattice, where…
Recent striking lattice results on strong interaction and bound states above T_c can be explained by the nonperturbative Q\bar Q potential, predicted more than a decade ago in the framework of the field correlator method. Explicit…
The dynamics of a sphere fluidized in a nearly-levitating upflow of air were previously found to be identical to those of a Brownian particle in a two-dimensional harmonic trap, consistent with a Langevin equation [Ojha {\it et al.}, Nature…
We extend the textual calculus for interaction nets by generic rules and propose constraints to preserve uniform confluence. Furthermore, we discuss the implementation of generic rules in the language inets, which is based on the…
We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without…
The primary method for showing that a given cubulated group is hierarchically hyperbolic is by constructing a factor system on the cube complex. In this paper we show that such a construction is not always possible, namely we construct a…
Intersection types are an essential tool in the analysis of operational and denotational properties of lambda-terms and functional programs. Among them, non-idempotent intersection types provide precise quantitative information about the…
The theory of inflation provides a mechanism to explain the structures we observe today in the Universe, starting from quantum-mechanically generated fluctuations. However, this leaves the question of: how did the quantum-to-classical…
Interactions between dark matter and dark energy with a given equation of state are known to modify the cosmic dynamics. On the other hand, the strength of these interactions is subject to strong observational constraints. Here we discuss a…
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability…
This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…
We provide analytical lower and upper bounds for entanglement of formation for bipartite systems, which give a direct relation between the bounds of entanglement of formation and concurrence, and improve the previous results. Detailed…
Since inflationary perturbations must generically couple to all degrees of freedom present in the early Universe, it is more realistic to view these fluctuations as an open quantum system interacting with an environment. Then, on very…
The Resource $\lambda$-calculus is a variation of the $\lambda$-calculus where arguments can be superposed and must be linearly used. Hence it is a model for linear and non-deterministic programming languages, and the target language of…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…
A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…