Prettier Concurrency: Purely Functional Concurrent Revisions

This article presents an extension to the work of Launchbury and Peyton-Jones on the ST monad. Using a novel model for concurrency, called "concurrent revisions", we show how we can use concurrency together with imperative mutable variables, while still being able to safely convert such computations (in the Rev monad) into pure values again.

In contrast to many other transaction models, like software transactional memory (STM), concurrent revisions never use rollback and always deterministically resolve conflicts. As a consequence, concurrent revisions integrate well with side-effecting I/O operations. Using deterministic conflict resolution, concurrent revisions can deal well with situations where there are many conflicts between different threads that modify a shared data structure. We demonstrate this by describing a concurrent game with conflicting concurrent tasks.

PDF file
ZIP compressed file

In  Haskell Symposium 2011 (Haskell'11)

Publisher  ACM SIGPLAN
Copyright © 2011 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or The definitive version of this paper can be found at ACM’s Digital Library --


AddressTokyo, Japan

Previous Versions

Sebastian Burckhardt and Daan Leijen. Semantics of Concurrent Revisions, Springer Verlag, March 2011.

Sebastian Burckhardt, Daan Leijen, and Manuel Fahndrich. Roll Forward, Not Back: A Case for Deterministic Conflict Resolution, March 2011.

> Publications > Prettier Concurrency: Purely Functional Concurrent Revisions