Related papers: Recursion does not always help
We derive new reduction formulas for the incomplete beta function and the Lerch transcendent in terms of elementary functions. As an application, we calculate some new integrals. Also, we use these reduction formulas to test the performance…
It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of…
We show that that a certain class of semi-proper iterations does not add omega-sequences. As a result, starting from suitable large cardinals one can obtain a model in which the Continuum Hypothesis holds and every function from omega_1 to…
An alternative class of the Lagrangian called the multiplicative form is suc- cessfully derived for a system with one degree of freedom for both non-relativistic and relativistic cases. This new Lagrangian can be considered as a…
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…
There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
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,…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…
We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…
The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…
The rules of canonical quantization normally offer good results, but sometimes they fail, e.g., leading to quantum triviality ($=$ free) for certain examples that are classically nontrivial ($\ne$ free). A new procedure, called Enhanced…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
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…
I review the three principal methods to assign meaning to recursion in process algebra: the denotational, the operational and the algebraic approach, and I extend the latter to unguarded recursion.
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…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
We define an extension of operator-valued positive definite functions from the real or complex setting to topological algebras, and describe their associated reproducing kernel spaces. The case of entire functions is of special interest,…
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…