Tuesday 25th September, 2012
3:30pm to 4:20pm
The programming language Ozma is an extension of Scala with concurrency concepts imported from Oz 1. It is based on deterministic dataflow concurrency. This is extremely simple: ‘val’ values in Ozma are all single assignment variables, and all operations synchronize transparently on this assignment. This extension has the incredible property that race conditions are impossible. Combined with lightweight threads, deterministic dataflow makes concurrent programming effortless; it is much simpler than any other model we know of. In addition, Ozma integrates both lazy execution and message passing with the dataflow concurrency.
Ozma has been successfully implemented 2 on the Mozart programming system, which was built specifically for Oz and has strong support for declarative concurrency. There does not exist an implementation on the JVM yet.
This talk first gives a hands-on presentation of concurrent programming in Ozma. Afterwards, we explore the issues arising when implementing Ozma on the JVM, and give solutions or workarounds for these issues.
Student for Civil engineering in computer science. Designer of the Ozma programming language. bio from Twitter
Sign in to add slides, notes or videos to this session