B. Accattoli & S. Guerrini (2009):
Jumping Boxes.
In: Erich Grädel & Reinhard Kahle: Computer Science Logic,
Lecture Notes in Computer Science 5771.
Springer Berlin Heidelberg,
pp. 55–70,
doi:10.1007/978-3-642-04027-6_7.
S. Blom (2001):
Term Graph Rewriting – Syntax and Semantics.
Vrije Universiteit Amsterdam.
N. Bourbaki (1954):
Éléments de mathématiques: Théories des ensembles.
Hermann.
N. Ghani, C. Lüth & F. de Marchi (2005):
Monads of coalgebras: rational terms and term graphs.
Mathematical Structures in Computer Science 15,
pp. 433–451,
doi:10.1017/S0960129505004743.
C. Grabmayer & J. Rochel (2013):
Term Graph Representations for Cyclic Lambda Terms.
In: Proceedings of TERMGRAPH 2013,
EPTCS 110,
pp. 56–73,
doi:10.4204/EPTCS.110.
Extending report: arXiv:1308.1034.
C. Grabmayer & J. Rochel (2014):
Maximal Sharing in the Lambda Calculus with letrec.
In: Proceedings of ICFP '14, September 1–6, 2014, Gothenburg, Sweden,
pp. 67–80,
doi:10.1145/2628136.2628148.
R.J.M. Hughes (1982):
Supercombinators: A new implementation method for applicative languages.
In: LFP '82: Proceedings of the 1982 ACM symposium on LISP and functional programming,
pp. 1–10,
doi:10.1145/800068.802129.
J. R. Kennaway, J. W. Klop, M. R. Sleep & F. J. de Vries (1994):
On the Adequacy of Graph Rewriting for Simulating Term Rewriting.
ACM Trans. Program. Lang. Syst. 16(3),
pp. 493–523,
doi:10.1145/177492.177577.
E. Kohlbecker, D.P. Friedman, M. Felleisen & B. Duba (1986):
Hygienic Macro Expansion.
In: Proceedings of the 1986 ACM Conference on LISP and Functional Programming,
LFP '86.
ACM,
pp. 151–161,
doi:10.1145/319838.319859.
Y. Lafont (1990):
Interaction Nets.
In: POPL '90.
ACM Press,
pp. 95–108,
doi:10.1145/96709.96718.
C. Lüth (1997):
Categorial Term Rewriting: Monads and Modularity.
University of Edinburgh.
C. Lüth & N. Ghani (1997):
Monads and modular term rewriting.
In: E. Moggi & G. Rosolini: Category Theory and Computer Science,
Lecture Notes in Computer Science 1290.
Springer Berlin Heidelberg,
pp. 69–86,
doi:10.1007/BFb0026982.
D. Plump (1999):
Term Graph Rewriting.
In: H. Ehrig, G. Engels, H.-J. Kreowski & G. Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformation 2.
World Scientific,
pp. 3–61,
doi:10.1142/9789812815149_0001.
W. Van Orman Quine (1940):
Mathematical Logic.
Harvard University Press, Cambridge, Mass..
F. van Raamsdonk (1996):
Confluence and Normalisation for Higher-Order Rewriting.
Vrije Universiteit Amsterdam.
M.R. Sleep, M.J. Plasmeijer & M.C.J.D. van Eekelen (1993):
Term Graph Rewriting – Theory and Practice.
John Wiley & Sons.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.