14. ABSTRACT A logical framework and its implementation should serve as a flexible tool
for specifying, simulating, and reasoning about formal systems. When the formal systems we …

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

Natural semantics (big-step) and structural operational semantics (small-step) each have
advantages, so it can be useful to produce both semantic forms for a language. Previous …

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 …

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 …

The functional correspondence is a manual derivation technique transforming higher-order
evaluators into the semantically equivalent abstract machines. The transformation consists …

Recursive de nitions of predicates by means of inference rules are ubiquitous in computer
science. They are usually interpreted inductively or coinductively, however there are …

It is well known that big-step operational semantics are not suitable for proving soundness of
type systems, because of their inability to distinguish stuck from non-terminating …

Big-step and small-step are two popular flavors of operational semantics. Big-step is often
seen as a more natural transcription of informal descriptions, as well as being more …

In this paper we present a novel approach to big-step operational semantics. This approach
stems from the observation that the typical type soundness property formulated via a big …