Bounding normalization time through intersection types. - Erika De Benedetti; Simona Ronchi Della Rocca (ITRS, 2012)

A type assignment for lambda-calculus complete both for FPTIME and strong normalization. - Erika De Benedetti; Simona Ronchi Della Rocca (CoRR, 2014)

Call-by-Value, Elementary Time and Intersection Types. - Erika De Benedetti; Simona Ronchi Della Rocca (FOPARA, 2015)

Linear logic, type assignment systems and implicit computational complexity. (Logique linéaire, systèmes de types et complexité implicite). - Erika De Benedetti (2015)

A type assignment for λ-calculus complete both for FPTIME and strong normalization. - Erika De Benedetti; Simona Ronchi Della Rocca (Inf. Comput., 2016)

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. - Patrick Baillot; Erika De Benedetti; Simona Ronchi Della Rocca (Inf. Comput., 2018)