Publications

Alexandre Goy (2022). Weakening and Iterating Laws using String Diagrams. Mathematical Foundations of Programming Semantics.

Alexandre Goy (2021). On the Compositionality of Monads via Weak Distributive Laws. PhD Thesis.

Alexandre Goy, Daniela Petrişan, Marc Aiguier (2021). Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces. International Colloquium on Automata, Languages and Programming.

Alexandre Goy, Daniela Petrişan (2020). Combining Probabilistic and Non-Deterministic Choice via Weak Distributive Laws. Logic in Computer Science.

Alexandre Goy, Marc Aiguier, Isabelle Bloch (2019). From Structuring Elements to Structuring Neighborhood Systems. Mathematical Morphology and Its Applications to Signal and Image Processing.

Alexandre Goy, Jurriaan Rot (2018). (In)finite Trace Equivalence of Probabilistic Transition Systems. Coalgebraic Methods in Computer Science.

Alexandre Goy (2017). Trace Semantics via Determinization for Probabilistic Transition Systems. Master’s Thesis.