Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - Mathematical foundations of computer science 2000
Electronic Notes in Theoretical Computer Science (ENTCS)
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Open bisimulation for the concurrent constraint pi-calculus
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
On progress for structured communications
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
CC-Pi: a constraint language for service negotiation and composition
Rigorous software engineering for service-oriented systems
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Nested protocols in session types
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
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.