Over the last decade, there has been extensive research on modelling challenging features
in programming languages and program logics, such as higher-order store and storable …

We present a realisability model for a call-by-value, higher-order programming language
with parametric polymorphism, general first-class references, and recursive types. The main …

There has been great progress in recent years on developing effective techniques for
reasoning about program equivalence in ML-like languages---that is, languages that …

We present a sound and complete proof technique, based on syntactic logical relations, for
showing contextual equivalence of expressions in a λ-calculus with recursive types and …

The concept of a" unique" object arises in many emerging programming languages such as
Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects make it …

The method of logical relations is a classic technique for proving the equivalence of higher-
order programs that implement the same observable behavior but employ different internal …

There has recently been great progress in proving the correctness of compilers for
increasingly realistic languages with increasingly realistic runtime systems. Most work on …

Appel and McAllester's" step-indexed" logical relations have proven to be a simple and
effective technique for reasoning about programs in languages with semantically interesting …

Reasoning about program equivalence is one of the oldest problems in semantics. In recent
years, useful techniques have been developed, based on bisimulations and logical …

Fitch-style modal lambda calculi enable programming with necessity modalities in a typed
lambda calculus by extending the typing context with a delimiting operator that is denoted by …