40 citations · 108 across the 14 of their papers we have counts for
11 papers · 1 filter
Semialgebras and Weak Distributive Laws
Daniela Petrişan, Ralph Sarkis
Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algeb…
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…
Up-To Techniques for Behavioural Metrics via Fibrations
Filippo Bonchi, Barbara König, Daniela Petrisan
Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural equivalences. We introduce up-to techniques for behavioural metrics between systems modelle…
Automata Minimization: a Functorial Approach
Thomas Colcombet, Daniela Petrişan
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the typ…
Quantifiers on languages and codensity monads
Mai Gehrke, Daniela Petrisan, Luca Reggio
This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a genera…
The Schützenberger product for syntactic spaces
Mai Gehrke, Daniela Petrisan, Luca Reggio
Starting from Boolean algebras of languages closed under quotients and using duality theoretic insights, we derive the notion of Boolean spaces with internal monoids as recognisers…
Coinduction up to in a fibrational setting
Filippo Bonchi, Daniela Petrisan, Damien Pous +1
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the…
Nominal Coalgebraic Data Types with Applications to Lambda Calculus
Alexander Kurz, Daniela Luan Petrişan, Paula Severi +1
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. W…
Relation lifting, with an application to the many-valued cover modality
Marta Bilkova, Alexander Kurz, Daniela Petrisan +1
We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T…
Relation Liftings on Preorders and Posets
Marta Bilkova, Alexander Kurz, Daniela Petrisan +1
The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on…
Algebraic Theories over Nominal Sets
Alexander Kurz, Daniela Petrişan, Jiří Velebil
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads…