Multiparty Symmetric Sum Types

Details Multiparty Symmetric Sum Types Multiparty Symmetric Sum Types

2010-11-30

arxiv.org/abs/1011.6436v1

EPTCS 41, 2010, pp. 121-135

Computer Science

Distributed, Parallel, and Cluster Computing

In Proceedings EXPRESS'10, arXiv:1011.6012

Scientific paper

10.4204/EPTCS.41.9

This paper introduces a new theory of multiparty session types based on symmetric sum types, by which we can type non-deterministic orchestration choice behaviours. While the original branching type in session types can represent a choice made by a single participant and accepted by others determining how the session proceeds, the symmetric sum type represents a choice made by agreement among all the participants of a session. Such behaviour can be found in many practical systems, including collaborative workflow in healthcare systems for clinical practice guidelines (CPGs). Processes using the symmetric sums can be embedded into the original branching types using conductor processes. We show that this type-driven embedding preserves typability, satisfies semantic soundness and completeness, and meets the encodability criteria adapted to the typed setting. The theory leads to an efficient implementation of a prototypical tool for CPGs which automatically translates the original CPG specifications from a representation called the Process Matrix to symmetric sum types, type checks programs and executes them.

Affiliated with

Also associated with

No associations

Rating

Multiparty Symmetric Sum Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiparty Symmetric Sum Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiparty Symmetric Sum Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444513