The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and
Mostowski in the 1930s, supports notions of 'name-abstraction'and 'fresh name'that provide …

We model notions of computation using algebraic operations and equations. We show that
these generate several of the monads of primary interest that have been used to model …

The Fraenkel-Mostowski permutation model of set theory with atoms (FM-sets) can serve as
the semantic basis of meta-logics for specifying and reasoning about formal systems …

Drawing upon early work by Burstall, we extend Hoare's approach to proving the
correctness of imperative programs, to deal with programs that perform destructive updates …

FreshML extends ML with elegant and practical constructs for declaring and manipulating
syntactical data involving statically scoped binding operations. User-declared FreshML …

A tension in language design has been between simple semantics on the one hand, and
rich possibilities for side-effects, exception handling and so on on the other. The introduction …

We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style
programming language with first-class algebraic effects and handlers. We define an …

We study the positivity and causality axioms for Markov categories as properties of dilations
and information flow and also develop variations thereof for arbitrary semicartesian …

Probability theory and statistics are fundamental disciplines in a data-driven world. Synthetic
probability theory is a general, axiomatic formalism to describe their underlying structures …

Over the last decade, there has been extensive research on modelling challenging features
in programming languages and program logics, such as higher-order store and storable …