Transactional events

nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed transactional events, which combines first-class synchronous messagepassing events with all-or-nothing transactions. This combination enables simple solutions to interesting problems in concurrent programming. For example, guarded synchronous receive can be implemented as an abstract transactional event, whereas in other lant requires a non-abstract, non-modular protocol. Likewise, three-way rendezvous can also be implemented as an abstract transactional event, which is impossible using first-class events alone. Both solutions are easy to code and easy to reason about. The expressive power of transactional events arises from a sequencing combinator whose semantics enforces an all-or-nothing transactional property ? either both of the constituent events synchronize in sequence or neither of them synchronizes. T...

• Type: Conference
• Year: 2006
• Where: ICFP
• Authors: Kevin Donnelly, Matthew Fluet
• Keywords: Abstract Transactional Event, All-or-nothing Transactional Property, ICFP 2006, Programming Languages, Transactional Events Arises