Related papers: La Valeur d'un Entier Classique en $\lambda\mu$-Ca…

We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda…

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

We discuss practical and some theoretical aspects of computing a database of classical modular forms in the L-functions and Modular Forms Database (LMFDB).

The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.

We present an elegant design of the core language in a dependently-typed lambda calculus with $\delta$-reduction and an elaboration algorithm.

Under the extension of Curry-Howard's correspondence to classical logic, Gentzen's NK and LK systems can be seen as syntax-directed systems of simple types respectively for Parigot's Lambda Mu Calculus and Curien-Herbelin's Lambda Bar Mu Mu…

We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{\lambda\mu}^{\nu}(q,t)$. Namely, we consider the case that the Kostka number $K_{\mu, \nu -\lambda}$ is $1$. This settles a particular…

In 1953 LeVeque proved the existence of $U_m$-numbers by showing that for some specially defined Liouville number $\lambda$, the $m$th root $\lambda^{1/m}$ is in $U_m$. In this article we study the following question: let $u$ be an…

We propose a $\lambda$-calculus-style formal language, called the $\mu$-syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behind the formalism by giving a complete step-by-step…

We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…

Efficient methods are proposed, for computing integrals appeaing in electronic structure calculations. The methods consist of two parts: the first part is to represent the integrals as contour integrals and the second one is to evaluate the…

Interactive behaviors are ubiquitous in modern cryptography, but are also present in $\lambda$-calculi, in the form of higher-order constructions. Traditionally, however, typed $\lambda$-calculi simply do not fit well into cryptography,…

A new numerical method for solving a scalar ordinary differential equation with a given initial condition is introduced. The method is using a numerical integration procedure for an equivalent integral equation and is called in this paper…

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…

There are several classical characterisations of the valuative dimension of a commutative ring. Constructive versions of this dimension have been given and proven to be equivalent to the classical notion within classical mathematics, and…

Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely…

This paper introduces a new numerical method for approximating the Lambert W function in the real domain. The method transforms the function into a simpler form that allows iterative refinement of an initial guess. Two iterative strategies…