Graph-based intermediate representations (IRs) are widely used for powerful compiler
optimizations, either interprocedurally in pure functional languages, or intraprocedurally in …

We study fundamental properties of a generalisation of monad called parametric effect
monad, and apply it to the interpretation of general effect systems whose effects have …

Moggi's Computational Monads and Power et al.'s equivalent notion of Freyd category have
captured a large range of computational effects present in programming languages …

We present a logical relations model of a higher-order functional programming language
with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with …

Type-and-effect systems are a natural approach for statically reasoning about a program's
execution. They have been used to track a variety of computational effects, for example …

Recently we have seen a renewed interest in programming languages that tame the
complexity of state and concurrency through refined type systems with more fine-grained …

We present a general theory of Gifford-style type and effect annotations, where effect
annotations are sets of effects. Generality is achieved by recourse to the theory of algebraic …

In the past two decades, step-indexed logical relations and separation logics have both
come to play a major role in semantics and verification research. More recently, they have …

We study the semantics of an untyped λ-calculus equipped with operators representing read
and write operations from and to a global store. We adopt the monadic approach to model …

We study a Curry style type assignment system for untyped λ-calculi with effects, based on
Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a …