In 1996, development of Oz continued in cooperation with the research group of Seif Haridi and Peter Van Roy at the Swedish Institute of Computer Science.
Since 1999, Oz has been continually developed by an international group, the Mozart Consortium, which originally consisted of Saarland University, the Swedish Institute of Computer Science, and the Université catholique de Louvain.
Due to its factored design, Oz is able to successfully implement a network-transparent distributed programming model.
[7] Procedures are defined using the construct "proc" as follows The above example doesn't return any value, it just prints 5 or -5 in the Oz browser depending on the sign of X.
[8] This example computes a stream of prime numbers using the trial division algorithm by recursively creating concurrent stream agents that filter out non-prime numbers: Oz uses eager evaluation by default, but lazy evaluation[9] is possible.
The declarative concurrent model can be extended with message passing via simple semantics: With a port and a thread, asynchronous agents can be defined: It is again possible to extend the declarative model to support state and object-oriented programming with very simple semantics.
To create a new mutable data structure called Cells: With these simple semantic changes, the whole object-oriented paradigm can be supported.
The execution speed of a program produced by the Mozart compiler (version 1.4.0 implementing Oz 3) is very slow.
On a 2012 set of benchmarks it averaged about 50 times slower than that of the GNU Compiler Collection (GCC) for the C language.