Three subtyping algorithms for binary session types and their complexity analyses
Session types are a type discipline for describing and specifying communication behaviours of concurrent processes. <i>Session subtyping</i>, firstly introduced by Gay and Hole, is widely used for enlarging typability of session programs. This paper gives the complexity analysis of three...
| Main Authors: | , |
|---|---|
| פורמט: | Conference item |
| שפה: | English |
| יצא לאור: |
Open Publishing Association
2024
|