L. Caires, B. Toninho, and &. Pfenning, Dependent Session Types via Intuitionistic Linear Type Theory, 2011.

U. Dal-lago and &. Baillot, On light logics, uniform encodings and polynomial time, Mathematical Structures in Computer Science, vol.16, issue.04, pp.713-733, 2006.
DOI : 10.1017/S0960129506005421
URL : https://hal.archives-ouvertes.fr/hal-00019515

U. Dal-lago, A. Masini, and M. Zorzi, Quantum implicit computational complexity, Theoretical Computer Science, vol.411, issue.2, pp.377-409, 2010.
DOI : 10.1016/j.tcs.2009.07.045

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

K. Honda, V. Thudichum-vasconcelos, and &. Kubo, Language primitives and type discipline for structured communication-based programming, ESOP, LNCS 1381, pp.122-138, 1998.
DOI : 10.1007/BFb0053567

K. Honda, N. Yoshida, and &. Marco-carbone, Multiparty asynchronous session types, pp.273-284, 2008.

Y. Lafont, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, pp.163-180, 2004.
DOI : 10.1016/j.tcs.2003.10.018

G. Harry and . Mairson, A Simple Proof of a Theorem of Statman, Theor. Comput. Sci, vol.103, issue.2, pp.387-394, 1992.

D. Mostrous and &. Yoshida, Two Session Typing Systems for Higher-Order Mobile Processes, TLCA 2007, pp.321-335, 2007.
DOI : 10.1007/978-3-540-73228-0_23

R. Statman, The typed ??-calculus is not elementary recursive, Theoretical Computer Science, vol.9, issue.1, pp.73-81, 1979.
DOI : 10.1016/0304-3975(79)90007-0