Fredrik Dahlqvist

Orcid: 0000-0003-2555-0490

According to our database1, Fredrik Dahlqvist authored at least 26 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
What Makes a Good Prune? Maximal Unstructured Pruning for Maximal Cosine Similarity.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
The syntactic side of autonomous categories enriched over generalised metric spaces.
Log. Methods Comput. Sci., 2023

A Complete V-Equational System for Graded lambda-Calculus.
Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

Deterministic stream-sampling for probabilistic programming: semantics and verification.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
The syntactic dual of autonomous categories enriched over generalised metric spaces.
CoRR, 2022

An Internal Language for Categories Enriched over Generalised Metric Spaces.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
How to write a coequation.
CoRR, 2021

Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

How to Write a Coequation ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Semantics of higher-order probabilistic programs with conditioning.
Proc. ACM Program. Lang., 2020

2019
A Probabilistic Approach to Floating-Point Arithmetic.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Borel Kernels and their Approximation, Categorically.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Compositional semantics for new paradigms: probabilistic, hybrid and beyond.
CoRR, 2018

Layer by Layer - Combining Monads.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017
Coalgebraic completeness-via-canonicity for distributive substructural logics.
J. Log. Algebraic Methods Program., 2017

Pointless Learning.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

The Positivication of Coalgebraic Logics.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Giry and the Machine.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Bayesian Inversion by ω-Complete Cone Duality.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Robustly Parameterised Higher-Order Probabilistic Models.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Coalgebraic Completeness-via-Canonicity - Principles and Applications.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015
Completeness-via-canonicity in coalgebraic logics.
PhD thesis, 2015

Completeness-via-canonicity for coalgebraic logics.
CoRR, 2015

Completeness via Canonicity for Distributive Substructural Logics: A Coalgebraic Perspective.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2015

2013
Some Sahlqvist Completeness Results for Coalgebraic Logics.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2011
On the Fusion of Coalgebraic Logics.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011


  Loading...