| Semantics of higher-order probabilistic programs with conditioning F Dahlqvist, D Kozen Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 63 | 2019 |
| Pointless learning F Clerc, V Danos, F Dahlqvist, I Garnier Foundations of Software Science and Computation Structures: 20th …, 2017 | 41 | 2017 |
| Layer by layer–combining monads F Dahlqvist, L Parlant, A Silva Theoretical Aspects of Computing–ICTAC 2018: 15th International Colloquium …, 2018 | 35 | 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 | 17 | 2018 |
| Semantics of probabilistic programming: A gentle introduction F Dahlqvist, A Silva, D Kozen Foundations of Probabilistic Programming, 1-42, 2020 | 15 | 2020 |
| Bayesian inversion by ω-complete cone duality F Dahlqvist, V Danos, I Garnier, O Kammar 27th international conference on concurrency theory (CONCUR 2016), 15 p., 2016 | 14 | 2016 |
| 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 | 11 | 2024 |
| 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 | 11 | 2021 |
| Compositional semantics for new paradigms: probabilistic, hybrid and beyond F Dahlqvist, R Neves arXiv preprint arXiv:1804.04145, 2018 | 11 | 2018 |
| Giry and the Machine F Dahlqvist, V Danos, I Garnier Electronic Notes in Theoretical Computer Science 325, 85-110, 2016 | 11 | 2016 |
| An internal language for categories enriched over generalised metric spaces F Dahlqvist, R Neves arXiv preprint arXiv:2105.08473, 2021 | 10 | 2021 |
| The positivication of coalgebraic logics F Dahlqvist, A Kurz arXiv preprint arXiv:1812.07288, 2018 | 9 | 2018 |
| How to write a coequation F Dahlqvist, T Schmid arXiv preprint arXiv:2109.11967, 2021 | 7 | 2021 |
| 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), 15 p., 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 |
| 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 | 5 | 2019 |
| 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 International Conference on Algebra and Coalgebra in Computer Science, 161-175, 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 |
Vincent DanosDirecteur de Recherches CNRS Ecole Normale SupérieureVahvistettu sähköpostiosoite verkkotunnuksessa ens.fr
