4 citations · 11 across the 10 of their papers we have counts for
12 papers
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…
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…
A Coalgebraic Model of Quantum Bisimulation
Lorenzo Ceragioli, Elena Di Lavore, Giuseppe Lomurno +1
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprising…
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…
Tape Diagrams for Monoidal Monads
Filippo Bonchi, Cipriano Junior Cioffo, Alessandro Di Giorgio +1
Tape diagrams provide a graphical representation for arrows of rig categories, namely categories equipped with two monoidal structures, and , where dist…
A Diagrammatic Algebra for Program Logics
Filippo Bonchi, Alessandro Di Giorgio, Elena Di Lavore
Tape diagrams provide a convenient notation for arrows of rig categories, i.e., categories equipped with two monoidal products, and , where distributes…
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…
Categorical Foundations of Explainable AI: A Unifying Theory
Pietro Barbiero, Stefano Fioravanti, Francesco Giannini +3
Explainable AI (XAI) aims to address the human need for safe and reliable AI systems. However, numerous surveys emphasize the absence of a sound mathematical formalization of key X…
Monoidal Streams for Dataflow Programming
Elena Di Lavore, Giovanni de Felice, Mario Román
We introduce monoidal streams: a generalization of causal stream functions to monoidal categories. In the same way that streams provide semantics to dataflow programming with pure…
Monoidal Width: Unifying Tree Width, Path Width and Branch Width
Elena Di Lavore, Paweł Sobociński
We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture exist…
Span(Graph): a Canonical Feedback Algebra of Open Transition Systems
Elena Di Lavore, Alessandro Gianola, Mario Román +2
We show that Span(Graph)*, an algebra for open transition systems introduced by Katis, Sabadini and Walters, satisfies a universal property. By itself, this is a justification of t…
Functorial Language Games for Question Answering
Giovanni de Felice, Elena Di Lavore, Mario Román +1
We present some categorical investigations into Wittgenstein's language-games, with applications to game-theoretic pragmatics and question-answering in natural language processing.