5 citations · 9 across the 9 of their papers we have counts for
14 papers
Deterministic stream-sampling for probabilistic programming: semantics and verification
Fredrik Dahlqvist, Alexandra Silva, William Smith
Probabilistic programming languages rely fundamentally on some notion of sampling, and this is doubly true for probabilistic programming languages which perform Bayesian inference…
A Complete V-Equational System for Graded lambda-Calculus
Fredrik Dahlqvist, Renato Neves
Modern programming frequently requires generalised notions of program equivalence based on a metric or a similar structure. Previous work addressed this challenge by introducing th…
The syntactic side of autonomous categories enriched over generalised metric spaces
Fredrik Dahlqvist, Renato Neves
Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence e…
How to write a coequation
Fredrik Dahlqvist, Todd Schmid
There is a large amount of literature on the topic of covarieties, coequations and coequational specifications, dating back to the early seventies. Nevertheless, coequations have n…
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations
George Constantinides, Fredrik Dahlqvist, Zvonimir Rakamaric +1
We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated wi…
An Internal Language for Categories Enriched over Generalised Metric Spaces
Fredrik Dahlqvist, Renato Neves
Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence e…
A Probabilistic Approach to Floating-Point Arithmetic
Fredrik Dahlqvist, Rocco Salvia, George A Constantinides
Finite-precision floating point arithmetic unavoidably introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be…
Semantics of higher-order probabilistic programs with conditioning
Fredrik Dahlqvist, Dexter Kozen
We present a denotational semantics for higher-order probabilistic programs in terms of linear operators between Banach spaces. Our semantics is rooted in the classical theory of B…
The positivication of coalgebraic logics
Fredrik Dahlqvist, Alexander Kurz
We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically comput…
Compositional semantics for new paradigms: probabilistic, hybrid and beyond
Fredrik Dahlqvist, Renato Neves
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming construct…
Borel Kernels and their Approximation, Categorically
Fredrik Dahlqvist, Vincent Danos, Ilias Garnier +1
This paper introduces a categorical framework to study the exact and approximate semantics of probabilistic programs. We construct a dagger symmetric monoidal category of Borel ker…
Layer by layer - Combining Monads
Fredrik Dahlqvist, Louis Parlant, Alexandra Silva
We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concret…
Completeness-via-canonicity for coalgebraic logics
Fredrik Dahlqvist
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibili…
Coalgebraic completeness-via-canonicity for distributive substructural logics
Fredrik Dahlqvist, David Pym
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicit…