The operational semantics of a partial, functional language is often given as a relation rather
than as a function. The latter approach is arguably more natural: if the language is …

Resumptions appear in many forms as a convenient abstraction, such as in semantics of
concurrency and as a programming pattern. In this paper we introduce generalised …

We study a model of side-effecting processes obtained by starting from a monad modelling
base effects and adjoining free operations using a cofree coalgebra construction; one thus …

Abstract Models of iterated computation, such as (completely) iterative monads, often
depend on a notion of guardedness, which guarantees unique solvability of recursive …

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 …

There is no such thing as high assurance without high assurance hardware. High assurance
hardware is essential, because any and all high assurance systems ultimately depend on …

There is no such thing as high assurance without high assurance hardware. High assurance
hardware is essential because any and all high assurance systems ultimately depend on …

Constructing high-assurance, secure hardware remains a challenge, because to do so
relies on both a verifiable means of hardware description and implementation. However …

Monads are used to abstractly model a wide range of computational effects such as
nondeterminism, statefulness, and exceptions. Complete Elgot monads are monads that are …

In the monad-based approach to functional programming with effects, sequential
composition, the primary high-level control structure for combining effectful functions, takes a …