Related papers: Dynamic IFC Theorems for Free!
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads, they provide the basis on…
We explore denotational interpreters: denotational semantics that produce coinductive traces of a corresponding small-step operational semantics. By parameterising our denotational interpreter over the semantic domain and then varying it,…
Starting from Newton's equations of motion, we derive a dynamical density functional theory (DDFT) applicable to atomic liquids. The theory has the feature that it requires as input the Helmholtz free energy functional from equilibrium…
We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…
To put static program analysis at the fingertips of the software developer, we propose a framework for interactive abstract interpretation. While providing sound analysis results, abstract interpretation in general can be quite costly. To…
In this paper we introduce a cut-free sequent calculus for the alternation-free fragment of the modal $\mu$-calculus. This system allows for cyclic proofs and uses a simple focus mechanism to control the unravelling of fixpoints along…
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be…
In the present note we show that the recently established connections between soft theorems, large gauge transformations and memories are persistant in the infrared safe formulation of quantum field theory. They take a different and…
We investigate the emergence of infinite-dimensional symmetries in the absence of gauge invariance by analyzing massless scalar theories. We construct an infinite tower of charges that arise from the subleading equations of motion at null…
Scala's type system unifies ML modules, object-oriented, and functional programming. The Dependent Object Types (DOT) family of calculi has been proposed as a new foundation for Scala and similar languages. Unfortunately, it is not clear…
This paper considers the equilibrium-free stability and performance analysis of discrete-time nonlinear systems. We consider two types of equilibrium-free notions. Namely, the universal shifted concept, which considers stability and…
This paper deals with characterizing the freeness and asymptotic freeness of free multiple integrals with respect to a free Brownian motion or a free Poisson process. We obtain three characterizations of freeness, in terms of contraction…
Evaluating higher-order functional programs through abstract machines inspired by the geometry of the interaction is known to induce $\textit{space}$ efficiencies, the price being $\textit{time}$ performances often poorer than those…
Internal features from large-scale pre-trained diffusion models have recently been established as powerful semantic descriptors for a wide range of downstream tasks. Works that use these features generally need to add noise to images before…
We determine which faithful irreducible representations $V$ of a simple linear algebraic group $G$ are generically free for Lie($G$), i.e., which $V$ have an open subset consisting of vectors whose stabilizer in Lie($G$) is zero. This…
We show "free theorems" in the style of Wadler for polymorphic functions in homotopy type theory as consequences of the abstraction theorem. As an application, it follows that every space defined as a higher inductive type has the same…
In this short note we present several infinite dimensional theorems which generalize corresponding facts from the finite dimensional differential inclusions theory.
Translating expressions between different logics and theorem provers is notoriously and often prohibitively difficult, due to the large differences between the logical foundations, the implementations of the systems, and the structure of…
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem…