1. Atassi, V., Baillot, P., Terui, K.: Verification of PTIME reducibility for System F terms: type inference in dual light affine logic. Logical Methods in Computer Science 3(4:10), 1–32 (2007)
2. Gaboardi, M., Marion, J.-Y., Rocca, S.R.D.: A logical account of PSPACE. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, pp. 121–131. ACM, New York (2008)
3. Gaboardi, M., Marion, J.-Y., Rocca, S.R.D.: Soft linear logic and polynomial complexity classes. ENTCS 205, 67–87 (2008)
4. Lecture Notes in Computer Science;M. Gaboardi,2007
5. Gaboardi, M., Rocca, S.R.D.: Type inference for a polynomial lambda calculus. In: Berardi, S., Damiani, F., De’Liguoro, U. (eds.) Types for Proofs and Programs, pp. 136–152. Springer, Heidelberg (2009)