Vincent Danos
Laurent Regnier
1999
Reversible, irreversible and optimal λ-machines
Theoretical Computer Science
227
1
79–97
10.1016/S0304-3975(99)00049-3
Thomas Ehrhard
Laurent Regnier
2003
The differential lambda-calculus
Theoretical Computer Science
309
1-3
1–41
10.1016/S0304-3975(03)00392-X
https://hal.archives-ouvertes.fr/hal-00150572
41 pages
Thomas Ehrhard
Laurent Regnier
2006
Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms
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
186–197
10.1007/11780342_20
https://hal.archives-ouvertes.fr/hal-00150273
12 pages
Thomas Ehrhard
Laurent Regnier
2008
Uniformity and the Taylor expansion of ordinary lambda-terms
Journal of Theoretical Computer Science
403
2-3
347–372
10.1016/j.tcs.2008.06.001
https://hal.archives-ouvertes.fr/hal-00150275
Lionel Vaux
2009
The algebraic lambda calculus
Mathematical Structures in Computer Science
19
1029–1059
10.1017/S0960129509990089
http://journals.cambridge.org/article_S0960129509990089