3 citations · 3 across the 3 of their papers we have counts for
4 papers
Infinite trees
Alexandre Goy
A few notes about infinite trees in a descriptive set-theoretic setting.
Weakening and Iterating Laws using String Diagrams
Alexandre Goy
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 la…
Combining Weak Distributive Laws: Application to Up-To Techniques
Alexandre Goy, Daniela Petrisan
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, resp…
Trace semantics via determinization for probabilistic transition systems
Alexandre Goy
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 se…