- Andrei Dorman and Damiano Mazza. A Polytime Lambda-Calculus Based on Linear Logic by Levels
- Simona Ronchi Della Rocca and Erika De Benedetti. A complete polynomial lambda calculus
- Beniamino Accattoli and Ugo Dal Lago. On the invariance of derivational complexity for head reduction
- Patrick Baillot and Ugo Dal Lago. Higher-Order Interpretations and Program Complexity
- Alois Brunel and Marco Gaboardi. Realizability Models for ldPCF
- Stefano Guerrini, Thomas Leventis and Marco Solieri. Deep into Optimality - Complexity and correctness of sharing implementation of bounded logics
- Barbara Petit. Toward a Bounded Linear Type system for PCF in Call-by-value.
- Matthieu Perrinel. On the expressivity of linear logic subsystems characterizing polynomial time
- Martin Avanzini, Naohi Eguchi and Georg Moser. New Path Order that Induces Tight Polynomial Derivation Lengths
- James Laird and Pierre Clairambault. A Bounded Linear Type Theory for Encapsulated State (and its Game Semantics)
- Reinhard Kahle and Isabel Oitavem. Recursion and Induction for Computational Complexity
- Alois Brunel and Antoine Madet. Quantitative classical realizability for side effects and recursive types