Concurrent Constraints in the Fusion Calculus

Björn Victor and Joachim Parrow


We use the fusion calculus, a generalization and simplification of the pi-calculus, to model concurrent constraint programming. In particular we encode three basic variants of the rho-calculus, which is a foundational calculus for the concurrent constraint programming language Oz. Using a new reduction-based semantics and weak barbed congruences for the fusion calculus we formally establish an operational correspondence between the rho-calculi and their encodings. These barbed congruences are shown to coincide with the hyperequivalences previously adopted for the fusion calculus.

Extended abstract: In K.G. Larsen, S. Skyum and G. Winskel, eds, Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 455-469. Springer-Verlag, 1998. (Postscript, compressed)

See also these related papers:

and Lucian Wischik's excellent overview of fusion research.
Björn Victor
Last modified: Mon, 11-Jan-1999 15:27 MET