1. Pablo Arrighi & Alejandro D\'ıaz-Caro (2011): Scalar system F for linear-algebraic lambda-calculus: towards a quantum physical logic. In: Bob Coecke, Prakash Panangaden & Peter Selinger: Proceedings of QPL-2009, Electronic Notes in Theoretical Computer Science 270/2. Elsevier, pp. 219–229, doi:10.1016/j.entcs.2011.01.033. Available at
  2. Pablo Arrighi, Alejandro D\'ıaz-Caro & Beno^ıt Valiron (2011): A type system for the vectorial aspects of the linear-algebraic lambda-calculus. In: Proceedings of the 7th International Workshop on Developments of Computational Methods (DCM 2011), Zurich, Switzerland. Available at To appear in EPTCS.
  3. Pablo Arrighi & Gilles Dowek (2008): Linear-algebraic lambda-calculus: higher-order, encodings, and confluence. In: Andrei Voronkov: Proceedings of RTA-2008, Lecture Notes in Computer Science 5117. Springer, pp. 17–31, doi:10.1007/978-3-540-70590-1_2. Available at
  4. Henk P. Barendregt (1992): Lambdar-calculi with types. Handbook of Logic in Computer Science II. Oxford University Press.
  5. Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson & Benoît Valiron (2010): Equivalence of Algebraic λ-calculi. In: Informal Proceedings of the 5th International Workshop on Higher-Order Rewriting, HOR-2010, Edinburgh, UK, pp. 6–11. Available at
  6. Alejandro D\'ıaz-Caro & Barbara Petit (2010): Sums in linear algebraic lambda-calculus. Available at Submitted.
  7. Thomas Ehrhard (2003): On Köthe sequence spaces and linear logic. Mathematical Structures in Computer Science 12(5), pp. 579–623, doi:10.1017/S0960129502003729.
  8. Thomas Ehrhard (2005): Finiteness spaces. Mathematical Structures in Computer Science 15(4), pp. 615–646, doi:10.1017/S0960129504004645.
  9. Thomas Ehrhard (2010): A Finiteness Structure on Resource Terms. In: Proceedings of LICS-2010. IEEE Computer Society, pp. 402–410, doi:10.1109/LICS.2010.38. Available at
  10. Thomas Ehrhard & Laurent Regnier (2003): The differential lambda-calculus. Theoretical Computer Science 309(1), pp. 1–41, doi:10.1016/S0304-3975(03)00392-X.
  11. Jean-Yves Girard, Yves Lafont & Paul Taylor (1989): Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press. Available at
  12. Jean-Louis Krivine (1990): Lambda-calcul: types et modèles. Études et recherches en informatique. Masson.
  13. Michele Pagani & Simona Ronchi Della Rocca (2010): Solvability in Resource Lambda Calculus. In: Luke Ong: Proceedings of FOSSACS-2010, Lecture Notes in Computer Science 6014. Springer, pp. 358–373, doi:10.1007/978-3-642-12032-9_25.
  14. Michele Pagani & Paolo Tranquilli (2009): Parallel Reduction in Resource Lambda-Calculus. In: Zhenjiang Hu: Proceedings of APLAS-2009, Lecture Notes in Computer Science 5904. Springer, pp. 226–242, doi:10.1007/978-3-642-10672-9_17.
  15. John C. Reynolds (1974): Towards a theory of type structure. In: B. Robinet: Proceedings of the Colloque sur la Programmation, Lecture Notes in Computer Science 19. Springer, pp. 408–425, doi:10.1007/3-540-06859-7_148. Available at
  16. Christine Tasson (2009): Algebraic totality, towards completeness. In: Pierre-Louis Curien: Proceedings of TLCA-2009, Lecture Notes in Computer Science 5608. Springer, pp. 325–340, doi:10.1007/978-3-642-02273-9_24. Available at
  17. TeReSe (2003): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge University Press.
  18. Lionel Vaux (2007): On Linear Combinations of λ-Terms. In: Franz Baader: Proceedings of RTA-07, Lecture Notes in Computer Science 4533. Springer, pp. 374–388, doi:10.1007/978-3-540-73449-9_28. Available at
  19. Lionel Vaux (2009): The algebraic lambda calculus. Mathematical Structures in Computer Science 19(5), pp. 1029–1059, doi:10.1017/S0960129509990089. Available at

Comments and questions to:
For website issues: