Structured Communications with Concurrent Constraints

  • Mario Coppo
  • Mariangiola Dezani-Ciancaglini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5474)


We propose a calculus which combines concurrent constraints, name passing and sessions. In this way we get enough expressivity to represent both quality of services and safety of interaction between clients and servers. Central for the soundness of our calculus is a type assignment system whose main novelty is the assurance of channel bilinearity in presence of channel constraints, channel delegations and processes recursions.


Operational Semantic Global Constraint Parallel Composition Channel Type Reduction Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft Concurrent Constraint Programming. ACM Transactions on Computational Logic 7(3), 1–27 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bonelli, E., Compagnoni, A., Gunter, E.: Correspondence Assertions for Process Synchronization in Concurrent Communications. Journal of Functional Programming 15(2), 219–248 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Buscemi, M., Montanari, U.: CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 18–32. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Buscemi, M., Montanari, U.: Open Bisimulation for the Concurrent Constraint Pi-Calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 254–268. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 5.
    Dezani-Ciancaglini, M., de’ Liguoro, U., Yoshida, N.: On Progress for Structured Communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol. 4912, pp. 257–275. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I and II. Information and Computation 100(1) (1992)Google Scholar
  8. 8.
    Saraswat, V., Rinard, M.: Concurrent Constraint Programming. In: Allen, F.E. (ed.) POPL 1990, pp. 232–245. ACM Press, New York (1990)Google Scholar
  9. 9.
    Takeuchi, K., Honda, K., Kubo, M.: An Interaction-based Language and its Typing System. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398–413. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  10. 10.
    Wischik, L., Gardner, P.: Explicit Fusion. Theoretical Computer Science 340(3), 606–630 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Yoshida, N., Vasconcelos, V.T.: Language Primitives and Type Disciplines for Structured Communication-based Programming Revisited. In: Fernández, M., Kirchner, C. (eds.) SecRet 2006. ENTCS, vol. 171, pp. 73–93. Elsevier, Amsterdam (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mario Coppo
    • 1
  • Mariangiola Dezani-Ciancaglini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Personalised recommendations