Abstract
We use the fusion calculus, a generalization and simplification of the π-calculus, to model concurrent constraint programming. In particular we encode three basic variants of the ρ-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 ρ-calculi and their encodings. These barbed congruences are shown to coincide with the hyper-equivalences previously adopted for the fusion calculus.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Fu. A proof-theoretical approach to communication. In P. Degano, R. Gorrieri and A. Marchetti-Spaccamela, editors, Proceedings of ICALP '97, volume 1256 of LNCS, pages 325–335. Springer, 1997.
D. Li. A π-calculus specification of Prolog. In D. Sannella, editor, Proceedings of ESOP '04, volume 788 of LNCS, pages 379–393. Springer, 1994.
R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, Sept. 1992.
R. Milner and D. Sangiorgi. Barbed bisimulatiou. In W. Kuich, editor, Proceedings of ICALP '92, volume 623 of LNCS, pages 685–695. Springer, 1992.
J. Niehren and M. Müller. Constraints for free in concurrent computation. In K. Kanchanasut and J.-J. Lévy, editors, Asian Computer Science Conference, volume 1023 of LNCS, pages 171–186. Springer, 1995.
J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS'98. IEEE, Computer Society Press, June 1998. URL: http://www.docs.uu.se/~victor/tr/fusion.html.
J. Parrow and B. Victor. The update calculus. In M. Johnson, editor, Proceedings of AMAST'97, volume 1349 of LNCS, pages 409–423. Springer, Dec. 1997.
B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In G. Plotkin, C. Stirling and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, 1997. To appear.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, LFCS, University of Edinburgh, 1993.
V. A. Saraswat, M. Rinard and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of POPL '91, pages 333–352. ACM, 1991.
G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Constraints in Computational Logics, volume 845 of LNCS, pages 50–72. Springer, Sept. 1994.
G. Smolka. The Oz programming model. In J. van Leeuwen, editor, Computer Science Today, volume 1000 of LNCS, pages 324–343. Springer, 1995.
B. Victor. The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, June 1998. URL: http://www.docs.uu.se/~victor/thesis.shtml.
B. Victor and J. Parrow. Constraints as processes. In U. Montanari and V. Sassone, editors, Proceedings of CONCUR '96, volume 1119 of LNCS, pages 389–405. Springer, 1996.
D. Walker. Objects in the π-calculus. Journal of Information and Computation, 116(2):253–271, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Victor, B., Parrow, J. (1998). Concurrent constraints in the fusion calculus. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055075
Download citation
DOI: https://doi.org/10.1007/BFb0055075
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive