Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexandre Goy 0002
dblp:196/5465-2
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-0706-1186ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Logic in computer science · 86% Automata and formal languages · 14% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
category theory |
0.5 | 1 | 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces · ICALP 2021 |
Logic in computer science
coalgebra |
0.5 | 1 | 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces · ICALP 2021 |
Automata and formal languages › automata algorithms
determinization |
0.5 | 1 | 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces · ICALP 2021 |
Logic in computer science › category theory
distributive law |
0.5 | 1 | 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces · ICALP 2021 |
Logic in computer science › category theory
monad |
0.5 | 1 | 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces · ICALP 2021 |
Logic in computer science › semantics
denotational semantics |
0.4 | 1 | 2020 | Combining probabilistic and non-deterministic choice via weak distributive laws · LICS 2020 |
Logic in computer science › concurrency theory
trace semantics |
0.1 | 1 | 2020 | Combining probabilistic and non-deterministic choice via weak distributive laws · LICS 2020 |
Methods — techniques the papers use, named apart from their topics
monads · 0.4convex algebras · 0.4category theory · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff SpacesabstractThe powerset monad on the category of sets does not distribute over itself. Nevertheless a weaker form of distributive law of the powerset monad over itself exists and it essentially stems from the canonical Egli-Milner extension of the powerset to the category of relations. On the other hand, any regular category yields a category of relations, and some regular categories also possess a powerset-like monad, as is the Vietoris monad on compact Hausdorff spaces. We derive the Egli-Milner extension in three different frameworks : sets, toposes, and compact Hausdorff spaces. We prove that it corresponds to a monotone weak distributive law in each case by showing that the multiplication extends to relations but the unit does not. We provide an application to coalgebraic determinization of alternating automata. Alexandre Goy 0002, Daniela Petrisan, Marc Aiguier |
ICALP | 1 |
| 2020 | Combining probabilistic and non-deterministic choice via weak distributive lawsabstractCombining probabilistic choice and non-determinism is a long standing problem in denotational semantics. From a category theory perspective, the problem stems from the absence of a distributive law of the powerset monad over the distribution monad. In this paper we prove the existence of a weak distributive law of the powerset monad over the finite distribution monad. As a consequence, we retrieve the well-known convex powerset monad as a weak lifting of the powerset monad to the category of convex algebras. We provide applications to the study of trace semantics and behavioral equivalences of systems with an interplay between probability and non-determinism. Alexandre Goy 0002, Daniela Petrisan |
LICS | 1 |