Language primitives and type discipline for structured communication-based programming, 7th European Symposium on Programming (ESOP'98), vol.1381, pp.122-138, 1998. ,
Multiparty asynchronous session types, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.273-284, 2008. ,
Embedding session types in Haskell, Proceedings of the 9th International Symposium on Haskell, pp.133-145, 2016. ,
Static deadlock detection for concurrent Go by global session graph synthesis, Proceedings of the 25th International Conference on Compiler Construction (CC 2016, pp.174-184, 2016. ,
, Proceedings of the 11th ACM SIGPLAN Workshop on Generic Programming, pp.13-22, 2015.
Multiparty asynchronous session types, J. ACM, vol.63, issue.1, p.9, 2016. ,
Subtyping for session types in the pi calculus, Acta Inf, vol.42, issue.2-3, pp.191-225, 2005. ,
On the preciseness of subtyping in session types, 16th International Symposium on Principles and Practice of Declarative Programming, pp.135-146, 2014. ,
Subtyping supports safe session substitution, in: A List of Successes That Can Change the World-Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday, pp.95-108, 2016. ,
Undecidability of asynchronous session subtyping, Inf. Comput. To appear ,
URL : https://hal.archives-ouvertes.fr/hal-01637935
On the undecidability of asynchronous session subtyping, Foundations of Software Science and Computation Structures-20th International Conference, pp.441-457, 2017. ,
Session typing and asynchronous subtyping for the higher-order ?-calculus, Inf. Comput, pp.227-263, 2015. ,
, Web Services Description Language (WSDL), p.3, 2001.
Global principal typing in partially commutative asynchronous sessions, 18th European Symposium on Programming (ESOP'09), vol.5502, pp.316-332, 2009. ,
, Automata and computability, 1997.
Verification of programs with half-duplex communication, Inf. Comput, vol.202, issue.2, 2005. ,
, we denote with { {(q, ?)} } the configuration (z, ?) where z = q, if q ? {q 1 , .., q n }, or z = q i , if q = q i