Related papers: Predicate Liftings and Functor Presentations in Co…
Kleene algebra with tests is an extension of Kleene algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene algebra with tests, along the lines of the coalgebraic…
We investigate the expressive power of regular expressions for languages of countable words and establish their expressive equivalence with logical and algebraic characterizations. Our goal is to extend the classical theory of regular…
In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…
We study Hoare-like logics, including partial and total correctness Hoare logic, incorrectness logic, Lisbon logic, and many others through the lens of predicate transformers \`a la Dijkstra and through the lens of Kleene algebra with top…
This work is motivated by the search for an "explicit" proof of the Bloch-Kato conjecture in Galois cohomology, proved by Voevodsky. Our concern here is to lay the foundation for a theory that, we believe, will lead to such a proof- and to…
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…
Regular expressions are commonly understood in terms of their denotational semantics, that is, through formal languages -- the regular languages. This view is inductive in nature: two primitives are equivalent if they are constructed in the…
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 Rel(Set) iff it preserves weak pullbacks. We show that these…
In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…
We introduce notions of finite presentation and co-exactness which serve as qualitative and quantitative analogues of finite-dimensionality for operator modules over completely contractive Banach algebras. With these notions we begin the…
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 to admit a functorial relation lifting: one is the…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
We identify additional structure on a conservative lax monoidal functor from a closed monoidal category $\mathcal{C}$ to a Grothendieck-Verdier category $\mathcal{D}$, such that the Grothendieck-Verdier structure of $\mathcal{D}$ lifts to…
Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural…
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary…
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…
Automata operating on pairs of words were introduced as an alternative way of capturing acceptance of regular $\omega$-languages. Families of DFAs and lasso automata operating on such pairs followed, giving rise to minimisation algorithms,…