Related papers: Coalgebraic Infinite Traces and Kleisli Simulation…
By formulating the inverse problem of partial differential equations (PDEs) as a statistical inference problem, the Bayesian approach provides a general framework for quantifying uncertainties. In the inverse problem of PDEs, parameters are…
We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…
The spin analogues of several classical concepts and results for Hecke algebras are established. A Frobenius type formula is obtained for irreducible characters of the Hecke-Clifford algebra. A precise characterization of the trace…
We study Kleene iteration in the categorical context. A celebrated completeness result by Kozen introduced Kleene algebra (with tests) as a ubiquitous tool for lightweight reasoning about program equivalence, and yet, numerous variants of…
Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification…
The stochastic interpretation of Parikh's game logic should not follow the usual pattern of Kripke models, which in turn are based on the Kleisli morphisms for the Giry monad, rather, a specific and more general approach to probabilistic…
We introduce a twisted relative trace formula which simultaneously generalizes the twisted trace formula of Langlands et.al. (in the quadratic case) and the relative trace formula of Jacquet and Lai. Certain matching statements relating…
We develop the framework of Linear Simulation-based Inference (LSBI), an application of simulation-based inference where the likelihood is approximated by a Gaussian linear function of its parameters. We obtain analytical expressions for…
We prove that, over Kripke-Platek set theory with infinity (KP), transfinite induction along the ordinal ${\epsilon}_{\Omega+1}$ is equivalent to the schema asserting the soundness of KP, where $\Omega$ denotes the supremum of all ordinals…
Given a henselian pair $(R, I)$ of commutative rings, we show that the relative $K$-theory and relative topological cyclic homology with finite coefficients are identified via the cyclotomic trace $K \to \mathrm{TC}$. This yields a…
Understanding when and how linguistic knowledge emerges during language model training remains a central challenge for interpretability. Most existing tools are post hoc, rely on scalar metrics, or require nontrivial integration effort,…
We examine an analytic variational inference scheme for the Gaussian Process State Space Model (GPSSM) - a probabilistic model for system identification and time-series modelling. Our approach performs variational inference over both the…
We propose SETI (Systematicity Evaluation of Textual Inference), a novel and comprehensive benchmark designed for evaluating pre-trained language models (PLMs) for their systematicity capabilities in the domain of textual inference.…
We show that in any symmetric monoidal category, if a weight for colimits is absolute, then the resulting colimit of any diagram of dualizable objects is again dualizable. Moreover, in this case, if an endomorphism of the colimit is induced…
We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius…
The problem of model identification for linear systems is considered, using a finite set of sampled data affected by a bounded measurement noise, with unknown bound. The objective is to identify one-step-ahead models and their accuracy in…
Trace theory is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by individual program threads. Its simplicity, elegance, and…
Milner (1984) defined a process semantics for regular expressions. He formulated a sound proof system for bisimilarity of process interpretations of regular expressions, and asked whether this system is complete. We report conceptually on a…