A compositional theory for STM Haskell

Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-deterministic tree rewriting algorithm implementing the operational semantics of the ambient calculus. The core of our theory is a uniform model, in the spirit of process calculi, of the run-time state of multi-threaded STM Haskell programs. The model was designed to simplify both local and compositional reasoning about STM programs. A single reduction relation captures both pure functional computations and also effectful computations in the STM and I/O monads. We state and prove liveness, soundness, completeness, safety, and termination properties relating source processes and their Haskell implementation. Our proof exploits various ideas from concurrency theory, such as the bisimulation technique, but in the setting of a widely used programming language rather than an abstract process calculus. Additionally, we develop an equational theory for reasoning about STM Haskell programs, and establish for the first time equations conjectured by the designers of STM Haskell. We conclude that using a pure functional language extended with STM facilitates reasoning about concurrent implementation code.
Original languageEnglish
Title of host publicationProceedings of the 2nd ACM SIGPLAN Symposium on Haskell, Haskell 2009, Edinburgh, Scotland, UK, 3 September 2009
PublisherACM
Pages69-80
Number of pages12
ISBN (Print)978-1-60558-508-6
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'A compositional theory for STM Haskell'. Together they form a unique fingerprint.

Cite this