I am delighted to announce the release of Ozma,
Tiffany Jewelry, a conservative extension to Scala that adds Oz concurrency. Ozma was developed being a master's thesis by Sébastien Doeraene under my supervision (see the implementation along with the master's thesis).
Oz can be a multi-paradigm language that has powerful assistance for concurrent and distributed programming. It compiles to its very own virtual device (named Mozart) that supports dataflow synchronization and light-weight threads.
Scala is really a practical and object-oriented language with implementations for that JVM and .Web. It really is totally interoperable with Java.
Ozma is an attempt at creating the concurrency concepts of Oz accessible to a bigger public. Ozma implements the total Scala specification and runs within the Mozart VM. It might consequently be noticed as a new implementation of Scala. Ozma extends Scala with dataflow variables (permitting tail-recursive record capabilities),
Pandora Jewelry, declarative (deterministic) concurrency,
Tiffany Charm Bracelets, lazy declarative concurrency,
Discount Tiffany Jewelry Arkansas Repertory Theatre The Rep,
Tiffany Ring, and message-passing concurrency determined by ports. Just about all the concurrency examples of CTM might be translated quickly to Ozma. We are able to say that Ozma lifts the duality of Scala,
Pandora Ireland, particularly the mixture of practical and object styles,
Pandora Beads, to concurrent programming.