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 …

Moving from the mathematical theory of (abstract) syntax, we develop a general relational
theory of symbolic manipulation parametric with respect to, and accounting for, general …

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

We present a higher-order extension of Turi and Plotkin's abstract GSOS framework that
retains the key feature of the latter: for every language whose operational rules are …