Abstract
In this section we present the main results regarding our type system. We start with subject reduction for expressions, then we present subject reduction for configurations and finally we conclude with the correctness theorems, the main result of this part. Intuitively the latter theorems state that well-typed programs do not perform illegal rebinding or illegal synchronous method calls.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Atlantis Press and the author(s)
About this chapter
Cite this chapter
Dardha, O. (2016). Properties of the Type System. In: Type Systems for Distributed Programs: Components and Sessions. Atlantis Studies in Computing, vol 7. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-204-5_3
Download citation
DOI: https://doi.org/10.2991/978-94-6239-204-5_3
Published:
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-6239-203-8
Online ISBN: 978-94-6239-204-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)