The delay datatype was introduced by Capretta (Logical Methods in Computer Science, 1
(2), article 1, 2005) as a means to deal with partial functions (as in computability theory) in …

Hybrid programs combine digital control with differential equations, and naturally appear in
a wide range of application domains, from biology and control theory to real-time software …

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

We present semantic correctness proofs of forward-mode Automatic Differentiation (AD) for
languages with sources of partiality such as partial operations, lazy conditionals on real …

The delay datatype was introduced by Capretta [3] as a means to deal with partial functions
(as in computability theory) in Martin-Löf type theory. It is a monad and it constitutes a …

Martin-Löf type theory is a formal system for the development of constructive mathematics
and a very expressive functional programming language. In this language, it is possible to …

We continue the study of Capretta's delay monad as a means of introducing non-termination
from iteration into Martin-Löf type theory. In particular, we explain in what sense this monad …

Like the notion of computation via (strong) monads serves to classify various flavours of
impurity, including exceptions, non-determinism, probability, local and global store, the …

Hybrid computation harbours discrete and continuous dynamics in the form of an entangled
mixture, inherently present in various natural phenomena and in applications ranging from …

Reversible computation studies computations which exhibit both forward and backward
determinism. Among others, it has been studied for half a century for its applications in low …