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

Monads are the basis of a well-established method of encapsulating side-effects in
semantics and programming. There have been a number of proposals for monadic program …

This paper presents a formalisation of pGCL in Isabelle/HOL. Using a shallow embedding,
we demonstrate close integration with existing automation support. We demonstrate the …

Bidirectional transformations (bx) support principled consistency maintenance between data
sources. Each data source corresponds to one perspective on a composite system …

This paper presents novel research on an experimental comparison of two interpretations of
missing attribute values: lost values and attribute-concept values. Experiments were …

This dissertation presents a survey of the theoretical and practical techniques necessary to
provably eliminate side-channel leakage through known mechanisms in component-based …

A theory is complete if it does not contain a contradiction, while all of its proper extensions
do. In this paper, first we introduce a relative notion of syntactic completeness; then we prove …

In this paper, we present a novel framework for studying the syntactic completeness of
computational effects and we apply it to the exception effect. When applied to the states …

This thesis studies notions of program equivalence for a call-by-push-value functional
language with algebraic effects and general recursion. We mainly focus on behavioural …

Bidirectional transformations (bx) support principled consistency maintenance between data
sources. Each data source corresponds to one perspective on a composite system …