Abstract
High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types [14] However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions [5,10]. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types.
Original language | English |
---|---|
Pages (from-to) | 175-195 |
Number of pages | 21 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 97 |
DOIs | |
State | Published - 22 Jul 2004 |
Event | Proceedings of FOCLASA 2003, the Foundations of Coordination Languages and Software Architectures, a satellite event of CONCUR 2003 - Marseille, France Duration: 2 Sep 2003 → 2 Sep 2003 |
Keywords
- Concurrent programming
- Correspondence assertions
- Pi-calculus
- Session types
- Type systems