Related papers: Relational Parametricity and Control
We discuss and compare complexity measures for the modal $\mu$-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by…
Properties of metrics and pairs consisting of left and right connections are studied on the bimodules of differential 1-forms. Those bimodules are obtained from the derivation based calculus of an algebra of matrix valued functions, and an…
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calculus with conditional rewriting and provide general results in…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
We present $\cal L$, an extension of Parigot's $\lambda\mu$-calculus by adding negation as a type constructor, together with syntactic constructs that represent negation introduction and elimination. We will define a notion of reduction…
Boundedness properties of operators associated with non-degenerate symmetric $\alpha$-stable, $\alpha \in (1,2)$, probability measures on $\mathbb{R}^d$ are investigated on appropriate, Euclidean or otherwise, $L^p$-spaces, $p \in…
We consider the Calder\'on problem for systems with unknown zeroth and first order terms, and improve on previously known results. More precisely, let $(M, g)$ be a compact Riemannian manifold with boundary, let $A$ be a connection matrix…
Perturbative Symmetry Approach is formulated in symbolic representation. Easily verifiable integrability conditions of a given equation are constructed in the frame of the approach. Generalisation for the case of non-local and non-evolution…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…
This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…
This paper contributes to the theory of the modal $\mu$-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal $\mu$-calculus. For each of these…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
A relationship between partial derivatives of the associated Legendre function of the first kind with respect to its degree, $[\partial P_{\nu}^{m}(z)/\partial\nu]_{\nu=n}$, and to its order, $[\partial P_{n}^{\mu}(z)/\partial\mu]_{\mu=m}$,…
We consider one-parameter families of smooth uniformly contractive iterated function systems $\{f^\lambda_j\}$ on the real line. Given a family of parameter dependent measures $\{\mu_{\lambda}\}$ on the symbolic space, we study geometric…
In different Wolfenstein parametrizations derived from different exact parametrizations of the Cabibbo-Kobayashi-Maskawa matrix, we explicitly study seeming discrepancies between the matrix elements at the higher order of the expansion…
Although the notion of task similarity is potentially interesting in a wide range of areas such as curriculum learning or automated planning, it has mostly been tied to transfer learning. Transfer is based on the idea of reusing the…
Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We give a geometry of interaction model for a typed lambda-calculus endowed with operators for sampling from a continuous uniform distribution and soft conditioning, namely a paradigmatic calculus for higher-order Bayesian programming. The…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…