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 …

This article gives an in-depth presentation of the omni-big-step and omni-small-step styles of
semantic judgments. These styles describe operational semantics by relating starting states …

We propose a general proof technique to show that a predicate is sound, that is, prevents
stuck computation, with respect to a big-step semantics. This result may look surprising …

There are useful programs that do not terminate, and yet standard Hoare logics are not able
to prove liveness properties about non-terminating programs. This paper shows how a …

General-purpose massively parallel processors, such as GPUs, have become common, but
are difficult to program. Pure functional programming can be a solution, as it guarantees …

It is well known that big-step semantics is not able to distinguish stuck and non-terminating
computations. This is a strong limitation as it makes it very difficult to reason about properties …

Generalized inference systems have been recently introduced, and used, among other
applications, to define semantic judgments which uniformly model terminating computations …

We present an automatic translation of a skeletal semantics written in big-step style into an
equivalent structural operational semantics. This translation is implemented on top of the …

We provide a construction that, given a big-step semantics describing finite computations
and their observations, extends it to include infinite computations as well. The basic idea is …

Coevaluation, the coinductive interpretation of standard big-step evaluation rules, is a
concise form of semantics, with the same number of rules as in evaluation, which intends to …