Zena M. Ariola & Stefan Blom (1997):
Cyclic Lambda Calculi.
In: Martin Abadi & Takayasu Ito: Proceedings of TACS'97, Sendai, Japan, September 23–26, 1997,
LNCS 1281.
Springer Berlin / Heidelberg,
pp. 77–106,
doi:10.1007/BFb0014548.
Zena M. Ariola & Jan Willem Klop (1994):
Cyclic Lambda Graph Rewriting.
In: Proceedings of the Symposium on Logic in Computer Science (LICS) 1994,
pp. 416 –425,
doi:10.1109/LICS.1994.316066.
Zena M. Ariola & Jan Willem Klop (1996):
Equational Term Graph Rewriting.
Fundamenta Informaticae 26(3),
pp. 207–240,
doi:10.3233/FI-1996-263401.
Stefan Blom (2001):
Term Graph Rewriting, Syntax and Semantics.
Vrije Universiteit Amsterdam.
N. G. de Bruijn (1972):
Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem.
Indagationes Mathematicae 34,
pp. 381–392,
doi:10.1016/1385-7258(72)90034-0.
Clemens Grabmayer & Jan Rochel (2012):
Expressibility in the Lambda-Calculus with Letrec.
Technical Report arXiv:1208.2383.
http://arxiv.org.
http://arxiv.org/abs/1208.2383.
Dimitri Hendriks & Vincent van Oostrom (2003):
Lambda.
In: F. Baader: Proceedings CADE-19,
Lecture Notes in Artificial Intelligence 2741.
Springer–Verlag,
pp. 136–150.
Simon Peyton Jones (1987):
The Implementation of Functional Programming Languages.
Prentice-Hall, Inc..
Vincent van Oostrom, Kees-Jan van de Looij & Marijn Zwitserlood (2004):
Lambdascope.
Extended Abstract for the Workshop on Algebra and Logic on Programming Systems (ALPS), Kyoto, April 10th 2004.
http://www.phil.uu.nl/~oostrom/publication/pdf/lambdascope.pdf.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.
eptcs@eptcs.org