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

T. Amtoft, F. Nielson, and H. Nielson, Type and Effect Systems: Behaviours for Concurrency, 1999.
DOI : 10.1142/p132

R. Bird and L. Meertens, Nested datatypes, MPC'98, pp.52-67, 1998.
DOI : 10.1007/BFb0054285

R. Bird and R. Paterson, de Bruijn notation as a nested datatype, Journal of Functional Programming, vol.9, issue.1, pp.77-91, 1999.
DOI : 10.1017/S0956796899003366

V. Bono, L. Padovani, and A. Tosatto, Polymorphic Types for Leak Detection in a Session-Oriented Functional Language, FORTE'13, pp.83-98, 2013.
DOI : 10.1007/978-3-642-38592-6_7

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

G. Cécé and A. Finkel, Verification of programs with half-duplex communication, Information and Computation, vol.202, issue.2, pp.166-190, 2005.
DOI : 10.1016/j.ic.2005.05.006

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.1145/2370776.2370794
URL : https://hal.archives-ouvertes.fr/hal-00909389

S. J. Gay and V. T. Vasconcelos, Linear type theory for asynchronous session types, Journal of Functional Programming, vol.73, issue.01, pp.19-50, 2010.
DOI : 10.1006/inco.1994.1093

K. Honda, Types for dyadic interaction, CONCUR'93, pp.509-523, 1993.
DOI : 10.1007/3-540-57208-2_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.1355

K. Honda, V. T. Vasconcelos, and M. Kubo, Language primitives and type discipline for structured communication-based programming, ESOP'98, pp.122-138, 1998.
DOI : 10.1007/BFb0053567

A. Igarashi, Type-based analysis of usage of values for concurrent programming languages, 1997.

A. Igarashi and N. Kobayashi, Type-based analysis of communication for concurrent programming languages, SAS'97, pp.187-201, 1997.
DOI : 10.1007/BFb0032742

G. Kahn, The semantics of simple language for parallel programming, IFIP Congress, pp.471-475, 1974.

N. Kobayashi, Quasi-linear types, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.29-42, 1999.
DOI : 10.1145/292540.292546

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, A New Type System for Deadlock-Free Processes, CONCUR'06, pp.233-247, 2006.
DOI : 10.1007/11817949_16

N. Kobayashi and D. Sangiorgi, A hybrid type system for lockfreedom of mobile processes, ACM Trans. Program. Lang. Syst, vol.32, issue.5, 2010.

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

R. Milner, The Polyadic ??-Calculus: a Tutorial, Logic and Algebra of Specification, 1993.
DOI : 10.1007/978-3-642-58041-3_6

F. Nielson and H. R. Nielson, Constraints for Polymorphic Behaviours of Concurrent ML, CCL'94, pp.73-88, 1994.

F. Nielson and H. R. Nielson, Type and effect systems, Correct System Design, pp.114-136, 1999.

H. R. Nielson and F. Nielson, Higher-order concurrent programs with finite communication topology, POPL'94, pp.84-97, 1994.

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, 2014.
DOI : 10.1145/2603088.2603116
URL : https://hal.archives-ouvertes.fr/hal-00932356

B. C. Pierce and D. Sangiorgi, Typing and subtyping for mobile processes, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.409-453, 1996.
DOI : 10.1109/LICS.1993.287570

F. Puntigam, Non-regular Process Types, Euro-Par'99, pp.1334-1343, 1999.
DOI : 10.1007/3-540-48311-X_189

J. H. Reppy, CML: A Higher-Order Concurrent Language, PLDI'91, pp.293-305, 1991.

J. H. Reppy, Concurrent Programming in ML, 1999.
DOI : 10.1017/CBO9780511574962

D. Sangiorgi and D. Walker, The Pi-Calculus -a theory of mobile processes, 2001.

K. Suenaga and N. Kobayashi, Fractional Ownerships for Safe Memory Deallocation, APLAS'09, pp.128-143, 2009.
DOI : 10.1007/978-3-642-10672-9_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.5197

D. N. Turner, P. Wadler, and C. Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.1-11, 1995.
DOI : 10.1145/224164.224168

P. Wadler, Linear types can change the world! In Programming Concepts and Methods, 1990.

P. Wadler, Propositions as sessions, ICFP'12, pp.273-286, 2012.

A. K. Wright and M. Felleisen, A Syntactic Approach to Type Soundness, Information and Computation, vol.115, issue.1, pp.38-94, 1994.
DOI : 10.1006/inco.1994.1093