Structured Communications with Concurrent Constraints

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.