Related papers: Confluency property of the call-by-value $\lambda\…
We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired by the fully abstract models of O'Hearn, Riecke and…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
We give a brief introduction to the clocked lambda calculus, an extension of the classical lambda calculus with a unary symbol tau used to witness the beta-steps. In contrast to the classical lambda calculus, this extension is infinitary…
In this work, we will prove a uniqueness result for Calder\'on's inverse problem via some integral representation formulas for solutions of the Vekua equation in the framework of Clifford analysis.
We present a short proof of the gauge invariant uniqueness theorem for relative Cuntz-Pimsner algebras of C*-correspondences.
In this preprint we prove that any finite slope modular form fits into a p-adic family of modular forms which is indexed by the weight. Here, the term p-adic family means that p-adic congruences between weights entail certain p-adic…
In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size semantics to call-by-value rewriting: a class of algebraic…
By the same method introduced in [9], we calculate the Laplace transform of the celebrated cut-and-join equation of Mari\~no-Vafa formula discovered by C. Liu, K. Liu and J. Zhou [17]. Then, we study the applications of the polynomial…
We prove the murmuration phenomenon, which is a correlation between signs of functional equations and Fourier coefficients, in the case of modular forms in the weight aspect. We in particular improve the range of visibility of murmurations…
In this paper we investigate convergence for the Variational Iteration Method (VIM) which was introduced and described in \cite{He0},\cite{He1}, \cite{He2}, and \cite{He3}. We prove the convergence of the iteration scheme for a linear…
We show the following. \begin{theorem} Let $M$ be an finite-state ergodic time-reversible Markov chain with transition matrix $P$ and conductance $\phi$. Let $\lambda \in (0,1)$ be an eigenvalue of $P$. Then, $$\phi^2 + \lambda^2 \leq 1$$…
The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus that preserves confluent reduction and typed termination, while enabling both call-by-name and call-by-value reduction behaviour and encoding the…
A famous result by Milner is that the lambda-calculus can be simulated inside the pi-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between beta-reduction and how it…
We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF…
This paper re-organizes Vojta's proof of the Mordell conjecture (i.e. Faltings' theorem) in terms of Arakelov geometry. A new ingredient is to replace an application of Gillet--Soule's arithmetic Riemannn--Roch theorem by that of Yuan's…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
Source conditions of the type $x^\dag \in\mathcal{R}((A^\ast A)^\mu)$ are an important tool in the theory of inverse problems to show convergence rates of regularized solutions as the noise in the data goes to zero. Unfortunately, it is…
We investigate the possibility of a semantic account of the execution time (i.e. the number of \beta_v-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value {\lambda}-calculus. For…
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's lambda-mu, does not admit the Bohm Theorem, typical of the lambda-calculus. We…