Related papers: The Lambda Calculus is Quantifiable
We construct a quantization of the moduli space $\mathcal{GH}_\Lambda(S\times\mathbb{R})$ of maximal globally hyperbolic Lorentzian metrics on $S\times \mathbb{R}$ with constant sectional curvature $\Lambda$, for a punctured surface $S$.…
Can the $\lambda$-calculus be considered a reasonable computational model? Can we use it for measuring the time $\textit{and}$ space consumption of algorithms? While the literature contains positive answers about time, much less is known…
We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…
Approximation semantics capture the observable behaviour of {\lambda}-terms, with B\"ohm Trees and Taylor Expansion standing as two central paradigms. Although conceptually different, these notions are related via the Commutation Theorem,…
In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…
Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the…
We study the mathematical structure of the notion of measurement space, which extends aspects of noncommutative topology that are based on quantale theory. This yields a geometric model of physical measurements that provides a realist…
In this paper, we discuss topological aspects of the space of valuations $\mathbb{V}$ and the valuative tree $\mathcal{T}(v,\Lambda)$. We present a relation between the weak tree topology and the Scott topology in $\mathcal{T}(v,\Lambda)$…
We introduce a proof language for Intuitionistic Multiplicative Additive Linear Logic (IMALL), extended with a modality B to capture mixed-state quantum computation. The language supports algebraic constructs such as linear combinations,…
We consider method-of-quantiles estimators of unknown parameters, namely the analogue of method-of-moments estimators obtained by matching empirical and theoretical quantiles at some probability level lambda in (0,1). The aim is to present…
In this paper we present two flavors of a quantum extension to the lambda calculus. The first one, $\lambda_\rho$, follows the approach of classical control/quantum data, where the quantum data is represented by density matrices. We provide…
The study of embeddings of smooth manifolds into Euclidean and projective spaces has been for a long time an important area in topology. In this paper we obtain improvements of classical results on embeddings of smooth manifolds, focusing…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
Let $\Lambda$ be the set of partitions of length $\geq 0$. We introduce an $\mathbb{N}$-graded algebra $\mathbb{A}_q^d(\Lambda)$ associated to $\Lambda$, which can be viewed as a quantization of the algebra of partitions defined by Reineke.…
Although the $\lambda$I-calculus is a natural fragment of the $\lambda$-calculus, obtained by forbidding the erasure of arguments, its equational theories did not receive much attention. The reason is that all proper denotational models…
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…