Samson Abramsky (1990):
The Lazy Lambda Calculus.
In: Research Topics in Functional Programming.
Addison-Wesley,
pp. 65–116.
Updated version (2006) available at http://web.comlab.ox.ac.uk/people/Samson.Abramsky/lazy.pdf.
Andrea Asperti & Stefano Guerrini (1998):
The Optimal Implementation of Functional Programming Languages.
Cambridge Tracts in Theoretical Computer Science 45.
Cambridge University Press.
H.P. Barendregt (1984):
The Lambda Calculus: Its Syntax and Semantics,
2nd edition,
SLFM 103.
Elsevier.
N.G. de Bruijn (1987):
Generalizing Automath by Means of a Lambda-Typed Lambda Calculus.
Technical Report AUT092 (AUTOMATH archive http://www.win.tue.nl/automath/).
Technische Universiteit Eindhoven, Eindhoven, the Netherlands.
Available at http://alexandria.tue.nl/repository/freearticles/597608.pdf.
Olivier Danvy (1999):
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping.
In: Aart Middeldorp & Taisuke Sato: Functional and Logic Programming,
LNCS 1722.
Springer Berlin / Heidelberg,
pp. 241–250,
doi:10.1007/10705424_16.
Olivier Danvy & Ulrik Schultz (2002):
Lambda-Lifting in Quadratic Time.
In: Zhenjiang Hu & Mario Rodríguez-Artalejo: Functional and Logic Programming,
LNCS 2441.
Springer Berlin / Heidelberg,
pp. 134–151,
doi:10.1007/3-540-45788-7_8.
Olivier Danvy & Ulrik P. Schultz (1997):
Lambda-dropping: transforming recursive equations into programs with block structure.
In: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation,
PEPM '97.
ACM,
New York, NY, USA,
pp. 90–106,
doi:10.1145/258993.259007.
Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop & Vincent van Oostrom (2010):
On Equal μTerms.
Submitted, currently under review, to be published in 2011.
M. S. Hecht & J. D. Ullman (1974):
Characterizations of Reducible Flow Graphs.
JACM 21,
pp. 367–375,
doi:10.1145/321832.321835.
Thomas Johnsson (1985):
Lambda lifting: Transforming programs to recursive equations.
In: Jean-Pierre Jouannaud: Functional Programming Languages and Computer Architecture,
LNCS 201.
Springer Berlin / Heidelberg,
pp. 190–203,
doi:10.1007/3-540-15975-4_37.
Fairouz Kamareddine & Rob Nederpelt (1995):
Refining reduction in the lambda calculus.
Journal of Functional Programming 5(4),
pp. 637–651,
doi:10.1017/S0956796800001507.
Simon L. Peyton Jones (1987):
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science).
Prentice-Hall, Inc.,
Upper Saddle River, NJ, USA.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.
eptcs@eptcs.org