We study Abramsky's applicative bisimilarity abstractly, in the context of call-by-value λ-
calculi with algebraic effects. We first of all endow a computational λ-calculus with a monadic …

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

Weakest precondition transformers are useful tools in program verification. One of their key
properties is compositionality, that is, the weakest precondition predicate transformer (wppt …

We devise a generic framework where a weakest precondition semantics, in the form of
indexed posets, is derived from a monad whose Kleisli category is enriched by posets. It is …

Deductive verification techniques based on program logics (ie, the family of Floyd-Hoare
logics) are a powerful approach for program reasoning. Recently, there has been a trend of …

This paper presents a novel formalisation of algebraic effects with equations in Cubical
Agda. Unlike previous work in the literature that employed setoids to deal with equations, the …

This work investigates three notions of program equivalence for a higher-order functional
language with recursion and general algebraic effects, in which programs are written in …

Notions of guardedness serve to delineate the admissibility of cycles, eg in recursion,
corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure …

Healthiness is a good old question in program logics that dates back to Dijkstra. It asks for
an intrinsic characterization of those predicate transformers which arise as the (backward) …

Rewriting is a versatile and powerful technique used in many domains. Strategic rewriting
allows programmers to control the application of rewrite rules by composing individual …