1. Suzana Andova (1999): Process Algebra with Probabilistic Choice. In: Joost-Pieter Katoen: Formal Methods for Real-Time and Probabilistic Systems, Lecture Notes in Computer Science 1601, pp. 111–129, doi:10.1007/3-540-48778-6_7.
  2. Pablo Arrighi & Alejandro Díaz-Caro (2012): A System F Accounting for Scalars. Logical Methods in Computer Science 8(1):11, doi:10.2168/LMCS-8(1:11).
  3. Pablo Arrighi, Alejandro Díaz-Caro & Benoît Valiron (2012): A Type System for the Vectorial Aspects of the Linear-Algebraic Lambda-Calculus. In: Elham Kashefi, Jean Krivine & Femke van Raamsdonk: Developments in Computational Models, Electronic Proceedings in Theoretical Computer Science 88, pp. 1–15, doi:10.4204/EPTCS.88.1.
  4. Pablo Arrighi, Alejandro Díaz-Caro & Benoît Valiron (2013): The Vectorial Lambda-Calculus. Available at (Under review).
  5. Pablo Arrighi & Gilles Dowek (2008): Linear-algebraic λ-calculus: higher-order, encodings, and confluence. In: Andrei Voronkov: Rewriting Techniques and Applications, Lecture Notes in Computer Science 5117, pp. 17–31, doi:10.1007/978-3-540-70590-1_2. Available at
  6. Henk Barendregt (1984): The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam.
  7. John J. Benedetto & Wojciech Czaja (2009): Integration and Modern Analysis, chapter Lebesgue Measure and General Measure Theory, Birkhiäuser Advanced Texts Basler Lehrbücher. Birkhäuser Boston, doi:10.1007/978-0-8176-4656-1.
  8. Gérard Boudol (1994): Lambda-Calculi for (Strict) Parallel Functions. Information and Computation 108(1), pp. 51–127, doi:10.1006/inco.1994.1003.
  9. Olivier Bournez & Mathieu Hoyrup (2003): Rewriting Logic and Probabilities. In: Robert Nieuwenhuis: Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706, pp. 61–75, doi:10.1007/3-540-44881-0_6. Available at
  10. Antonio Bucciarelli, Thomas Ehrhard & Giulio Manzonetto (2012): A Relational Semantics for Parallelism and Non-Determinism in a Functional Setting. Annals of Pure and Applied Logic 163(7), pp. 918–934, doi:10.1016/j.apal.2011.09.008. Available at
  11. Ugo Dal Lago & Margherita Zorzi (2012): Probabilistic operational semantics for the lambda calculus. RAIRO - Theoretical Informatics and Applications 46(03), pp. 413–450, doi:10.1051/ita/2012012. Available at
  12. Ugo de'Liguoro & Adolfo Piperno (1995): Non Deterministic Extensions of Untyped λ-calculus. Information and Computation 122(2), pp. 149–177, doi:10.1006/inco.1995.1145.
  13. Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro & Adolfo Piperno (1998): A filter model for concurrent λ-calculus. SIAM Journal on Computing 27(5), pp. 1376–1419, doi:10.1137/S0097539794275860.
  14. Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2005): Probabilistic λ-Calculus and Quantitative Program Analysis. Journal of Logic and Computation 15(2), pp. 159–179, doi:10.1093/logcom/exi008.
  15. Alejandro Díaz-Caro & Gilles Dowek (2013): Non determinism through type isomorphism. In: Delia Kesner & Petrucio Viana: Logical and Semantic Frameworks, with Applications, Electronic Proceedings in Theoretical Computer Science 113, pp. 137–144, doi:10.4204/EPTCS.113.13.
  16. Alejandro Díaz-Caro & Gilles Dowek (2013): Normalisation of a non-deterministic type isomorphic λ-calculus. Available at (Under review).
  17. Alejandro Díaz-Caro, Giulio Manzonetto & Michele Pagani (2013): Call-by-value non-determinism in a linear logic type discipline. In: Sergei Artemov & Anil Nerode: Logical Foundations of Computer Science, Lecture Notes in Computer Science 7734, pp. 164–178, doi:10.1007/978-3-642-35722-0_12.
  18. Alejandro Díaz-Caro & Barbara Petit (2012): Linearity in the non-deterministic call-by-value setting. In: Luke Ong & Ruy de Queiroz: Logic, Language, Information and Computation, Lecture Notes in Computer Science 7456, pp. 216–231, doi:10.1007/978-3-642-32621-9_16. Available at
  19. Herman Geuvers, Robbert Krebbers, James McKinna & Freek Wiedijk (2010): Pure Type Systems without Explicit Contexts. In: Karl Crary & Marino Miculan: Logical Frameworks and Meta-languages: Theory and Practice, Electronic Proceedings in Theoretical Computer Science 34, pp. 53–67, doi:10.4204/EPTCS.34.6.
  20. Oltea Mihaela Herescu & Catuscia Palamidessi (2000): Probabilistic Asynchronous π-Calculus. In: Jerzy Tiuryn: Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 1784, pp. 146–160, doi:10.1007/3-540-46432-8_10. Available at
  21. Michele Pagani & Simona Ronchi Della Rocca (2010): Linearity, non-determinism and solvability. Fundamental Informaticae 103(1–4), pp. 173–202, doi:10.3233/FI-2010-324.
  22. Jonghyun Park, Jeongbong Seo, Sungwoo Park & Gyesik Lee (2013): Mechanizing Metatheory without Typing Contexts. Journal of Automated Reasoning, doi:10.1007/s10817-013-9287-4.
  23. TeReSe (2003): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge University Press.
  24. 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: