Combining ideas coming from Stone duality and Reynolds parametricity, we formulate in a
clean and principled way a notion of profinite λ-term which, we show, generalizes at every …

Extensions of Stone-type dualities have a long history in algebraic logic and have also been
instrumental for proving results in algebraic language theory. We show how to extend …

In its simplest form, the theory of regular languages is the study of sets of finite words
recognized by finite monoids. The finiteness condition on monoids gives rise to a topological …

We propose a novel topological perspective on data languages recognizable by orbit-finite
nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces …

We study many-valued variants of modal logic and, more generally, coalgebraic logic, under
the assumption that the underlying algebra of truth-degrees is a semi-primal bounded lattice …