We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the
calculus of binary relations that has the same expressivity as first order logic and comes with …

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of
Mathematical Operational Semantics to higher-order languages. The fundamental well …

We present a systematic approach to logical predicates based on universal coalgebra and
higher-order abstract GSOS, thus making a first step towards a unifying theory of logical …

Proving compositionality of behavioral equivalence on state-based systems with respect to
algebraic operations is a classical and widely studied problem. We study a categorical …

Logical relations constitute a key method for reasoning about contextual equivalence of
programs in higher-order languages. They are usually developed on a per-case basis, with …

Levy's call-by-push-value is a comprehensive programming paradigm that combines
elements from functional and imperative programming, supports computational effects and …

Levy's call-by-push-value is a comprehensive programming paradigm that combines
elements from functional and imperative programming, supports computational effects and …

Probabilistic programs are a powerful and convenient approach to formalise distributions
over system executions. A classical verification problem for probabilistic programs is …

This position paper on the (meta-) theory of Structural Operational Semantic (SOS) is
motivated by the following two questions:(1) Is the (meta-) theory of SOS dying out as a …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …