P. Baillot, On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. Information and Computation 241, pp.3-31, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01948302

, Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Information and Computation 261, pp.55-77, 2018.

P. Baillot-&-alexis-ghyselen, Combining Linear Logic and Size Types for Implicit Complexity, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), vol.9, pp.1-9, 2018.

M. Boja?czyk, Polyregular Functions. CoRR, 2018.

A. Carraro and &. Guerrieri, A Semantical and Operational Account of Call-by-Value Solvability, Foundations of Software Science and Computation Structures (FoSSaCS'14), pp.103-118, 2014.

, On light logics, uniform encodings and polynomial time, Mathematical Structures in Computer Science, vol.16, issue.4, pp.713-733, 2006.

V. Danos and &. Joinet, Linear logic and elementary time, Information and Computation, vol.183, issue.1, pp.123-137, 2003.

S. Rocca and U. Coppola, Light Logics and the Call-by-Value Lambda Calculus, Logical Methods in Computer Science, vol.4, issue.4, 2008.

J. Girard, Light Linear Logic. Information and Computation, vol.143, pp.175-204, 1998.

C. Grellois, Semantics of linear logic and higher-order model-checking, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01311150

C. Grellois, &. Paul-andré, and . Melliès, Mathematical Foundations of Computer Science 2015 -40th International Symposium, MFCS 2015, pp.256-268, 2015.

G. Guerrieri and &. Manzonetto, The Bang Calculus and the Two Girard's Translations. Electronic Proceedings in Theoretical Computer Science, vol.292, pp.15-30, 2019.

G. Gerd and . Hillebrand, Finite Model Theory in the Simply Typed Lambda Calculus, 1994.

G. Gerd, . Hillebrand, C. Paris, and . Kanellakis, On the Expressive Power of Simply Typed and LetPolymorphic Lambda Calculi, Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pp.253-263, 1996.

, Around finite second-order coherence spaces, Lê Thành D?ng Nguy?n, 2019.

, From normal functors to logarithmic space queries, 46th International Colloquium on Automata, Languages and Programming (ICALP'19), 2019.

L. Regnier, Une équivalence sur les lambda-termes, Theoretical Computer Science, vol.126, issue.2, pp.281-292, 1994.

A. Simpson, Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics, 16th International Conference on Term Rewriting and Applications (RTA'05), pp.219-234, 2005.

K. Terui, Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus, 23rd International Conference on Rewriting Techniques and Applications (RTA'12), pp.323-338, 2012.