default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFredrik Dahlqvist
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Gabryel Mason-Williams, Fredrik Dahlqvist:
What Makes a Good Prune? Maximal Unstructured Pruning for Maximal Cosine Similarity. ICLR 2024- 2023
- [j3]Fredrik Dahlqvist, Renato Neves:
The syntactic side of autonomous categories enriched over generalised metric spaces. Log. Methods Comput. Sci. 19(4) (2023) - [c17]Fredrik Dahlqvist, Alexandra Silva, William Smith:
Deterministic stream-sampling for probabilistic programming: semantics and verification. LICS 2023: 1-13 - [c16]Fredrik Dahlqvist, Renato Neves:
A Complete V-Equational System for Graded lambda-Calculus. MFPS 2023 - [i13]Fredrik Dahlqvist, Alexandra Silva, William Smith:
Deterministic stream-sampling for probabilistic programming: semantics and verification. CoRR abs/2304.13504 (2023) - 2022
- [c15]Fredrik Dahlqvist, Renato Neves:
An Internal Language for Categories Enriched over Generalised Metric Spaces. CSL 2022: 16:1-16:18 - [i12]Fredrik Dahlqvist, Renato Neves:
The syntactic dual of autonomous categories enriched over generalised metric spaces. CoRR abs/2208.14356 (2022) - 2021
- [c14]Fredrik Dahlqvist, Todd Schmid
:
How to Write a Coequation ((Co)algebraic pearls). CALCO 2021: 13:1-13:25 - [c13]George A. Constantinides, Fredrik Dahlqvist, Zvonimir Rakamaric, Rocco Salvia:
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations. CAV (2) 2021: 626-650 - [i11]Fredrik Dahlqvist, Renato Neves:
An Internal Language for Categories Enriched over Generalised Metric Spaces. CoRR abs/2105.08473 (2021) - [i10]George A. Constantinides, Fredrik Dahlqvist, Zvonimir Rakamaric, Rocco Salvia:
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations. CoRR abs/2105.13217 (2021) - [i9]Fredrik Dahlqvist, Todd Schmid:
How to write a coequation. CoRR abs/2109.11967 (2021) - 2020
- [j2]Fredrik Dahlqvist, Dexter Kozen:
Semantics of higher-order probabilistic programs with conditioning. Proc. ACM Program. Lang. 4(POPL): 57:1-57:29 (2020)
2010 – 2019
- 2019
- [c12]Fredrik Dahlqvist, Rocco Salvia, George A. Constantinides:
A Probabilistic Approach to Floating-Point Arithmetic. ACSSC 2019: 596-602 - [i8]Fredrik Dahlqvist, Dexter Kozen:
Semantics of higher-order probabilistic programs with conditioning. CoRR abs/1902.11189 (2019) - [i7]Fredrik Dahlqvist, Rocco Salvia, George A. Constantinides:
A Probabilistic Approach to Floating-Point Arithmetic. CoRR abs/1912.00867 (2019) - 2018
- [c11]Fredrik Dahlqvist, Louis Parlant, Alexandra Silva:
Layer by Layer - Combining Monads. ICTAC 2018: 153-172 - [c10]Fredrik Dahlqvist, Alexandra Silva, Vincent Danos, Ilias Garnier:
Borel Kernels and their Approximation, Categorically. MFPS 2018: 91-119 - [i6]Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Alexandra Silva:
Borel Kernels and their Approximation, Categorically. CoRR abs/1803.02651 (2018) - [i5]Fredrik Dahlqvist, Renato Neves:
Compositional semantics for new paradigms: probabilistic, hybrid and beyond. CoRR abs/1804.04145 (2018) - [i4]Fredrik Dahlqvist, Alexander Kurz:
The positivication of coalgebraic logics. CoRR abs/1812.07288 (2018) - 2017
- [j1]Fredrik Dahlqvist, David J. Pym:
Coalgebraic completeness-via-canonicity for distributive substructural logics. J. Log. Algebraic Methods Program. 93: 1-22 (2017) - [c9]Fredrik Dahlqvist, Alexander Kurz:
The Positivication of Coalgebraic Logics. CALCO 2017: 9:1-9:15 - [c8]Florence Clerc, Vincent Danos, Fredrik Dahlqvist, Ilias Garnier:
Pointless Learning. FoSSaCS 2017: 355-369 - [i3]Fredrik Dahlqvist, Louis Parlant, Alexandra Silva:
Layer by layer - Combining Monads. CoRR abs/1712.01113 (2017) - 2016
- [c7]Fredrik Dahlqvist:
Coalgebraic Completeness-via-Canonicity - Principles and Applications. CMCS 2016: 174-194 - [c6]Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Ohad Kammar:
Bayesian Inversion by ω-Complete Cone Duality. CONCUR 2016: 1:1-1:15 - [c5]Fredrik Dahlqvist, Vincent Danos, Ilias Garnier:
Robustly Parameterised Higher-Order Probabilistic Models. CONCUR 2016: 23:1-23:15 - [c4]Fredrik Dahlqvist, Vincent Danos, Ilias Garnier:
Giry and the Machine. MFPS 2016: 85-110 - 2015
- [b1]Fredrik Dahlqvist:
Completeness-via-canonicity in coalgebraic logics. Imperial College London, UK, 2015 - [c3]Fredrik Dahlqvist, David J. Pym:
Completeness via Canonicity for Distributive Substructural Logics: A Coalgebraic Perspective. RAMiCS 2015: 119-135 - [i2]Fredrik Dahlqvist, David J. Pym:
Completeness via canonicity for distributive substructural logics: a coalgebraic perspective. CoRR abs/1508.04940 (2015) - [i1]Fredrik Dahlqvist:
Completeness-via-canonicity for coalgebraic logics. CoRR abs/1510.09095 (2015) - 2013
- [c2]Fredrik Dahlqvist, Dirk Pattinson:
Some Sahlqvist Completeness Results for Coalgebraic Logics. FoSSaCS 2013: 193-208 - 2011
- [c1]Fredrik Dahlqvist, Dirk Pattinson:
On the Fusion of Coalgebraic Logics. CALCO 2011: 161-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
