In programming, some data acts as a resource (eg, file handles, channels) subject to usage
constraints. This poses a challenge to software correctness as most languages are agnostic …

Effects and coeffects are two general, complementary aspects of program behaviour. They
roughly correspond to computations which change the execution context (effects) versus …

Effect and session type systems are two expressive behavioural type systems. The former is
usually developed in the context of the lambda-calculus and its variants, the latter for the pi …

Monads are now an everyday tool in functional programming for abstracting and delimiting
effects. The link between monads and effect systems is well-known, but in their typical use …

Abstract Effect systems were originally conceived as an inference-based program analysis
to capture program behaviour—as a set of (representations of) effects. Two orthogonal …

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 …

In static analysis, two frameworks have been studied extensively: monotone data-flow
analysis and type-and-effect systems. Whilst both are seen as general analysis frameworks …

Graded modal logics generalise standard modal logics via families of modalities indexed by
an algebraic structure whose operations mediate between the different modalities. The …

List comprehensions are a widely used programming construct, in languages such as
Haskell and Python and in technologies such as Microsoft's Language Integrated Query …

Bulk types such as sets, bags, and lists are monads, and therefore support a notation for
database queries based on comprehensions. This fact is the basis of much work on …