相关论文: On Upper Bounds on the Church-Rosser Theorem
We report on yet another formalization of the Church-Rosser property in lambda-calculi, carried out with the proof environment Beluga. After the well-known proofs of confluence for beta-reduction in the untyped settings, with and without…
We present a short proof of the Church-Rosser property for the lambda-calculus enjoying two distinguishing features: Firstly, it employs the Z-property, resulting in a short and elegant proof; and secondly, it is formalized in the nominal…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine? Is there a way to measure the computational complexity…
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calculus with conditional rewriting and provide general results in…
Terms in the lambda-calculus can be represented as planar trees decorated with symbols for abstraction and application, and having variables as leaves. In this paper, we concentrate on the branches of such trees, rather than on the trees…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…
The complex analytic methods have found a wide range of applications in the study of multiplicity-free representations. This article discusses, in particular, its applications to the question of restricting highest weight modules with…
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.…
Since it was realized that the Curry-Howard isomorphism can be extended to the case of classical logic as well, several calculi have appeared as candidates for the encodings of proofs in classical logic. One of the most extensively studied…
Higher-order beta-matching is the following decision problem: given two simply typed lambda-terms, can the first term be instantiated to be beta-equivalent to the second term? This problem was formulated by Huet in the 1970s and shown…
In this paper, we introduce the $\lambda\mu^{\wedge \vee}$- call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou which uses an extended parallel reduction…
We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs, projections and explicit type coercions. The calculus can be parametrized with different intersection type theories T, e.g. the Coppo-Dezani, the…
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
We establish a C^1,alpha Schauder estimate of a non-standard degenerate elliptic equation and use it to give another proof of the higher order boundary Harnack inequality. As an application, we obtain the analyticity of the free boundary in…
One of the central open questions in bounded arithmetic is whether Buss' hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss' theories using free logic and conjecture that such theories are…
We prove a central limit theorem for Birkhoff sums of the Rosen continued fraction algorithm. A Lasota-Yorke bound is obtained for general one-dimensional continued fractions with the bounded variation space, which implies quasi-compactness…
Most, if not all, unconditional results towards the abc-conjecture rely ultimately on classical Baker's method. In this article, we turn our attention to its elliptic analogue. Using the elliptic Baker's method, we have recently obtained a…
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…
Twenty years after its introduction by Ehrhard and Regnier, differentiation in $\lambda$-calculus and in linear logic is now a celebrated tool. In particular, it allows to establish a Taylor expansion formula for various $\lambda$-calculi,…