Implementing Software Transactional Memory, Correctly

This article presents a stripped-down, idealised concurrent language inspired by STM Haskell, and shows how a low-level implementation of this language can be justified with respect to a high-level semantics, by means of a compiler and its correctness theorem, validated using QuickCheck and HPC.