English
Related papers

Related papers: A syntactical proof of the operational equivalence…

200 papers

In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…

Logic · Mathematics 2026-05-28 Paolo Lipparini

We study increasingly expressive type systems, from $F^\mu$ -- an extension of the polymorphic lambda calculus with equirecursive types -- to $F^{\mu;}_\omega$ -- the higher-order polymorphic lambda calculus with equirecursive types and…

Logic in Computer Science · Computer Science 2023-01-23 Diana Costa , Andreia Mordido , Diogo Poças , Vasco T. Vasconcelos

We study a model of one-way quantum automaton where only measurement operations are allowed ($\mon$). We give an algebraic characterization of $\lmo(\Sigma)$, showing that the syntactic monoids of the languages in $\lmo(\Sigma)$ are exactly…

Formal Languages and Automata Theory · Computer Science 2013-09-30 Carlo Comin

In this paper we construct a family of holomorphic functions $\beta_\lambda (s)$ which are solutions to the asymptotic tetration equation. Each $\beta_\lambda$ satisfies the functional relationship ${\displaystyle \beta_\lambda(s+1) =…

Complex Variables · Mathematics 2021-06-01 James David Nixon

The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…

Logic in Computer Science · Computer Science 2015-07-01 Damiano Mazza

For a certain function $J(s)$ we prove that the identity $$\frac{\zeta(2s)}{\zeta(s)}-\left(s-\frac{1}{2}\right)J(s)=\frac{\zeta(2s+1)}{\zeta(s+1/2)}, $$ holds in the half-plane Re$(s)>1/2$ and both sides of the equality are analytic in…

Number Theory · Mathematics 2021-01-06 Douglas Azevedo

In this paper, some new results are reported for the study of Riemann zeta function $\zeta(s)$ in the critical strip $0<Re(s)<1$, such as $\zeta(s)$ expressed in a generalized Euler product only involving prime numbers. Particularly, some…

General Mathematics · Mathematics 2012-08-21 Wusheng Zhu

Expansion was invented at the end of the 1970s for calculating principal typings for $\lambda$-terms in type systems with intersection types. Expansion variables (E-variables) were invented at the end of the 1990s to simplify and help…

Logic · Mathematics 2009-05-14 Fairouz Kamareddine , Karim Nour , Vincent Rahli , J. B. Wells

Uniform upper bounds and the asymptotic expansion with an explicit remainder term are established for the Macdonald function $K_{i\tau}(x)$. The results can be applied, for instance, to study the summability of the divergent…

Classical Analysis and ODEs · Mathematics 2022-11-08 S. Yakubovich

We consider contractive operators $T$ that are trace class perturbations of a unitary operator $U$. We prove that the dimension functions of the absolutely continuous spectrum of $T$, $T^*$ and of $U$ coincide. In particular, if $U$ has a…

Functional Analysis · Mathematics 2022-05-20 Sergei Treil , Constanze Liaw

We study the nature of applicative bisimilarity in $\lambda$-calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide…

Logic in Computer Science · Computer Science 2022-07-22 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

We offer a simple direct proof of the unitarity of the Julia operator associated to a contraction $A$, from which follow the intertwining identity $(I - A A^*)^{1/2} A = A (I - A^* A)^{1/2}$ and the unitarity of Halmos dilations.

Functional Analysis · Mathematics 2018-03-28 P. L. Robinson

The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the…

Logic in Computer Science · Computer Science 2012-08-01 Ali Assaf , Simon Perdrix

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Logic in Computer Science · Computer Science 2023-06-22 James Laird

Given an observable and its operator product expansion (OPE), we present expressions that carefully disentangle truncated sums of the perturbative series in powers of $\alpha$ from the non-perturbative (NP) corrections. This splitting is…

High Energy Physics - Theory · Physics 2019-04-24 Cesar Ayala , Xabier Lobregat , Antonio Pineda

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

Dynamical Systems · Mathematics 2020-01-15 Ariel Rapaport

We prove a kind of a pumping lemma for languages accepted by one-register alternating finite-memory automata. As a corollary, we obtain that the set of lengths of words in such languages is semi-linear.

Formal Languages and Automata Theory · Computer Science 2025-12-30 Yoav Danieli

We prove certain conjecture holds true for a finite category which has M\"obius inversion. The conjecture states a relationship between the zeta function of a finite category and the Euler characteristic of a finite category.

Category Theory · Mathematics 2012-06-07 Kazunori Noguchi

Expansion was introduced at the end of the 1970s for calculating principal typings for $\lambda$-terms in intersection type systems. Expansion variables (E-variables) were introduced at the end of the 1990s to simplify and help mechanise…

Logic · Mathematics 2009-05-12 Fairouz Kamareddine , Karim Nour , Vincent Rahli , J. B. Wells