Related papers: Deciding equivalence with sums and the empty type
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
The algebraic $\lambda$-calculus is an extension of the ordinary $\lambda$-calculus with linear combinations of terms. We establish that two ordinary $\lambda$-terms are equivalent in the algebraic $\lambda$-calculus iff they are…
This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective. We show how standard…
Precision tests of the Standard Model using $\beta$ decay have always relied on a careful choice of transition to minimize residual nuclear structure uncertainties. Following breakthroughs in nucleon-level radiative corrections in the last…
Convertibility checking - determining whether two lambda-terms are equal up to reductions - is a crucial component of proof assistants and dependently-typed languages. Practical implementations often use heuristics to quickly conclude that…
We give a complete and elementary proofs of "Jordan's sums" and study Euler's types sums. In particular we give a formula for the sum of series with same weight, which is similar to this one of classical 2-Euler's sums.
We study the properties, in particular termination, of dependent types systems for lambda calculus and rewriting.
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
For $\alpha\geq 0$, $\delta>0$, $\beta<1$ and $\gamma\geq 0$, the class $\mathcal{W}_{\beta}^\delta(\alpha,\gamma)$ consist of analytic and normalized functions $f$ along with the condition \begin{align*} {\rm Re\,}…
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
This work proposes a dependent type theory that combines functions and session-typed processes (with value dependencies) through a contextual monad, internalising typed processes in a dependently-typed lambda-calculus. The proposed…
This paper shows that the recent approach to quantitative typing systems for programming languages can be extended to pattern matching features. Indeed, we define two resource aware type systems, named U and E, for a lambda-calculus…
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by…
When are asymptotic approximations using the delta-method uniformly valid? We provide sufficient conditions as well as closely related necessary conditions for uniform negligibility of the remainder of such approximations. These conditions…
We have shown that the phenomenological models with a cosmological constant of the type $\Lambda=\beta(\frac{\ddot R}{R})$ and $\Lambda=3\alpha H^2$, where $R$ is the scale factor of the universe and $H$ is the Hubble constant, are…
We study convergence of operator families of the form $A_\beta = A + \beta B$ towards an effective operator defined on $\ker(B)$, as the coupling constant $\beta$ tends to infinity. Crucially, we focus on the setting where neither $A$ nor…
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak $\omega$-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory…