T. Amtoft, F. Nielson, and H. Nielson, Type and effect systems: behaviours for concurrency, 1999.
DOI : 10.1142/p132

T. Amtoft, F. Nielson, and H. R. Nielson, Type and behaviour reconstruction for higher-order concurrent programs, Journal of Functional Programming, vol.7, issue.3, pp.321-347, 1997.
DOI : 10.1017/S0956796897002700

M. Coppo, M. Dezani-ciancaglini, L. Padovani, and N. Yoshida, Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions, COORDINATION'13, pp.45-59, 2013.
DOI : 10.1007/978-3-642-38493-6_4
URL : https://hal.archives-ouvertes.fr/hal-01486034

B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science, vol.25, issue.2, pp.95-169, 1983.
DOI : 10.1016/0304-3975(83)90059-2

O. Dardha, E. Giachino, and D. Sangiorgi, Session types revisited, PPDP'12, pp.139-150, 2012.
DOI : 10.1016/j.ic.2017.06.002
URL : https://hal.archives-ouvertes.fr/hal-01647086

P. Deniélou and N. Yoshida, Multiparty Session Types Meet Communicating Automata, ESOP'12, pp.194-213, 2012.
DOI : 10.1007/978-3-642-28869-2_10

F. Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2, pp.253-289, 1993.
DOI : 10.1145/169701.169692
URL : http://www.diku.dk/hjemmesider/ansatte/henglein/papers/henglein1993a.pdf

K. Honda, N. Yoshida, and M. Carbone, Multiparty asynchronous session types, POPL'08, pp.273-284, 2008.
DOI : 10.1145/1328897.1328472
URL : http://www.doc.ic.ac.uk/~yoshida/multiparty/multiparty_full.pdf

A. Igarashi and N. Kobayashi, Type Reconstruction for Linear ??-Calculus with I/O Subtyping, Information and Computation, vol.161, issue.1, pp.1-44, 2000.
DOI : 10.1006/inco.2000.2872

A. J. Kfoury, J. Tiuryn, and P. Urzyczyn, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2, pp.290-311, 1993.
DOI : 10.1145/169701.169687

N. Kobayashi, A Type System for Lock-Free Processes, Information and Computation, vol.177, issue.2, pp.122-159, 2002.
DOI : 10.1016/S0890-5401(02)93171-8

N. Kobayashi, Type-based information flow analysis for the ??-calculus, Acta Informatica, vol.15, issue.2/3, pp.291-347, 2005.
DOI : 10.3233/JCS-1996-42-304

N. Kobayashi, A New Type System for Deadlock-Free Processes, CONCUR'06, pp.233-247, 2006.
DOI : 10.1007/11817949_16

N. Kobayashi, B. C. Pierce, and D. N. Turner, Linearity and the pi-calculus, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, pp.914-947, 1999.
DOI : 10.1145/330249.330251

J. Lange and E. Tuosto, Synthesising Choreographies from Local Session Types, CON- CUR'12, pp.225-239, 2012.
DOI : 10.1007/978-3-642-32940-1_17

J. Lange, E. Tuosto, and N. Yoshida, From communicating machines to graphical choreographies, POPL'15, pp.221-232, 2015.
DOI : 10.1145/2775051.2676964
URL : https://lra.le.ac.uk/bitstream/2381/31932/1/full_version.pdf

L. G. Mezzina, How to Infer Finite Session Types in a Calculus of Services and Sessions, COORDINATION'08, pp.216-231, 2008.
DOI : 10.1007/978-3-540-68265-3_14

L. Padovani, Deadlock and lock freedom in the linear ??-calculus, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-7210, 2014.
DOI : 10.1145/2603088.2603116
URL : https://hal.archives-ouvertes.fr/hal-00932356

L. Padovani, Type Reconstruction for the Linear ??-Calculus with Composite and Equi-Recursive Types, FoSSaCS'14, pp.88-102, 2014.
DOI : 10.1007/978-3-642-54830-7_6