Related papers: Stability Property for the Call-by-Value $\lambda$…
We show that certain tilting results for quivers are formal consequences of stability, and as such are part of a formal calculus available in any abstract stable homotopy theory. Thus these results are for example valid over arbitrary…
Just as the $\lambda$-calculus uses three primitives (abstraction, application, variable) as the foundation of functional programming, inheritance-calculus uses three primitives (record, definition, inheritance) as the foundation of…
We establish $\mathcal{Z}$-stability for crossed products of outer actions of amenable groups on $\mathcal{Z}$-stable $C^*$-algebras under a mild technical assumption which we call McDuff property with respect to invariant traces. We obtain…
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the lambda-calculus to include higher-order global state, probabilistic and non-deterministic choice, and input and output, while retaining confluence. The…
For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…
The extensive deployment of probabilistic algorithms has radically changed our perspective on several well-established computational notions. Correctness is probably the most basic one. While a typical probabilistic program cannot be said…
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…
We consider the problem of computing the Value Adjustment of European contingent claims when default of either party is considered, possibly including also funding and collateralization requirements. As shown in Brigo et al. (\cite{BLPS},…
Computing reachability probabilities is at the heart of probabilistic model checking. All model checkers compute these probabilities in an iterative fashion using value iteration. This technique approximates a fixed point from below by…
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.
We propose a sigmoidal approximation for the value-at-risk (that we call SigVaR) and we use this approximation to tackle nonlinear programs (NLPs) with chance constraints. We prove that the approximation is conservative and that the level…
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of…
In this paper, we introduce and study the persistent approximation property for quantitative K-theory of filtered C*-algebras. In the case of crossed product C*-algebras, the persistent approximation property follows from the Baum-Connes…
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…
We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead the systems to past states. Similar to previous work on communicating transactions, liveness and safety respectively…
In this paper, we study the construction of Lyapunov functions based on first order approximations. In a first part, the study of local exponential stability property of a transverse invariant manifold is considered. This part is mainly a…
This paper develops 'covariant tomography', a local framework for solving Inverse Boundary Value Problems (IBVP) for parallel transport equation on star-shaped domains. By integrating geometric decomposition with specific interior…
We investigate numerically the model proposed in Sahoo et al [Phys. Rev. Lett. 118, 164501, (2017)] where a parameter $\lambda$ is introduced in the Navier-Stokes equations such that the weight of homochiral to heterochiral interactions is…
We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…