1. Erika De Benedetti (2011): Polynomial Lambda-Calculus via Intersection Types. Università degli Studi di Torino.
  2. Alexis Bernadet & Stéphane Lengrand (2011): Complexity of strongly normalising λ-terms via non-idempotent intersection types. In: Martin Hofmann: Proceedings of (FOSSACS'11), LNCS 6604. Springer, doi:10.1007/978-3-642-19805-2_7.
  3. Antonio Bucciarelli, Thomas Ehrhard & Giulio Manzonetto (2007): Not Enough Points Is Enough. In: Jacques Duparc & Thomas A. Henzinger: Proceedings of CSL 2007, LNCS 4646. Springer, pp. 298–312, doi:10.1007/978-3-540-74915-8_24.
  4. Daniel de Carvalho (2009): Execution Time of lambda-Terms via Denotational Semantics and Intersection Types. MSCS to appear. Available at
  5. Pietro Di Gianantonio, Furio Honsell & Marina Lenisa (2008): A type assignment system for game semantics. Theoretical Computer Science 398, pp. 150–169, doi:10.1016/j.tcs.2008.01.023.
  6. Marco Gaboardi & Simona Ronchi Della Rocca (2007): A Soft Type Assignment System for λ-Calculus. In: Jacques Duparc & Thomas A. Henzinger: Proceedings of CSL'07, LNCS 4646. Springer, pp. 253–267, doi:10.1007/978-3-540-74915-8_21.
  7. Assaf J. Kfoury (2000): A Linearization of the Lambda-Calculus and Consequences. J. Logic Comp. 10(3), pp. 411–436, doi:10.1093/logcom/10.3.411.
  8. Assaf J. Kfoury & J. B. Wells (2004): Principality and type inference for intersection types using expansion variables. Theoretical Computer Science 311(1-3), pp. 1–70, doi:10.1016/j.tcs.2003.10.032.
  9. Y. Lafont (2004): Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), pp. 163–180, doi:10.1016/j.tcs.2003.10.018.
  10. Harry Mairson & Peter M. Neergaard (2004): Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In: proceedings of ICFP 2004, pp. 138–149, doi:10.1145/1016850.1016871.
  11. Peter Møller Neergaard (2005): Theoretical Pearls: A bargain for intersection types: a simple strong normalization proof. J. Funct. Program. 15(5), pp. 669–677. Available at
  12. Michele Pagani & Simona Ronchi Della Rocca (2010): Solvability in Resource Lambda-Calculus. In: C.-H. Luke Ong: Proceedings of FOSSACS 2010, LNCS 6014. Springer, pp. 358–373, doi:10.1007/978-3-642-12032-9_25.
  13. Michele Pagani & Simona Ronchi Della Rocca (2010): Linearity, Non-determinism and Solvability. Fundamenta Informaticae 103, pp. 358–373.
  14. Luca Paolini, Mauro Piccolo & Simona Ronchi Della Rocca (2012): Logical Relational Lambda-Models. Available at DRAFT.
  15. K. Terui (2006): Intersection Types for Computational Complexity. Available at Slides.

Comments and questions to:
For website issues: