Alexandre Goy

Alexandre Goy
Ecole normale supérieure de Lyon | ENS Lyon · Département Informatique

Doctor of Philosophy

About

9
Publications
234
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
28
Citations

Publications

Publications (9)
Preprint
Full-text available
Distributive laws are a standard way of combining two monads, providing a compositional approach for reasoning about computational effects in semantics. Situations where no such law exists can sometimes be handled by weakening the notion of distributive law, still recovering a composite monad. A celebrated result from Eugenia Cheng shows that combi...
Thesis
Full-text available
Monads are a concept from category theory allowing to model abstractly the notion of computational effect. The non-compositionality of monads is well-known, but the theory of distributive laws is a classical tool that has proved useful to combine effects of several monads. In frequent cases, there is no way of defining a distributive law between a...
Conference Paper
Full-text available
The 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, an...
Preprint
Full-text available
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution monad. This can be fixed using the framework of weak distributive laws. We extend this framework to the case w...
Chapter
We show how finite and infinite trace semantics of generative probabilistic transition systems arises through a determinisation construction. This enables the use of bisimulations (up-to) to prove equivalence. In particular, it follows that trace equivalence for finite probabilistic transition systems is decidable. Further, the determinisation cons...
Article
Full-text available
A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an instance of general determinization. Once applied to discrete systems, this point of view allows the exploitat...

Network

Cited By