When doing an interactive proof about a piece of software, it is important that the underlying
programming language's semantics does not make the proof unnecessarily difficult or …

In spite of the popularity of small-step semantics, big-step semantics remain used by many
researchers. However, big-step semantics suffer from a serious duplication problem, which …

The Rust programming language continues to rise in popularity, and as such, warrants the
close attention of the programming languages community. In this work, we present a new …

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 …

It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin
and Pierce have noted that there is a problem with coinductive definitions of non-trivial …

We introduce a generalized notion of inference system to support structural recursion on non
well-founded datatypes. Besides axioms and inference rules with the usual meaning, a …

In search for a foundational framework for reasoning about observable behavior of programs
that may not terminate, we have previously devised a trace-based big-step semantics for …

We introduce a generalized notion of inference system to support more flexible
interpretations of recursive definitions. Besides axioms and inference rules with the usual …

We look at the operational semantics of languages with interactive I/O through the glasses of
constructive type theory. Following on from our earlier work on coinductive trace-based …

Coaxioms have been recently introduced to enhance the expressive power of inference
systems, by supporting interpretations which are neither purely inductive, nor coinductive …