Multiparty Symmetric Sum Types
File(s)1011.6436v1.pdf (183.39 KB)
Published version
Author(s)
Nielsen, L
Yoshida, N
Honda, K
Type
Journal Article
Abstract
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.
Editor(s)
Fröschle, S
Valencia, FD
Date Issued
2010-11-28
Date Acceptance
2010-11-28
Citation
Electronic Proceedings in Theoretical Computer Science, 2010, 41, pp.121-135
ISSN
2075-2180
Publisher
Open Publishing Association
Start Page
121
End Page
135
Journal / Book Title
Electronic Proceedings in Theoretical Computer Science
Volume
41
Copyright Statement
© 2010 L. Nielsen, N. Yoshida & K. Honda
This work is licensed under the
Creative Commons Attribution License.
This work is licensed under the
Creative Commons Attribution License.
License URL
Publication Status
Published