collaborators

14 papers

cs.LO2026

Effectful Mealy Machines

Filippo Bonchi, Elena Di Lavore, Mario Román

Effectful Mealy machines, which we introduce, are a generalization of Mealy machines with global effects determined by an effectful triple. We provide semantics of effectful Mealy…

cs.LO2026

Graded Monad Coalgebras for Continuous-Time Transition Systems

Elena Di Lavore, Jonas Forster, Mario Román

Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model…

cs.LO2026

A Diagrammatic Basis for Computer Programming

Filippo Bonchi, Alessandro Di Giorgio, Elena Di Lavore

Tape diagrams provide a convenient graphical notation for arrows of rig categories, i.e., categories equipped with two monoidal products, and . In this work, we i…

cs.LO2026

Order in Partial Markov Categories

Elena Di Lavore, Mario Román, Paweł Sobociński +1

Partial Markov categories are a recent framework for categorical probability theory that provide an abstract account of partial probabilistic computation with updating semantics. I…

math.CT2026

Partial Markov Categories

Elena Di Lavore, Mario Román, Paweł Sobociński

We introduce partial Markov categories as a synthetic framework for synthetic probabilistic inference, blending the work of Cho and Jacobs, Fritz, and Golubtsov on Markov categorie…

math.CT2026

Normalized Probabilistic Semantics is Not Associative

Elena Di Lavore, Mario Román, Márk Széles

Normalization, , fails to form a distributive law, forcing the composition of normalized stochastic kernels to be non-associative. We introduce a first norma…