The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...