Related papers: La Valeur d'un Entier Classique en $\lambda\mu$-Ca…
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
The theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are…
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational…
In this paper we describe a deep learning--based probabilistic algorithm for integer factorisation. We use Lawrence's extension of Fermat's factorisation algorithm to reduce the integer factorisation problem to a binary classification…
This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
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…
Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in…
We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive…
We give a proper fractional extension of the classical calculus of variations. Necessary optimality conditions of Euler-Lagrange type for variational problems containing both classical and fractional derivatives are proved. The fundamental…
A simple recipe for revealing classical-like contributions in optical potential cross sections is proposed. The recipe is based on the fact that the classical-like properties are not expected to depend on the actual value of $\hbar$. This…
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…
Existing Curry-Howard interpretations of call-by-value evaluation for the $\lambda$-calculus are either based on ad-hoc modifications of intuitionistic proof systems or involve additional logical concepts such as classical logic or linear…
We discuss two numerical methods, based on a path integral approach described in a previous paper (I), for solving the stochastic equations underlying the financial markets: the Monte Carlo approach, and the Green function deterministic…
In this papier, by the classical umbral calculus method, we establish identities involving the Appell polynomials and extend some existing identities.
In this paper, we develop general machinery for computing the classifying ring $L^A$ of one-dimensional formal $A$-modules, for various commutative rings $A$. We then apply the machinery to obtain calculations of $L^A$ for various number…
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…
Just as the $\lambda$-calculus uses three primitives (abstraction, application, variable) as the foundation of functional programming, inheritance-calculus uses three primitives (record, definition, inheritance) as the foundation of…
In this paper, we consider a kind of singular integral which can be viewed as an extension of the classical Calder$\acute{\rm o}$n-Zygmund type singular integral. We establish an estimate of the singular integral in the $L^q$ space for…
The extensive deployment of probabilistic algorithms has radically changed our perspective on several well-established computational notions. Correctness is probably the most basic one. While a typical probabilistic program cannot be said…