activity
20182021
most citedRigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

8 papers

cs.LO2021

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…

cs.LO20211 cited

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…

cs.LO2021

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…

math.NA2019

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…

cs.LO2019

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…

cs.LO2018

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…