References

  1. Vincent Danos & Laurent Regnier (1999): Reversible, irreversible and optimal λ-machines. Theoretical Computer Science 227(1), pp. 79–97, doi:10.1016/S0304-3975(99)00049-3.
  2. Thomas Ehrhard & Laurent Regnier (2003): The differential lambda-calculus. Theoretical Computer Science 309(1-3), pp. 1–41, doi:10.1016/S0304-3975(03)00392-X. Available at https://hal.archives-ouvertes.fr/hal-00150572. 41 pages.
  3. Thomas Ehrhard & Laurent Regnier (2006): Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. In: A. Beckmann, U. Berger, B. Löwe & J.V. Tucker: Second Conference on Computability in Europe, CiE 2006, LNCS 3988. Springer Berlin / Heidelberg, Swansea, United Kingdom, pp. 186–197, doi:10.1007/11780342_20. Available at https://hal.archives-ouvertes.fr/hal-00150273. 12 pages.
  4. Thomas Ehrhard & Laurent Regnier (2008): Uniformity and the Taylor expansion of ordinary lambda-terms. Journal of Theoretical Computer Science 403(2-3), pp. 347–372, doi:10.1016/j.tcs.2008.06.001. Available at https://hal.archives-ouvertes.fr/hal-00150275.
  5. Lionel Vaux (2009): The algebraic lambda calculus. Mathematical Structures in Computer Science 19, pp. 1029–1059, doi:10.1017/S0960129509990089. Available at http://journals.cambridge.org/article_S0960129509990089.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org