Related papers: A syntactical proof of the operational equivalence…
This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…
In this paper we introduce a typed, concurrent $\lambda$-calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we recover strong normalization. The proof is based on a…
The logical technique of focusing can be applied to the $\lambda$-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with $\beta\eta$-normal forms.…
We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…
We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…
In this paper, we expand the theory of Weierstrassian elliptic functions by introducing auxiliary zeta functions $\zeta_\lambda$, zeta differences of first kind $\Delta_\lambda$ and second kind $\Delta_{\lambda,\mu}$ where…
In this work we construct uniform asymptotic expansion of $\sn(t|m)$ - Jacobi when $m\to1-0$. The constructed expansion is valid over more than a half of period. The turning point is included into the interval of validity for the…
We consider the resolvent of a system of first order differential operators with a regular singularity, admitting a family of self-adjoint extensions. We find that the asymptotic expansion for the resolvent in the general case presents…
There is a well-known inclusion $\iota_\mathscr{E}$ of a topos $\mathscr{E}$ in the linguistic topos $\mathscr{T}(\Sigma)$ of its internal language $\Sigma$ that proves both toposes to be equivalent. There is also a canonical translation…
In this note we formulate and give a self-contained proof of the Yoneda lemma for infinity categories in the language of complete Segal spaces.
We prove the existence of entire functions that achieve universal approximations on certain countable sequences of translation operators .
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
We examine the exponentially improved asymptotic expansion of the Lerch zeta function $L(\lambda,a,s)=\sum_{n=1}^\infty \exp (2\pi ni\lambda)/(n+a)^s$ for large complex values of $a$, with $\lambda$ and $s$ regarded as parameters. It is…
We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e.,…
In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…
Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…
We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by…
We introduce a Morita type equivalence: two operator algebras $A$ and $B$ are called strongly $\Delta $-equivalent if they have completely isometric representations $\alpha $ and $\beta $ respectively and there exists a ternary ring of…
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…