Related papers: La Valeur d'un Entier Classique en $\lambda\mu$-Ca…
A $\lambda$-calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptographic constructions and adversaries for them, even when…
We introduce $\mathsf{LEM}$, a type-assignment system for the linear $ \lambda $-calculus that extends second-order $\mathsf{IMLL}_2$, i.e., intuitionistic multiplicative Linear Logic, by means of logical rules that weaken and contract…
How can relevant information be extracted from a quantum process? In many situations, only some part of the total information content produced by an information source is useful. Can one then find an efficient encoding, in the sense of…
The Fundamental Theorem of Integral Calculus links the integrand and its antiderivative via a simple first order differential equation. A numerical solution of this ode yields the antiderivative and hence the required integral. This…
The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…
This paper provides foundations for strong (that is, possibly under abstraction) call-by-value evaluation for the lambda-calculus. Recently, Accattoli et al. proposed a form of call-by-value strong evaluation for the lambda-calculus, the…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…
We present, in a pedagogical style, many instances of reduction procedures appearing in a variety of physical situations, both classical and quantum. We concentrate on the essential aspects of any reduction procedure, both in the algebraic…
We compute the critical $L$-values of some weight 3, 4, or 5 modular forms, by transforming them into integrals of the complete elliptic integral $K$. In doing so, we prove closed form formulas for some moments of $K'^3$. Many of our…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
Calculating the expected number of misclassified outcomes is a standard problem of particular interest for rare-event searches. The Clopper-Pearson method allows calculation of classical confidence intervals on the amount of…
The classical fields with fractional derivatives are investigated by using the fractional Lagrangian formulation.The fractional Euler-Lagrange equations were obtained and two examples were studied.
An elementary method of computing the values at negative integers of the Riemann zeta function is presented. The principal ingredient is a new q-analogue of the Riemann zeta function. We show that for any argument other than 1 the classical…
The three-dimensional Schredinger's equation is analyzed with the help of the correspondence principle between classical and quantum-mechanical quantities. Separation is performed after reduction of the original equation to the form of the…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
We give a proper fractional extension of the classical calculus of variations by considering variational functionals with a Lagrangian depending on a combined Caputo fractional derivative and the classical derivative. Euler-Lagrange…