Graded modal types systems and coeffects are becoming a standard formalism to deal with
context-dependent, usage-sensitive computations, especially when combined with …

Monadic computations built by interpreting, or handling, operations of a free monad are a
compelling formalism for modeling language semantics and defining the behaviors of …

This paper studies quantitative refinements of Abramsky's applicative similarity and
bisimilarity in the context of a generalisation of Fuzz, a call-by-value λ-calculus with a linear …

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

The article investigates behavioural equivalence between programs in a call-by-value
functional language extended with a signature of (algebraic) effect-triggering operations …

We propose the first framework for defining relational program logics for arbitrary monadic
effects. The framework is embedded within a relational dependent type theory and is highly …

Normal form bisimulation, also known as open bisimulation, is a coinductive technique for
higher-order program equivalence in which programs are compared by looking at their …

Semantics is traditionally concerned with program equivalence, in which all pairs of
programs which are not equivalent are treated the same, and simply dubbed as …

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 …