Semantics of higher-order probabilistic programs with conditioning F Dahlqvist, D Kozen Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 62 | 2019 |
Pointless learning F Clerc, V Danos, F Dahlqvist, I Garnier Foundations of Software Science and Computation Structures: 20th …, 2017 | 43 | 2017 |
Layer by layer–combining monads F Dahlqvist, L Parlant, A Silva Theoretical Aspects of Computing–ICTAC 2018: 15th International Colloquium …, 2018 | 34 | 2018 |
Borel kernels and their approximation, categorically F Dahlqvist, A Silva, V Danos, I Garnier Electronic Notes in Theoretical Computer Science 341, 91-119, 2018 | 18 | 2018 |
Semantics of probabilistic programming: A gentle introduction F Dahlqvist, A Silva, D Kozen Foundations of Probabilistic Programming, 1-42, 2020 | 17 | 2020 |
Bayesian inversion by ω-complete cone duality F Dahlqvist, V Danos, I Garnier, O Kammar 27th International Conference on Concurrency Theory, 2016 | 15 | 2016 |
The positivication of coalgebraic logics F Dahlqvist, A Kurz arXiv preprint arXiv:1812.07288, 2018 | 14 | 2018 |
Rigorous roundoff error analysis of probabilistic floating-point computations G Constantinides, F Dahlqvist, Z Rakamarić, R Salvia International Conference on Computer Aided Verification, 626-650, 2021 | 12 | 2021 |
Giry and the Machine F Dahlqvist, V Danos, I Garnier Electronic Notes in Theoretical Computer Science 325, 85-110, 2016 | 12 | 2016 |
Compositional semantics for new paradigms: probabilistic, hybrid and beyond F Dahlqvist, R Neves arXiv preprint arXiv:1804.04145, 2018 | 11 | 2018 |
An internal language for categories enriched over generalised metric spaces F Dahlqvist, R Neves arXiv preprint arXiv:2105.08473, 2021 | 10 | 2021 |
What Makes a Good Prune? Maximal Unstructured Pruning for Maximal Cosine Similarity G Mason-Williams, F Dahlqvist The Twelfth International Conference on Learning Representations, 2024 | 9 | 2024 |
How to write a coequation F Dahlqvist, T Schmid arXiv preprint arXiv:2109.11967, 2021 | 7 | 2021 |
A probabilistic approach to floating-point arithmetic F Dahlqvist, R Salvia, GA Constantinides 2019 53rd Asilomar Conference on Signals, Systems, and Computers, 596-602, 2019 | 7 | 2019 |
Some sahlqvist completeness results for coalgebraic logics F Dahlqvist, D Pattinson Foundations of Software Science and Computation Structures: 16th …, 2013 | 7 | 2013 |
Robustly parameterised higher-order probabilistic models F Dahlqvist, V Danos, I Garnier 27th International Conference on Concurrency Theory (CONCUR 2016), 2016 | 6 | 2016 |
The syntactic side of autonomous categories enriched over generalised metric spaces F Dahlqvist, R Neves Logical Methods in Computer Science 19, 2023 | 5 | 2023 |
Completeness via canonicity for distributive substructural logics: a coalgebraic perspective F Dahlqvist, D Pym International Conference on Relational and Algebraic Methods in Computer …, 2015 | 5 | 2015 |
On the fusion of coalgebraic logics F Dahlqvist, D Pattinson Algebra and Coalgebra in Computer Science: 4th International Conference …, 2011 | 5 | 2011 |
Coalgebraic completeness-via-canonicity for distributive substructural logics F Dahlqvist, D Pym Journal of logical and algebraic methods in programming 93, 1-22, 2017 | 3 | 2017 |